Lecture 8 (July 13)
- Topic
- Further discussions of metalanguage aspects, the sublanguage
L_lambda and its applications.
- References
-
- G. Nadathur and D.
Miller, Higher-Order Logic Programming. To appear in
Handbook of Logic in AI and Logic Programming,
D. Gabbay, C. Hogger and A. Robinson (eds.) Focus on Sections
8 and 9. (Main)
-
D. Miller, A Logic Programming Language with
lambda-Abstraction, Function Variables, and Simple
Unification, Journal of Logic and Computation 1(4): 497 -
536, 1991. (Main)
-
T. Nipkow, Functional Unification of Higher-Order Patterns.
In Proceedings of the Eighth Annual {IEEE} Symposium on Logic in
Computer Science, M. Vardi (ed), 1993.
Lecture 9 (July 20)
- Topic
- Implementation issues related to lambda Prolog, clause
scoping and backtracking, lambda term representation,
higher-order unification and branching.
- References
-
- G. Nadathur, B. Jayaraman
and K. Kwon, Scoping Constructs in Logic Programming. To
appear in Journal of Logic Programming.
- G. Nadathur, B. Jayaraman and
D. S. Wilson, Implemention Considerations for Higher-Order
Features in Logic Programming, Duke Technical Report
CS-1993-16.
- K. Kwon and
G. Nadathur, An Instruction Set for Higher-Order Hereditary
Harrop Formulas (Extended Abstract), Proceedings of the
Workshop on the lambda Prolog Programming Language,
Philadelphia, 1992. Proceedings available as UPenn Technical
Report MS-CIS-92-86.
- G. Nadathur and
D.S. Wilson, A Notation for Lambda Terms I:
A Generalization of Environments, Duke Technical Report
CS-1994-03. (Aux)
- G. Nadathur, A Notation for
Lambda Terms II: Refinements and Applications, Duke
Technical Report CS-1994-01. (Aux)
- P. Brisset and O.
Ridoux, Naive Reverse can be Linear.
In Proceedings of the Eighth International Conference on Logic
Programming, MIT Press, 1991, pages 857 - 870. (Aux)
- P. Brisset and
O. Ridoux, The Compilation of lambda Prolog
and its execution with MALI. Publication Interne No 687, IRISA,
Rennes, November, 1992.
- M. Abadi, L. Cardelli, P.-L. Curien and J.-J. Levy,
Explicit Substitutions. In Proceedings of the Seventeenth
Annual ACM Symposium on Principles of Programming Languages,
ACM Press, pages 31 - 46, January, 1990. (Aux)
-
G. Dowek, T. Hardin and C. Kirchner, Higher-Order
Unification via Explicit Substitutions. (Instructor has
shorter version that is to appear in Proceedings of
the Tenth Annual Symposium on Logic in Computer Science,
D. Kozen (ed.), IEEE Computer Society Press, June 1995.) (Aux)
Last updated on April 27, 1995 by gopalan@takapoto.pms.informatik.uni-muenchen.de