Lambda Calculi with Types (1992)
Venue:  Handbook of Logic in Computer Science 
Citations:  518  4 self 
BibTeX
@INPROCEEDINGS{Barendregt92lambdacalculi,
author = {Henk Barendregt and S. Abramsky and D. M. Gabbay and T. S. E. Maibaum and H. P. Barendregt},
title = {Lambda Calculi with Types},
booktitle = {Handbook of Logic in Computer Science},
year = {1992},
pages = {117309},
publisher = {Oxford University Press}
}
Years of Citing Articles
OpenURL
Abstract

Citations
216 
A filter lambda model and the completeness of type assignment. J.Symbolic Logic, 48:931940
 Barendregt, Coppo, et al.
 1983
(Show Context)
Citation Context ...of intersection types is sometimes called the Torino system, since the initial work on this system was done in that city, for example by Coppo, Dezani and Venneri [1981], Barendregt, Coppo and Dezani ==[1983]=, Coppo, Dezani, Honsell and Longo [1984], Dezani and Margaria [1987] and Coppo, Dezani and Zacchi [1987]. See also Hindley [1982]. The system makes it possible to state that a variable x has two type... 
74  an Eternal Golden Braid  Hofstadter  1979 
42  Type inference with recursive types: Syntax and semantics  Cardone, Coppo  1991 
26 
The simple semantics for CoppoDezaniSallĂ© types
 Hindley
 1982
(Show Context)
Citation Context ...of intersection types is sometimes called the Torino system, since the initial work on this system was done in that city, for example by Coppo, Dezani and Venneri [1981], Barendregt, Coppo and Dezani ==[1983]=, Coppo, Dezani, Honsell and Longo [1984], Dezani and Margaria [1987] and Coppo, Dezani and Zacchi [1987]. See also Hindley [1982]. The system makes it possible to state that a variable x has two type... 
22  essays on combinatory logic, lambda calculus and formalism  Curry  1980 
15  Modified basic functionality in combinatory logic  Curry  1969 
5  A completeness theorem for recursively defined 'types  Coppo  1985 
4  antinomies de Russell et de BuraliForti et le probleme fondamental de la theorie des ensembles, L' Enseignement Mathematique 19, 37{52  Les 
3  Interpretation foctionelle et elimination des coupures dans l'arithmetique d'ordre superieur  Girard, Lafont, et al. 
3  mock a mockingbird  To 
3  Lambda Terms and Proof Theory  Combinators  1972 
2  Typing in pure type systems  Berardi 
2  A survey of the AUTOMATH project, in: Hindley and Seldin  Cardelli, Wegner  1980 
2  paradox with the Type : Type axiom, in: The calculus of constructions, Documentation and users's guide, version 4.10  Reynolds 
2  A modular proof of strong normalisation for the calculus of constructions  Giannini, S 
2  types, Tracts in Theoretical Computer Science 7  Proofs 
2  The formulaeastypes notion of construction, in: Hindley and Seldin  Howard, Kreisel, et al.  1980 
2 
unpublished notes
 Report
(Show Context)
Citation Context ...7) it is proved that all terms typable in ! are normalizing. This proof uses the so called method of `computable terms' and was already presented in the unpublished `Stanford Report' by Howard et al. ==[1963]=. In fact, using Tait's method one can also prove strong normalization and applies to other systems as well, in particular to Godel's T ; see Troelstra [1973]. 62 H.P. Barendregt Girard (1972) gave an... 
2  models with polymorphic types, to appear in Theoretical  Filter 
2  Combinatory reduction systems  Krivine 
2  An extended calculus of constructions  MacQueen, Plotkin, et al. 
2 
Introduction to mathematical logic, third edition
 Mendler
(Show Context)
Citation Context ...e initial work on this system was done in that city, for example by Coppo, Dezani and Venneri [1981], Barendregt, Coppo and Dezani [1983], Coppo, Dezani, Honsell and Longo [1984], Dezani and Margaria ==[1987]= and Coppo, Dezani and Zacchi [1987]. See also Hindley [1982]. The system makes it possible to state that a variable x has two types oe andsat the same time. This kind of polymorphism is to be contras... 
2 
Strong normalization in a typed lambda calculus with lambda structured types
 Nerode, P
(Show Context)
Citation Context ...lished `Stanford Report' by Howard et al. [1963]. In fact, using Tait's method one can also prove strong normalization and applies to other systems as well, in particular to Godel's T ; see Troelstra ==[1973]=. 62 H.P. Barendregt Girard (1972) gave an `impredicative twist' to Tait's method in order to show normalization for terms typable in (the Church version of) 2 and in the system ! to be discussed in S... 
2  Natural deduction: a prooftheoretical study, Almqvist and  Quine 
2  Strictness analysis via abstract interpretation for recursively defined types  Reynolds 
2  die Bausteinen der mathematische Logik  Uber 
2  strong sumelimination in intuitionistic type theory  Weak 
2  pragmatics of lambda calculus  Semantics 
2 
A simple algorithm and proof for type inference, Fund
 Whitehead, N, et al.
(Show Context)
Citation Context ...e initial work on this system was done in that city, for example by Coppo, Dezani and Venneri [1981], Barendregt, Coppo and Dezani [1983], Coppo, Dezani, Honsell and Longo [1984], Dezani and Margaria ==[1987]= and Coppo, Dezani and Zacchi [1987]. See also Hindley [1982]. The system makes it possible to state that a variable x has two types oe andsat the same time. This kind of polymorphism is to be contras... 
1 
Polymorphic types, fixedpoint combinators and continuous lambda models
 Wirsing, NorthHolland
(Show Context)
Citation Context ...e initial work on this system was done in that city, for example by Coppo, Dezani and Venneri [1981], Barendregt, Coppo and Dezani [1983], Coppo, Dezani, Honsell and Longo [1984], Dezani and Margaria ==[1987]= and Coppo, Dezani and Zacchi [1987]. See also Hindley [1982]. The system makes it possible to state that a variable x has two types oe andsat the same time. This kind of polymorphism is to be contras... 
1  Embedding first order predicate logic in fragments of intuitionistic logic  Longo, E 