A notation for lambda terms a generalization of environments

Theoretical Computer Science

Volumn 198, Issue 1-2, 1998, Pages 49-98

  Nadathur, Gopalan ^a   Wilson, Debra Sue ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b IBM   (United States)

Author keywords

Confluence and noetherianity properties; Explicit substitution notations; Lambda calculus; Lambda terms as representation devices

Indexed keywords

EID: 0012619968     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00184-9     Document Type: Article

References (40)

1. M. Abadi, L. Cardelli, P.-L. Curien, J.-J. Lévy, Explicit substitutions, J. Funct. Programming 1 (4) (1991) 375-416.
2. L. Aiello, G. Prini, An efficient interpreter for the lambda-calculus, J. Comput. System Sci. 23 (1981) 383-425.
3. N. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem, Indag. Math. 34 (5) (1972) 381-392.
4. N. de Bruijn, Lambda-calculus notation with namefrce formulas involving symbols that represent reference transforming mappings, Indag. Math. 40 (1978) 348-356.
5. N. de Bruijn, A survey of the project AUTOMATH, in: J.P. Seldin, J.R. Hindley (Eds.), To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press, New York, 1980, pp. 579-606.
6. A. Church, A formulation of the simple theory of types, J. Symbolic Logic 5 (1940) 56-68.
7. 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, S.F. Smith, Implementing Mathematics with the Nuprl Proof Development System, Prentice-Hall, Englewood Cliffs, NJ, 1986.
8. T. Coquand, G. Huet, The calculus of constructions, Inform. Comput. 76 (2/3) (1988) 95-120.
9. G. Cousineau, P.-L. Curien, M. Mauny, The categorical abstract machine, Sci. Programming 8 (2) (1987) 173-202.
10. P.-L. Curien, Categorical combinators, Inform. and Control 69 (1986) 188-254.
11. P.-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman, London, 1986.
12. N. Dershowitz, Orderings for term-rewriting systems, Theoret. Comput. Sci. 17 (3) (1982) 279-301.
13. J. Field, On laziness and optimality in lambda interpreters: tools for specification and analysis, in: Proc. 17th Ann. ACM Symp. on Principles of Programming Languages. ACM Press, New York, January 1990, pp. 1-15.
14. 0? A survey of some results in proof theory, Ann. Pure Appl. Logic 53 (1991) 199-260.
15. M.J. Gordon, A.J. Milner, C.P. Wadsworth, Edinburgh LCF: A Mechanised Logic of Computation, Lecture Notes in Computer Science, vol. 78, Springer, Berlin, 1979.
16. P.R. Halmos, Naive Set Theory. D. Van Nostrand, New York, 1960.
17. T. Hardin, Confluence results for the pure strong categorical logic CCL. λ-calculi as subsystems of CCL, Theoret. Comput. Sci. 65 (1989) 291-342.
18. R. Harper, F. Honsell, G. Plotkin, A framework for defining logics, J. ACM 40 (1) (1993) 143-184.
19. J.R. Hindley, J.P. Seldin, Introduction to Combinatory Logic and Lambda Calculus, Cambridge Univ. Press, Cambdrige, 1986.
20. G. Huet, A unification algorithm for typed λ-calculus, Theoret. Comput. Sci. 1 (1975) 27-57.
21. G. Huet, Confluent reductions: abstract properties and applications to term rewriting systems, J. ACM 27 (4) (1980) 797-821.
22. G. Huet, Formal structures for computation and deduction, unpublished course notes, Carnegie Mellon University, 1986.
23. G. Huet, B. Lang, Proving and applying program transformations expressed with second-order patterns, Acta Inform. 11 (1978) 31-55.
24. J.W. Klop, Combinatory Reduction Systems, volume 127 of Mathematical Centre Tracts, Mathematical Centre, 413 Kruislaan, Amsterdam, 1980.
25. D.E. Knuth, P.B. Bendix, Simple word problems in universal algebras, in: J. Leech (Ed.), Computational Problems in Abstract Algebra, Pergamon Press, Oxford, 1970, pp. 263-297.
26. J.B. Kruskal, Well-quasi-ordering, the tree theorem and Vázsonyi's conjecture, Trans. Amer. Math. Soc. 95 (1960) 210-225.
27. A. Levy, Basic Set Theory, Springer, Berlin, 1979.
28. D. Miller, G. Nadathur, A logic programming approach to manipulating formulas and programs, in: S. Haridi (Ed.), IEEE Symp. on Logic Programming, San Francisco, September 1987, pp. 379-388.
29. G. Nadathur, A fine-grained notation for lambda terms and its use in intensional operations, Tech. Report TR-96-13, Department of Computer Science, University of Chicago, May 1996; J. Funct. Logic Programming, to appear.
30. G. Nadathur, A fine-grained notation for lambda terms and its use in intensional operations, Tech. Report TR-96-13, Department of Computer Science, University of Chicago, May 1996; J. Funct. Logic Programming, to appear.
31. G. Nadathur, B. Jayaraman, D.S. Wilson, Implementation considerations for higher-order features in logic programming, Tech. Report CS-1993-16, Department of Computer Science, Duke University, June 1993.
32. G. Nadathur, D. Miller, An overview of λProlog, in: K.A. Bowen, R.A. Kowalski (Eds.), Proc. 5th Internat. Logic Programming Conf., Seattle, Washington, MIT Press, Cambridge, MA, 1988, pp. 810-827.
33. G. Nadathur, D.S. Wilson, A representation of lambda terms suitable for operations on their intensions, in: Proc. 1990 ACM Conf. on Lisp and Functional Programming, ACM Press, New York, 1990, pp. 341-348.
34. M.J. O'Donnell, R.I. Strandh, Towards a fully parallel implementation of the lambda calculus, Tech. Report JHU/EECS-84/13, Johns Hopkins University, 1984.
35. L.C. Paulson, The representation of logics in higher-order logic, Tech. Report No. 113. Computer Laboratory, University of Cambridge, August 1987.
36. L.C. Paulson, The foundations of a generic theorem prover, Tech. Report Number 130, Computer Laboratory, University of Cambridge, March 1988.
37. F. Pfenning, Elf: a language for logic definition and verified metaprogramming, in: Proc 4th Ann. Symp. on Logic in Computer Science, IEEE Computer Society Press, Pacific Grove, CA, 1989, pp. 313-322.
38. F. Pfenning, C. Elliott, Higher-order abstract syntax, in: Proc. ACM-SIGPLAN Conf. on Programming Language Design and Implementation. ACM Press, New York, 1988, pp. 199-208.
39. J. Staples, A new technique for analysing parameter passing, applied to the lambda calculus, Australian Comput. Sci. Comm. 3 (1) (1981) 201-210.
40. H. Yokouchi, Church-Rosser Theorem for a rewriting system on categorical combinators, Theoret. Comput. Sci. 65 (1989) 271-290.