Program separation and definitional higher order programming

Computer Languages - Tập 23 - Trang 179-206 - 1997
G. Falkman1
1Department of Computing Science, Chalmers University of Technology, S-412 96 Göteborg, SWEDEN

Tài liệu tham khảo

Hallnäs, 1994, WM94: program separation in GCLA, 93 Falkman, 1994, Program separation in GCLA, 31 Falkman, 1994, Program separation as a basis for definitional higher order programming, 158 Falkman, 1996, Definitional program separation Hallnäs, 1990, A proof-theoretical approach to logic programming, part I, clauses as rules, Journal of Logic and Computation, 1, 261, 10.1093/logcom/1.2.261 Hallnäs, 1991, A proof-theoretical approach to logic programming, part II, programs as definitions, Journal of Logic and Computation, 1, 635, 10.1093/logcom/1.5.635 Aronsson, 1990, The programming language GCLA—a definitional approach to logic programming, New Generation Computing, 7, 381, 10.1007/BF03037453 Aronsson, 1990, A survey of GCLA—a definitional approach to logic programming, Vol. 475 Kreuger, 1992, GCLA II, a definitional approach to control, Vol. 596, 239 Aronsson, 1993, GCLA, The design, use, and implementation of a program development system Aronsson, 1991, GCLA user's manual Hallnäs, 1991, Partial inductive definitions, Theoretical Computer Science, 87, 115, 10.1016/S0304-3975(06)80007-1 Kreuger, 1995, Computational issues in calculi of partial inductive definitions