| [1] | Andrew W. Appel and Amy P. Felty. Lightweight lemmas in lambda prolog. In 16th International Conference on Logic Programming, pages 411-425. MIT Press, November 1999. [ bib ] |
| [2] | P. Brisset and O. Ridoux. The compilation of λProlog and its execution with MALI. Publication Interne 687, IRISA, 1992. [ bib ] |
| [3] | Pascal Brisset and Olivier Ridoux. The architecture of an implementation of λProlog: Prolog/Mali. In Dale Miller, editor, Proceedings of the 1992 λProlog Workshop, 1992. [ bib ] |
| [4] | Conal Elliott and Frank Pfenning. eLP, a Common Lisp Implementation of λProlog. Implemented as part of the CMU ERGO project, May 1989. [ bib ] |
| [5] | Amy Felty. Defining object-level parsers in λprolog. In Proceedings of the Workshop on the λProlog Programming Language, 1992. Department of Computer and Information Science, University of Pennsylvania, Technical Report MS-CIS-92-86. [ bib ] |
| [6] | Amy Felty. Higher-order conditional rewriting in the Lλ logic programming language. In E. Lamma and P. Mello, editors, 3rd Workshop on Extensions to Logic Programming, number 660 in LNCS. Springer, 1992. [ bib ] |
| [7] | Amy Felty. Encoding the calculus of constructions in a higher-order logic. In M. Vardi, editor, Eighth Annual Symposium on Logic in Computer Science, pages 233-244. IEEE, June 1993. [ bib ] |
| [8] | Amy Felty. Implementing tactics and tacticals in a higher-order logic programming language. Journal of Automated Reasoning, 11(1):43-81, August 1993. [ bib ] |
| [9] | Keehang Kwon. Towards a Verified Abstract Machine for a Logic Programming Language with a Notion of Scope. PhD thesis, Duke University, 1994. Available as Technical Report CS-1994-36, Department of Computer Science, Duke University. [ bib ] |
| [10] | Keehang Kwon. A structured presentation of a closure-based compilation method for a scoping notion in logic programming. Journal of Universal Computer Science, 3:4, 1997. [ bib ] |
| [11] | Keehang Kwon, Gopalan Nadathur, and Debra Sue Wilson. Implementing a notion of modules in the logic programming language λProlog. In Dale Miller, editor, Proceedings of the 1992 λProlog Workshop, 1992. [ bib ] |
| [12] | Keehang Kwon, Gopalan Nadathur, and Debra Sue Wilson. Implementing a notion of modules in the logic programming language λProlog. In Evelina Lamma and Paola Mello, editors, 4th Workshop on Extensions to Logic Programming, volume 660 of LNAI, pages 359-393. Springer-Verlag, 1993. [ bib ] |
| [13] | Keehang Kwon, Gopalan Nadathur, and Debra Sue Wilson. Implementing polymorphic typing in a logic programming language. Computer Languages, 20(1):25-42, 1994. [ bib ] |
| [14] | Alexei Lisitsa. λleanTAP: Lean deduction in λProlog. Technical Report ULCS-03-017, University of Liverpool, Department of Computer Science, 2003. [ bib | .ps ] |
| [15] | Frédéric Malésieux, Olivier Ridoux, and Patrice Boizumault. Abstract compilation of λProlog. In Joxan Jaffar, editor, Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, pages 130-144, 1998. [ bib ] |
| [16] | Spiro Michaylov and Frank Pfenning. An empirical study of the runtime behavior of higher-order logic programs. In Conference Record of the Workshop on the λProlog Programming Language, Philadelphia, July 1992. [ bib ] |
| [17] | Dale Miller. Hereditary harrop formulas and logic programming. In Proceedings of the VIII International Congress of Logic, Methodology, and Philosophy of Science, pages 153-156, Moscow, August 1987. [ bib ] |
| [18] | Dale Miller. Abstract syntax and logic programming. In Logic Programming: Proceedings of the First and Second Russian Conferences on Logic Programming, number 592 in LNAI, pages 322-337. Springer-Verlag, 1992. [ bib ] |
| [19] | Dale Miller, editor. Proceedings of the 1992 λProlog Workshop, 1992. Available electronically from ftp.cis.upenn.edu in pub/meetings/?? and as UPenn CIS Department technical report MS-CIS-92-??. [ bib ] |
| [20] | Dale Miller. A proposal for modules in λProlog. In R. Dyckhoff, editor, 4th Workshop on Extensions to Logic Programming, number 798 in LNCS, pages 206-221. Springer-Verlag, 1994. [ bib ] |
| [21] | Dale Miller and Gopalan Nadathur. A computational logic approach to syntax and semantics. Presented at the Tenth Symposium of the Mathematical Foundations of Computer Science, IBM Japan, May 1985. [ bib ] |
| [22] | Dale Miller and Gopalan Nadathur. Higher-order logic programming. In Ehud Shapiro, editor, Proceedings of the Third International Logic Programming Conference, pages 448-462, London, June 1986. [ bib ] |
| [23] | Dale Miller and Gopalan Nadathur. Some uses of higher-order logic in computational linguistics. In Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, pages 247-255. Association for Computational Linguistics, Morristown, New Jersey, 1986. [ bib ] |
| [24] | Dale Miller and Gopalan Nadathur. λProlog Version 2.6. Distribution in C-Prolog sources, August 1987. [ bib ] |
| [25] | Dale Miller and Gopalan Nadathur. A logic programming approach to manipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, pages 379-388, San Francisco, September 1987. [ bib | .pdf ] |
| [26] | Dale Miller and Gopalan Nadathur. λProlog Version 2.7. Distribution in C-Prolog and Quintus sources, July 1988. [ bib | http ] |
| [27] | Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125-157, 1991. [ bib ] |
| [28] | Dale Miller, Gopalan Nadathur, and Andre Scedrov. Hereditary Harrop formulas and uniform proof systems. In David Gries, editor, Symposium on Logic in Computer Science, pages 98-105, Ithaca, NY, June 1987. [ bib ] |
| [29] | Gopalan Nadathur. A proof procedure for the logic of hereditary harrop formulas. Journal of Automated Reasoning, 11(1):115-145, August 1993. [ bib ] |
| [30] | Gopalan Nadathur. A fine-grained notation for lambda terms and its use in intensional operations. Journal of Functional and Logic Programming, 1999(2), March 1999. [ bib ] |
| [31] | Gopalan Nadathur and Bharat Jayaraman. Towards a WAM model for λProlog. In Ewing Lusk and Ross Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 1180-1198, Cleveland, Ohio, October 1989. MIT Press. [ bib ] |
| [32] | Gopalan Nadathur, Bharat Jayaraman, and Keehang Kwon. Scoping constructs in logic programming: Implementation problems and their solution. Journal of Logic Programming, 25(2):119-161, November 1995. [ bib ] |
| [33] | Gopalan Nadathur, Bharat Jayaraman, and Keehang Kwon. Scoping constructs in logic programming: Implementation problems and their solution. Journal of Logic Programming, 25(2):119-161, November 1995. [ bib ] |
| [34] | Gopalan Nadathur, Bharat Jayaraman, and Debra Sue Wilson. Implementation considerations for higher-order features in logic programming. Technical Report CS-1993-16, Department of Computer Science, Duke University, June 1993. [ bib ] |
| [35] | Gopalan Nadathur and Dale Miller. An Overview of λProlog. In Fifth International Logic Programming Conference, pages 810-827, Seattle, August 1988. MIT Press. [ bib | .pdf ] |
| [36] | Gopalan Nadathur and Dale Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777-814, October 1990. [ bib ] |
| [37] | Gopalan Nadathur and Dale Miller. Higher-order logic programming. In Dov M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, pages 499-590. Clarendon Press, Oxford, 1998. [ bib ] |
| [38] | Gopalan Nadathur and Dustin J. Mitchell. System description: Teyjus-A compiler and abstract machine based implementation of Lambda Prolog. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction, pages 287-291, Trento, Italy, July 1999. Springer-Verlag LNCS. [ bib ] |
| [39] | Gopalan Nadathur and Frank Pfenning. The type system of a higher-order logic programming language. In Frank Pfenning, editor, Types in Logic Programming, pages 245-283. MIT Press, 1992. [ bib ] |
| [40] | Gopalan Nadathur and Guanshan Tong. Realizing modularity in λProlog. Technical Report TR-97-07, Department of Computer Science, University of Chicago, August 1997. [ bib ] |
| [41] | Gopalan Nadathur and Debra Sue Wilson. A representation of lambda terms suitable for operations on their intensions. In M. Wand, editor, Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pages 341-348. ACM, ACM Press, 1990. [ bib ] |
| [42] | Gopalan Nadathur and Debra Sue Wilson. A notation for lambda terms: A generalization of environments. Theoretical Computer Science, 198(1-2):49-98, 1998. [ bib ] |
This file has been generated by bibtex2html 1.86.