Type Theory and Programming

Type Theory and Programming (1994)

Cached

Download Links

by Thierry Coquand , Bengt Nordström , Jan M. Smith , Björn von Sydow

Citations:

BibTeX

@MISC{Coquand94typetheory,
    author = {Thierry Coquand and Bengt Nordström and Jan M. Smith and Björn von Sydow},
    title = {Type Theory and Programming },
    year = {1994}
}

Bookmark

OpenURL

Abstract

Citations

1182	A structural approach to operational semantics - Plotkin - 1981
417	The calculus of constructions - Coquand, Huet - 1988
395	The formulæ-as-types notion of construction - Howard - 1980
342	Constructive Analysis - Bishop, Bridges - 1985
301	Intuitionistic Type Theory - Martin-Löf - 1984
280	Natural semantics - Kahn - 1988
242	Programming in Martin-Löf’s Type Theory. An Introduction - Nordström, Petersson, et al. - 1990
216	Report on the programming language Haskell, a non-strict, purely functional language - Hudak, Jones, et al. - 1992
209	Investigations into logical deduction - Gentzen - 1969
144	LEGO proof development system: User's manual - Luo, Pollack - 1992
123	Intuitionistic type theory. Bibliopolis - Martin-Löf - 1984
118	Elements of Intuitionism - Dummett - 1977
92	The ALF proof editor and its proof engine - Magnusson, Nordström - 1994
76	Constable et al. Implementing Mathematics with the Nuprl Proof Development System - L - 1986
69	The mathematical language AUTOMATH, its usage and some of its extensions - Bruijn - 1968
66	An introduction - Heyting - 1956
65	On the interpretation of intuitionistic number theory - Kleene - 1945
54	Real Theorem Provers Deserve Real User-Interfaces - Th'ery, Bertot, et al. - 1992
53	Proof-checking a data link protocol - Helmink, Sellink, et al. - 1994
52	Intuitionistic Formal Spaces – a First Communication - Sambin, Skordev - 1987
50	The Coq proof assistant user's guide. Version 5.8 - Dowek, Felty, et al. - 1993
49	De Bruijn. A survey of the project AUTOMATH - G - 1980
43	Extraction de Programmes dans le Calcul des Constructions - Paulin-Mohring - 1989
42	Natural Deduction. Almquist - Prawitz - 1965
41	of translation in natural semantics - Despeyroux
37	Logic and Computation - Paulson - 1987
35	A formalization of the strong normalization proof for System F - Altenkirch - 1993
29	From Semantics to Rules: A Machine Assisted Analysis - Coquand - 1993
28	The point of pointless topology - Johnstone - 1983
27	A short description of another logical framework - Augustsson, Coquand, et al. - 1990
21	A globalization of the Hahn-Banach theorem - Mulvey, Pelletier - 1991
21	Infinitely long terms of transfinite type - Tait - 1965
20	Mathematics as a numerical language - Bishop - 1970
19	Computational foundations of basic recursive function theory - Constable, Smith - 1993
16	Pattern matching with dependent types. In Proceeding from the logical framework workshop at B*astad - Coquand - 1992
16	Constructive validity - Scott - 1970
16	Programming in Martin-L"of's Type Theory. An Introduction - Nordstrom, Petersson, et al. - 1990
13	Constructive topology and combinatorics - Coquand - 1992
13	A Programming System for Type Theory - Petersson - 1982
10	Über eine bisher noch nicht benütze Erweiterung des finiten Standpunktes - Gödel - 1958
6	A model of intensional martin-lof type theory in which unicity of identity proofs does not hold - Hofmann - 1993
6	Standard ML Proposal. Polymorphism: The ML/LCF/Hope Newsletter - Milner - 1984
5	The new Implementation of ALF. In The informal proceeding from the logical framework workshop at B*astad - Magnusson - 1992
4	Ramsey’s theorem in type theory - Fridlender - 1993
2	A model of intensional martin-l"of type theory in which unicity of identity proofs does not hold - Hofmann - 1993
1	An optimization algorithm for simply typed lambdacalculus - Berardi - 1993
1	44] Giovanni Sambin. Intuitionistic Formal Spaces - A First Communication - Almquist, Wiksell - 1965