A logic programming language with lambda-abstraction, function variables, and simple unification

Journal of Logic and Computation

Volumn 1, Issue 4, 1991, Pages 497-536

  Miller, Dale ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000968273     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/1.4.497     Document Type: Article

References (32)

1. N. de Bruijn (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.
2. A. Church (1940). A formulation of the simple theory of types, Journal of Symbolic Logic, 5, 56-68.
3. C. Elliott (1989). Higher-order unification with dependent types. Proceedings of the 1989 Rewriting Teclmiques and Applications, Springer-Verlag Lecture Notes in Computer Science, Vol. 355, 121-136.
4. C. Elliott and F. Pfenning (1991). A semi-functional implementation of a higher-order logic programming language, in P. Lee (ed.), Topics in Advanced Language Implementation, MIT Press.
5. A. Felty and D. Miller (1988). Specifying theorem provers in a higher-order logic programming, language, in E. Lusk and R. Overbeek (eds), Ninth International Conference on Automated Deduction, Argonne, IL, 23-26, Springer-Verlag Lecture Notes in Computer Science, Vol. 310, 61-80.
6. G. Gentzen (1935). Investigations into Logical Deductions. In M. E. Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland Publishing Co., Amsterdam, 1969, 68-131.
7. W. Goldfarb (1981). The undecidability of the second-order unification problem, Theoretical Computer Science, 13, 225-230.
8. J. Hannan and D. Miller (1988). Uses of Higher-Order Unification for Implementing Program Transformers. In K. Bowen and R. Kowalski (eds), Fifth International Conference and Symposium on Logic Programming, MIT Press, 942-959.
9. J. Hannan and D. Miller (1989). A meta language for functional programs. In H. Rogers and H. Abramson, Meta-Programming in Logic Programming, MIT Press, 433—476.
10. R. Harper, F. Honsell, and G. Plotkin (1987). A Framework for Defining Logics. In D. Gries (ed) Second Annual Symposium on Logic in Computer Science, Ithaca, NY, 194-204.
11. J. Hindley and J. Seldin (1986). Introduction to Combinators and k-Calculus, Cambridge, Cambridge University Press.
12. G. Huet (1975). A unification algorithm for typed A-calculus, Theoretical Computer Sciences, 1, 27-57.
13. G. Huet and B. Lang (1978). Proving and applying program transformations expressed with second-order logic, Acta lnformatica, 11, 31-55.
14. D. Miller (1989). A logical analysis of modules in logic programming, Journal of Logic Programming, 6, 79-108.
15. D. Miller (1989). Lexical Scoping as Universal Quantification. In G. Levi and M. Martelli (eds), Sixth International Logic Programming Conference, Lisbon, MIT Press, Cambridge, MA, 268-283.
16. D. Miller (1990). Abstractions in logic programming. In P. Odifreddi (ed.), Logic and Computer Science, Academic Press, 329-359.
17. D. Miller (1991). A logic programming language with lambda-abstraction, function variables, and simple unification. In P. Schroeder-Heister (ed.), Extensions of Logic Programming: International Workshop, Tubingen FRG, December 1989, Lecture Notes in Artificial Intelligence 475, Springer-Verlag, 253-281.
18. D. Miller (1991). Unification of simply typed lambda-terms as logic programming. In Koichi Furukawa (ed.), Eighth International Logic Programming Conference, Paris, MIT Press.
19. D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov (1991). Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, 51, 125-157.
20. G. Nadathur and B. Jayaraman (1989). Towards a WAM model for AProlog. In Ewing Lusk and Ross Overbeek (eds), North American Conference on Logic Programming, Cleveland, Ohio, 1180-1198.
21. G. Nadathur and D. Miller (1988). An overview of AProlog. In R. Kowlaski and K. Bowen (eds), Fifth International Conference on Logic Programming, MIT Press, 810-827.
22. G. Nadathur and D. Miller (1990). Higher-order Horn clauses, Journal of the ACM, 37(4), 777-814.
23. G. Nadathur and D. Wilson (1990). A Representation of lambda terms suitable for operations on their intensions. In M. Wand (ed.), ACM Conference on Lisp and Functional Programming, ACM Press, 341-348.
24. T. Nipkow (1991). Higher-Order Critical Pairs. In G. Kahn (ed.), Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam.
25. L. Paulson (1986). Natural deduction as higher-order resolution, Journal of Logic Programming, 3, 237-258.
26. L. Paulson (1989). The foundation of a generic theorem prover, Journal of Automated Reasoning, 5, 363-397.
27. F. Pfenning (1989). Elf: A language for logic definition and verified metaprogramming. In Fourth Annual Symposium on Logic in Computer Science, Monterey, CA, 313-321.
28. F. Pfenning (1991). Unification and anti-unification in the calculus of constructions. In G. Kahn (ed.), Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam.
29. F. Pfenning and C. Elliott (1988). Higher-order abstract syntax. In ACM-SIGPLAN Conference on Programming Language Design and Implementation, ACM Press, 199-208.
30. T. Pietrzykowski and D. Jensen (1976). Mechanizing to-order type theory through unification, Theoretical Computer Science, 3, 123-171.
31. W. Snyder and J. Gallier (1989). Higher-order unification revisited: complete sets of transformations, Journal of Symbolic Computation 8, 101-140.
32. R. Statman (1979). Intuitionistic propositional logic is polynomial-space complete, Theoretical Computer Science, 9, 67-72.