A treatment of higher-order features in logic programming

Theory and Practice of Logic Programming

Volumn 5, Issue 3, 2005, Pages 305-354

  Nadathur, Gopalan ^a  

^a University of Minnesota   (United States)

Author keywords

Abstract machine; Compilation; Higher order unification; Intensional higher order programming; Lambda calculus

Indexed keywords

COMPUTATION THEORY; ENCODING (SYMBOLS); FUNCTIONS; PROBLEM SOLVING; PROGRAM COMPILERS; SYNTACTICS;

ABSTRACT MACHINES; COMPILATION; HIGHER-ORDER UNIFICATION; LAMBDA CALCULUS;

LOGIC PROGRAMMING;

EID: 20344365071     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002297     Document Type: Article

References (50)

1. ABADI, M., CARDELLI, L., CURIEN, P.-L. AND LÉVY, J.-J. 1991. Explicit substitutions. Journal of Functional Programming 1, 4, 375-416.
2. AIELLO, L. AND PRINI, G. 1981. An efficient interpreter for the lambda-calculus. Journal of Computer and System Sciences 23, 383-425.
3. AÏT-KACI, H. 1991. Warren's Abstract Machine: A Tutorial Reconstruction. MIT Press.
4. ANDREWS, P. B. 1971. Resolution in type theory. Journal of Symbolic Logic 36, 414-432.
5. APPEL, A. W. AND FELTY, A. P. 1999. Lightweight lemmas in λProlog. International Conference on Logic Programming. MIT Press, pp. 411-425.
6. APT, K. R. AND VAN EMDEN, M. H. 1982. Contributions to the theory of logic programming. Journal of the ACM 29, 3, 841-862.
7. BENAISSA, Z., BRIAUD, D., LESCANNE, P. AND ROUYER-DEGLI, J. 1996. λv, a calculus of explicit substitutions which preserves strong normalization. Journal of Functional Programming 6, 5, 699-722.
8. BRISSET, P. AND RIDOUX, O. 1992. The compilation of λProlog and its execution with MALI. Publication Interne No 687, IRISA, Rennes, November.
9. CHURCH, A. 1940. A formulation of the simple theory of types. Journal of Symbolic Logic 5, 56-68.
10. COUSINEAU, G., CURIEN, P.-L. AND MAUNY, M. 1987. The categorical abstract machine. The Science of Programming 8, 2, 173-202.
11. DE BRUIJN, N. 1972. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem. Indag. Math. 34, 5, 381-392.
12. DOWEK, G., HARDIN, T. AND KIRCHNER, C. 2000. Higher-order unification via explicit substitutions. Information and Computation 157, 183-235.
13. DOWEK, G., HARDIN, T., KIRCHNER, C. AND PFENNING, F. 1998. Unification via explicit substitutions: The case for higher-order patterns. Techniical Reportt 3591, INRIA. December.
14. ELLIOTT, C. AND PFENNING, F. 1989. eLP, a Common Lisp Implementation of λProlog. Implemented as part of the CMU ERGO project.
15. ELLIOTT, C. AND PFENNING, F. 1991. A semi-functional implementation of a higher-order logic programming language. In: Topics in Advanced Language Implementation, P. Lee, Ed. MIT Press, pp. 289-325.
16. FAIRBAIRN, J. AND WRAY, S. 1987. TIM: A simple lazy abstract-machine to execute supercombinators. In: Functional Programming Languages and Computer Architecture, G. Kahn, Ed., LNCS 274, Springer-Verlag, pp. 34-45.
17. FELTY, A. 1993. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning 11, 1 (August), 43-81.
18. FIELD, J. 1990. On laziness and optimality in lambda interpreters: Tools for specification and analysis. Seventeenth Annual ACM Symposium on Principles of Programming Languages. ACM Press, pp. 1-15.
19. HANNAN, J. AND MILLER, D. 1992. From operational semantics to abstract machines. Mathematical Structures in Computer Science 2, 4, 415-459.
20. HANNAN, J. AND PFENNING, F. 1992. Compiler verification in LF. In Seventh Annual IEEE Symposium on Logic in Computer Science. IEEE Press, 407-418.
21. HENDERSON, P. AND MORRIS, J. H. 1976. A lazy evaluator. Third Annual ACM Symposium on Principles of Programming Languages. ACM Press, pp. 95-103.
22. HUET, G. 1975. A unification algorithm for typed λ-calculus. Theoretical Computer Science 1, 27-57.
23. KAMAREDDINE, F. AND RÍOS, A. 1997. Extending the λ-calculus with explicit substitution which preserves strong normalization into a confluent calculus on open terms. Journal of Functional Programming 7, 4, 395-420.
24. KWON, K., NADATHUR, G. AND WILSON, D. S. 1994. Implementing polymorphic typing in a logic programming language. Computer Languages 20, 1, 25-42.
25. LIANG, C. AND NADATHUR, G. 2002. Tradeoffs in the intensional representation of lambda terms. In: Conference on Rewriting Techniques and Applications, S. Tison, Ed., LNCS 2378, Springer-Verlag, pp. 192-206.
26. LIANG, C., NADATHUR, G. AND QI, X. 2003. Choices in representation and reduction strategies for lambda terms in intensional contexts. Technical report 2003/2, Digital Technology Center, University of Minnesota. October.
27. MARTELLI, A. AND MONTANARI, U. 1982. An efficient unification algorithm. ACM Transactions on Programming Lanuages and Systems 4, 2 (April), 258-282.
28. MICHAYLOV, S. AND PFENNING, F. 1992. An empirical study of the runtime behavior of higher-order logic programs. Conference Record of the Workshop on the λProlog Programming Language. (Available as Technical report MS-CIS-92-86 from Department of Computer and Information Sciences, University of Pennsylvania.)
29. MILLER, D. 1991. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation 1, 4, 497-536.
30. MILLER, D. AND NADATHUR, G. 1987. A logic programming approach to manipulating formulas and programs. In: IEEE Symposium on Logic Programming, S. Haridi, Ed. IEEE Press, pp. 379-388.
31. MILLER, D. AND NADATHUR, G. 1988. λProlog version 2.7. Distributed in C-Prolog and Quintus Prolog source code.
32. MILLER, D., NADATHUR, G., PFENNING, F. AND SCEDROV, A. 1991. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic 51, 125-157.
33. NADATHUR, G. 1998. An explicit substitution notation in a λProlog implementation. Technical report TR-98-01, Department of Computer Science, University of Chicago. January.
34. NADATHUR, G. 1999. A fine-grained notation for lambda terms and its use in intensional operations. Journal of Functional and Logic Programming 1999, 2 (March), 1-62.
35. NADATHUR, G. AND JAYARAMAN, B. 1989. Towards a WAM model for λProlog. In: Proceedings of the North American Conference on Logic Programming, E. Lusk and R. Overbeek, Eds. MIT Press, pp. 1180-1198.
36. NADATHUR, G., JAYARAMAN, B. AND KWON, K. 1995. Scoping constructs in logic programming: Implementation problems and their solution. Journal of Logic Programming 25, 2 (November), 119-161.
37. NADATHUR, G. AND MILLER, D. 1988. An overview of λProlog. In: Fifth International Logic Programming Conference, K. A. Bowen and R. A. Kowalski, Eds. MIT Press, pp. 810-827.
38. NADATHUR, G. AND MILLER, D. 1990. Higher-order Horn clauses. Journal of the ACM 37, 4 (October), 777-814.
39. NADATHUR, G. AND MILLER, D. 1998. Higher-order logic programming. In: Handbook of Logic in Artificial Intelligence and Logic Programming, C. H. D. Gabbay and A. Robinson, Eds. Vol. 5. Oxford University Press, pp. 499-590.
40. NADATHUR, G. AND MITCHELL, D. J. 1999. System description: Teyjus - a compiler and abstract machine based implementation of λProlog. In: Automated Deduction-CADE-16, H. Ganzinger, Ed. LNAI 1632, Springer-Verlag, pp. 287-291.
41. NADATHUR, G. AND PFENNING, F. 1992. The type system of a higher-order logic programming language. In Types in Logic Programming, F. Pfenning, Ed. MIT Press, pp. 245-283.
42. NADATHUR, G. AND QI, X. 2003. Explicit substitutions in the reduction of lambda terms. Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming. ACM Press, pp. 195-206.
43. NADATHUR, G. AND WILSON, D. S. 1998. A notation for lambda terms: A generalization of environments. Theoretical Computer Science 198, 1-2, 49-98.
44. PFENNING, F. 1988. Partial polymorphic type inference and higher-order unification. Proceedings of the ACM Lisp and Functional Programming Conference. ACM Press, pp. 153-163.
45. PFENNING, F. AND ELLIOTT, C. 1988. Higher-order abstract syntax. Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, pp. 199-208.
46. PFENNING, F. AND SCHÜRMANN, C. 1999. System description: Twelf- a meta-logical framework for deductive systems. In: Proceedings of the 16th International Conference on Automated Deduction (CADE-16), H. Ganzinger, Ed. LNAI 1632, Springer-Verlag, pp. 202-206.
47. SHAO, Z., LEAGUE, C. AND MONNIER, S. 1998. Implementing typed intermediate languages. Proceedings ACM SIGPLAN International Conference on Functional Programming (ICFP'98). ACM Press, pp. 313-323.
48. WARREN, D. H. D. 1977. Implementing Prolog - compiling predicate logic programs. University of Edinburgh, D.A.I Research Reports 39 and 40, May.
49. WARREN, D. H. D. 1983. An abstract Prolog instruction set. Technical Note 309, SRI International, October.
50. WICKLINE, P. AND MILLER, D. 1997. The Terzo 1.1b implementation of λProlog. Distribution in NJ-SML source files. See http://www.cse.psu.edu/ dale/lProlog/.