Barendregt H. P. [1992], Lambda calculi with types, in S. Abramsky, D. Gabbay and T. Maibaum, eds, `Handbook of Logic in Computer Science', Vol. 2, Oxford University Press, chapter 2, pp. 117--309. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Unknown - Logical Frameworks Frank (Correct)
No context found.
Barendregt H. P. [1992], Lambda calculi with types, in S. Abramsky, D. Gabbay and T. Maibaum, eds, `Handbook of Logic in Computer Science', Vol. 2, Oxford University Press, chapter 2, pp. 117--309.
On the Conservativity of Leibniz Equality - Sellink Programming Research (Correct)
No context found.
H.P. Barendregt. Lambda calculi with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 117--309. Oxford Science Publications, 1992.
Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005) (Correct)
No context found.
Barendregt, H. P.: 1992, `Lambda-Calculi with Types'. In: S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum (eds.): Background: Computational Structures, Vol. 2 of Handbook of Logic in Computer Science. Claredon Press, Oxford.
Representing the MSR Cryptoprotocol Specification Language in .. - Cervesato, al. (2004) (Correct)
No context found.
H. P. Barendregt. Lambda-calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Background: Computational Structures, volume 2 of Handbook of Logic in Computer Science. Claredon Press, Oxford, 1992.
A Calculus for Cryptographic Protocols - Lecture Notes Andrew (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, Volume II. Oxford University Press, 1992.
On the role of type decorations in the Calculus of Inductive .. - Barras, Gregoire (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In Handbook of Logic in Computer Science, volume 2. Abramsky & Gabbay & Maibaum (Eds.), Clarendon, 1992.
On Equivalence and Canonical Forms - In The Lf (1999) (Correct)
No context found.
Henk P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 2, pages 117--309. Oxford University Press, 1992.
On Equivalence and Canonical Forms - In The Lf (Correct)
No context found.
Henk P. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, chapter 2, pages 117--309. Oxford University Press, 1992.
On Equivalence and Canonical Forms - In The Lf (Correct)
No context found.
Barendregt, H. P. 1992. Lambda calculi with types. In Handbook of Logic in Computer Science, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Vol. 2. Oxford University Press, Chapter 2, 117--309.
Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001) (2 citations) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004) (2 citations) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2003) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Rewriting modulo in Deduction modulo - Blanqui (2003) (1 citation) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Type Theory and Rewriting - BLANQUI (2001) (1 citation) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2005) (Correct)
No context found.
Barendregt, H.: Lambda Calculi with types, in: Handbook of logic in computer science (S. Abramski, D. Gabbay, T. Maibaum, Eds.), vol. 2, Oxford University Press, 1992.
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (2 citations) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004) (2 citations) (Correct)
No context found.
H. Barendregt. Lambda calculi with types. In S. Abramski, D. Gabbay, and T. Maibaum, editors, Handbook of logic in computer science, volume 2. Oxford University Press, 1992.
Reducibility: a ubiquitous method in lambda calculus with.. - Ghilezan, al. (2002) (Correct)
No context found.
Barendregt, H. P., Lambda calculi with types, in: S. Abramsky, D. Gabbay and T. Maibaum, editors, Handbook of Logic in Computer Science, Volume B, Oxford University Press, Oxford, 1992 pp. 117--309.
Intersection Types, λ-models, and Böhm Trees - Dezani-Ciancaglini.. (Correct)
No context found.
H.P. Barendregt, "The Lambda CalculI with Types", Handbook of Logic in Computer Science 2, Oxford Univ.Press, Oxford, 1992, 117-309.
Tagless Staged Interpreters for Typed Languages - Pasalic, Taha, Sheard (2002) (3 citations) (Correct)
No context found.
Henk P. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science. Oxford University Press, Oxford, 1991.
Generating Heap-bounded Programs in a - Functional Setting Walid (Correct)
No context found.
Barendregt, H. P. Lambda calculi with types. In Handbook of Logic in Computer Science, S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds. Oxford University Press, Oxford, 1991.
Generating Heap-bounded Programs in a - Functional Setting Walid (2003) (Correct)
No context found.
Barendregt, H. P. Lambda calculi with types. In Handbook of Logic in Computer Science, S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds. Oxford University Press, Oxford, 1991.
A Generic Normalisation Proof for Pure Type Systems.. - Paulm Dcs Ed (Correct)
No context found.
H. Barendregt. Lambda Calculi with Types. In Handbook of Logic in Computer Science, Vol II, Elsevier, 1992
First 50 documents Next 50
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