Abstract syntax for variable binders: An overview

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 239-253

  Miller, Dale ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT SYNTAX; ALPHA-CONVERSION; BOUND VARIABLES; COMPUTATIONAL SYSTEM; COMPUTING SYSTEM; FIRST-ORDER; HIGHER-ORDER ABSTRACT SYNTAX; LABELED TREES; STATIC ANALYZERS; THEOREM PROVERS;

BINDERS; FORESTRY; LOGIC PROGRAMMING; PROGRAM COMPILERS; PROGRAM INTERPRETERS;

SYNTACTICS;

EID: 84867771131     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_16     Document Type: Conference Paper

References (39)

1. Martin Abadi, Luca Cardelli, Pierre-Louis Curien, and Jean-Jacques L-evy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, October 1991.
2. N. De Bruijn Lambda calculus notation with nameless dummies, a tool for automat ic formula manipulation, with application to the Church-Rosser Theorem Indag. Math. 34, 5, 381-392, 1972.
3. Alonzo Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
4. Joelle Despeyroux, Amy Felty, and Andre Hirschowitz. Higher-order abstract syntax in Coq. In Second International Conference on Typed Lambda Calculi and Applications, pages 124-138, April 1995.
5. Joelle Despeyroux and Andre Hirschowitz. Higher-order abstract syntax with induction in Coq. In Fifth International Conference on Logic Programming and Automated Reasoning, pages 159-173, June 1994.
6. Joelle Despeyroux, Frank Pfenning, and Carsten Schürmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications, April 1997.
7. G. Dowek, T. Hardin, and C. Kirchner. Higher-order uni-cation via explicit substitutions. In D. Kozen, editor, Logic in Computer Science, pages 366-374, 1995.
8. M. P. Fiore, G. D. Plotkin, and D. Turi. Abstract syntax and variable binding. In Logic in Computer Science, pages 193-202. IEEE Computer Society Press, 1999.
9. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax involving binders. In Logic in Computer Science, pages 214-224. IEEE Computer Society Press, 1999.
10. Robert Harper, Furio Honsell, and Gordon Plotk in. A framework for de-ning logics. Journal of the ACM, 40(1):143-184, 1993.
11. M. Hofmann. Semantical analysis of higher-order abstract syntax. In Logic in Computer Science, pages 204-213. IEEE Computer Society Press, 1999.
12. G-erard Huet. A uni-cation algorithm for typed calculus. Theoretical Computer Science, 1:27-57, 1975.
13. G-erard Huet and Bernard Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31-55, 1978.
14. Dale Miller. An extension to ML to handle bound variables in d ata structures: Preliminary report. In Informal Proceedings of the Logical Frameworks BRA Work-shop, June 1990. Available as UPenn CIS technical report MS-CIS-90-59.
15. Dale Miller. A logic programming lan guage with lambda-Abstraction, function variables, and simple uni-cation. J. of Logic and Computation, 1(4):497-536, 1991.
16. Dale Miller. Uni-cation of simply typed lambda-terms as logic programming. In Eighth International Logic Programming Conference, pages 255-269, Paris, France, June 1991. MIT Press.
17. Dale Miller. Abstract syntax and logic programming. In Logic Programming: Proceedings o f the First and Second Russian Conferences on Logic Programming, number 592 in LNAI, pages 322-337. Springer-Verlag, 1992.
18. Dale Miller. Uni-cation under a mixed pre-x. Journal of Symbolic Computation, pages 321-358, 1992.
19. Dale Miller and Gopalan Nadathur. Higher-order logic programming. In Ehud Shapiro, editor, Proceedings of the Third International Logic Programming Con-ference, pages 448-462, London, June 1986.
20. 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, 1986.
21. Dale Miller and Gopalan Nadathur. A logic programming approach to man ipulating formulas and programs. In Seif Haridi, editor, IEEE Symposium on Logic Programming, pages 379-388, San Francisco, September 1987.
22. 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.
23. Dale Miller, Catuscia Palamidessi Foundational aspects of syntax. In Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela, and Peter Wegner, editors ACM Computing Surveys Symposium on Theoretical Computer Science: A Perspective, volume 31. ACM, Sep 1999. Article n umber 10.
24. John C. Mitchell and Eugenio Moggi. Kripke-style models for typed lambda calculus. Annals of Pure and Applied Logic, 51, 1991.
25. Gopalan Nadathur. A-ne-grained notation for lambda terms and its use in intensional operations. Journal of Functional and Logic Programming, 1999(2), March 1999.
26. Gopalan Nadathur and Dale Miller. An Overview of-Prolog. In Fifth International Logic Programming Conference, pages 810-827, Seattle, Washington, August 1988. MIT Press.
27. Gopalan Nadathur and Dustin J. Mitchell. System description: Teyjus|a compiler and abstract machine bas ed implementation of-Prolog. In H. Ganzinger, editor, CADE-16, pages 287-291, Trento, Italy, July 1999. Springer LNCS.
28. Gopalan Nadathur and Debra Sue Wilson. A notation for lambda terms: A gene ralization of environments. Theoretical Computer Science, 198(1-2):49-98, 1998.
29. Tobias Nipkow. Higher-order critical pairs. In G. Kahn, editor, Sixth Annual Sym. on Logic in Computer Science, pages 342-349. IEEE, July 1991.
30. Tobias Nipkow. Functional uni-cation of higher-order patterns. In M. Vardi, editor, Eighth Annual Sym. on Logic in Computer Science, pages 64-74. IEEE, June 1993.
31. Lawrence C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5:363-397, September 1989.
32. Lawrence C. Paulson. Isab elle: The next 700 theorem provers. In Piergiorgio Odifreddi, editor, Logic and Computer Science, pages 361-386. Academic Press, 1990.
33. Frank Pfenning. Elf: A language for logic de-nition and verified metaprogramming. In Fourth Annual Symposium on Logic in Computer Science, pages 313-321, Monterey, CA, June 1989.
34. Frank Pfenning. Uni-cation and anti-uni-cation in the Calculus of Constructions. In G. Kahn, editor, Sixth Annual Symposium on Logic in Computer Science, pages 74-85. IEEE, July 1991.
35. Frank Pfenning. The practice of logical frameworks. In H-el-ene Kirchner, editor, Proceedings of the Colloquium on Trees in Algebra and Programming, volume LNCS 1059, pages 119-134. Springer-Verlag, 1996.
36. Frank Pfenning and Conal Elliot. Higher-order abstract syntax. In Proceedings of the ACM-SIGPLAN Conference on Programming Language Design and Imple-mentation, pages 199-208. ACM Press, June 1988.
37. Andrew M. Pitts and Murdoch J. Gabbay. A meta language for programming with bound names modulo renaming (preliminary report). Draft January 2000.
38. Zhenyu Qian. Uni-cation of higher-order patterns in linear time and space. J. Logic and Computation, 6(3):315-341, 1996.
39. Richard Statman. The typed-calculus is not elementary recursive. Theoretical Computer Science, 9:73-81, 1979.