The conservation theorem revisited-Reference-Cited by-同舟云学术

The conservation theorem revisited

Published: Issue: Volume: Page:163-178
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Groote Philippe

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0037105.pdf

Reference19 articles.

1. H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984.

2. H.P. Barendregt. Introduction to Generalised Type Systems. Journal of Functional Programming, 1(2):125–154, 1991.

3. H.P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbai, and T. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, 1992.

4. Th. Coquand. Metamathematical investigations of a calculus of constructions. In P. Odifreddi, editor, Logic and Computer Science, pages 91–122. Academic Press, 1990.

5. N.G. de Bruijn. Lambda calculus notations with nameless dummies, a tool for automatic formula manipulation, with an application to the Church-Rosser theorem. Indigationes Mathematicae, 34:381–392, 1972.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Permutative λ-Calculus;Logic for Programming, Artificial Intelligence, and Reasoning;2012

2. On Principal Types of BCK-λ-Terms;Logic, Language, Information and Computation;2007

3. Bibliography;Lectures on the Curry-Howard Isomorphism;2006

4. Simply typed λ-calculus;Lectures on the Curry-Howard Isomorphism;2006

5. De Bruijn's syntax and reductional behaviour of λ-terms: the typed case;The Journal of Logic and Algebraic Programming;2005-02