Introduction to Type Theory

Introduction to Type Theory

Cached

Download Links

by Herman Geuvers

BibTeX

@MISC{Geuvers_introductionto,
    author = {Herman Geuvers},
    title = {Introduction to Type Theory},
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

996	The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984
729	A formulation of the simple theory of types - Church - 1940
634	A framework for defining logics - Harper, Honsell, et al. - 1993
578	Types and Programming Languages - Pierce - 2002
395	The formulae-as-types notion of constructions - HOWARD - 1980
379	Introduction to higher order categorical logic - Lambek, Scott - 1986
340	Interactive theorem proving and program development. Coq’Art: The calculus of inductive constructions - Bertot, Castéran - 2004
322	Principal type-schemes for functional programs - Damas, Milner - 1982
301	Intuitionistic Type Theory - Martin-Löf - 1984
242	Programming in Martin-Löf’s Type Theory. An Introduction - Nordström, Petersson, et al. - 1990
195	Une extension de l'interpr'etation de Godel `a l'analyse, et son application `a l"elimination des coupures dans l'analyse et la th'eorie des types - Girard - 1971
188	Intensional interpretation of functionals of finite type i - Tait - 1967
148	Call-by-name, call-by-value, and the lambda calculus - Plotkin - 1975
129	The system F of variable types, fifteen years later - Girard - 1986
129	The principal type-scheme of an object in combinatory logic - Hindley - 1969
123	Intuitionistic type theory. Bibliopolis - Martin-Löf - 1984
87	A Theory of Type Polymorphism - Milner - 1978
86	Polymorphic Type Schemes and Recursive Definitions - Mycroft - 1984
67	Introduction to Combinators and Lambda-Calculus - Hindley - 1986
57	Lambda Calculi with Types, Handbook of Logic in - Barendregt - 1992
45	Polymorphism is not set-theoretic - Reynolds - 1984
44	Functorial polymorphism - Bainbridge, Freyd, et al. - 1990
40	Automatic synthesis of typed Λ-programs on term algebras - Böhm, Berarducci - 1985
34	Symbolic logic: an introduction - Fitch - 1952
28	Short proofs of normalization for the simplytyped lambda-calculus, permutative conversions and Gödel’s T - Joachimski, Matthes - 2003
20	Typability and type-checking in the second-order λ-calculus are equivalent and undecidable - Wells - 1994
14	Proofs and Types, Cambridge Tracts in Theoretical Computer Science 7 - Girard, Lafont, et al. - 1989
10	Definierbare Funktionen im λ-Kalkül mit Typen, Archiv für Mathematische Logik und Grundlagenforschung 17 - Schwichtenberg - 1976
9	The undecidability of typability in the lambda-pi-calculus - Dowek - 1993
7	An early proof of normalization by A.M. Turing - Gandy - 1980
6	Some logical and syntactical observations concerning the first-order dependent type system λP - Geuvers, Barendsen - 1999
5	Comparing Cubes of Typed and Type Assignment Systems - Bakel, Liquori, et al. - 1997
5	Geuvers and R. de Vrijer (eds - Nederpelt, H - 1994
5	Lectures on the CurryHoward Isomorphism, volume 149 - Sørensen, Urzyczyn - 2006
3	Proof Assistants using Dependent Type Systems, Chapter 18 of the Handbook of Automated Reasoning - Barendregt, Geuvers - 2001
3	Interactive Theorem Proving and - BERTOT, CASTÉRAN
2	A simple proof of the undecidability of inhabitation in λP - Bezem, Springintveld - 1996
2	LCF considered as a programming language, Theor - Plotkin - 1977
1	A simple algorithm and proof for type inference,Fundamenta Informaticae X - Wand - 1987
1	Collections, sets and types - Dowek - 1999
1	Short proofs of normalization for the simply- typed lambda-calculus, permutative conversions and Gödel’s - Joachimski, Matthes - 2003