Explicit Substitutions in the Reduction of Lambda Terms

Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming

Volumn 5, Issue , 2003, Pages 195-206

  Nadathur, Gopalan ^a   Qi, Xiaochu ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Beta reduction; Explicit substitution; Graph and environment based reduction procedures; Higher order abstract syntax; Lambda calculus; Metalanguages; Suspension notation

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA REDUCTION; LOGIC PROGRAMMING;

BETA REDUCTION; EXPLICIT SUBSTITUTION; GRAPH AND ENVIRONMENT BASED REDUCTION PROCEDURES; HIGHER ORDER ABSTRACT SYNTAX; LAMBDA CALCULUS; METALANGUAGES; SUSPENSION NOTATION;

COMPUTER PROGRAMMING LANGUAGES;

EID: 1242332694     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/888251.888270     Document Type: Conference Paper

References (22)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy, Explicit substitutions. Journal of Functional Programming, 1(4):375-416, 1991.
2. L. Aiello and G. Prini. An efficient interpreter for the lambda-calculus. The Journal of Computer and System Sciences, 23:383-425, 1981.
3. N. Bruijn. 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, 1972.
4. N. Bruijn. A survey of the project AUTOMATH. In J. P. Seldin and J. R. Hindley, editors, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 579-606. Academic Press, 1980.
5. R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, 1986.
6. T. Coquand and G. Huet. The calculus of constructions. Information and Computation, 76(2/3):95-120, February/March 1988.
7. G. Dowek, A. Felty, H. Herbelin, G. Huet, C. Murthy, C. Parent, C. Paulin-Mohring, and B. Werner. The Coq proof assistant user's guide. Rapport Techniques 154, INRIA, Rocquencourt, France, 1993. Version 5.8.
8. G. Dowek, T. Hardin, and C. Kirchner. Higher-order unification via explicit substitutions. Information and Computation, 157:183-235, 2000.
9. B. Grégoire and X. Leroy. A compiled implementation of strong reduction. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, pages 235-246, Pittsburgh, October 2002.
10. R. Harper. Introduction to Standard ML. Technical Report ECS-LFCS-86-14, Laboratory for Foundations of Computer Science, University of Edinburgh, November 1986. Revised by Nick Rothwell, January 1989, with exercises by Kevin Mitchell.
11. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, 1993.
12. F. Kamareddine and A. Ríos. 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, 1997.
13. C. Liang. Compiler construction in higher order logic programming. In 4th International Symposium on Practical Aspects of Declarative Languages, pages 47-63. Springer Verlag LNCS No. 2257, 2002.
14. C. Liang and G. Nadathur. Tradeoffs in the intensional representation of lambda terms. In S. Tison, editor, Conference on Rewriting Techniques and Applications, volume 2378 of Lecture Notes in Computer Science, pages 192-206. Springer-Verlag, July 2002.
15. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 1(4):497-536, 1991.
16. G. Nadathur. A fine-grained notation for lambda terms and its use in intensional operations. Journal of Functional and Logic Programming, 1999(2), 1999.
17. G. Nadathur and D. Miller. An overview of λProlog. In K. A. Bowen and R. A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810-827. MIT Press, August 1988.
18. G. Nadathur and D. J. Mitchell. System description: Teyjus - a compiler and abstract machine based implementation of λProlog. In H. Ganzinger, editor, Automated Deduction-CADE-16, number 1632 in Lecture Notes in Artificial Intelligence, pages 287-291. Springer-Verlag, July 1999.
19. G. Nadathur and D. S. Wilson. A notation for lambda terms: A generalization of environments. Theoretical Computer Science, 198(1-2):49-98, 1998.
20. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer Verlag, 1994.
21. F. Pfenning. Elf: A meta-language for deductive Systems. In A. Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, pages 811-815, Nancy, France, June 1994. Springer-Verlag LNAI 814. System abstract.
22. Z. Shao, C. League, and S. Monnier. Implementing typed intermediate languages. In Proc. 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 313-323. ACM Press, September 1998.