N.G. de Bruijn. Algorithmic de nition of lambda-typed lambda calculus. In G. Huet and G. Plotkin, editors, Logical Environment, pages 131-145. Cambridge University Press, 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Concurrent Logical Framework: the - Propositional Fragment Kevin (Correct)
....calculus, which bears some intriguing similarities with CLF, but is not a type theory and does not identify the logical connectives inherited from lax logic and linear logic as we do here. The method of de ning a type theory by a typed operational semantics goes back to the Automath languages [dB93] and has been applied to LF by Felty [Fel91] Our canonical formulation signi cantly extends and streamlines the ideas behind Felty s canonical LF and its extension to LLF [CP98] the need for con uence and normalization results is eliminated. 5 Conclusion In this paper, we have presented the ....
N.G. de Bruijn. Algorithmic de nition of lambda-typed lambda calculus. In G. Huet and G. Plotkin, editors, Logical Environment, pages 131-145. Cambridge University Press, 1993.
A Concurrent Logical Framework: The Propositional.. - Watkins, Cervesato.. (2003) (2 citations) (Correct)
No context found.
N.G. de Bruijn. Algorithmic de nition of lambda-typed lambda calculus. In G. Huet and G. Plotkin, editors, Logical Environment, pages 131-145. Cambridge University Press, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC