Martin-Löf’s Type Theory

Martin-Löf’s Type Theory (2000)

Cached

Download Links

by B. Nordström , K. Petersson , J. M. Smith

Citations:

BibTeX

@MISC{Nordström00martin-löf’stype,
    author = {B. Nordström and K. Petersson and J. M. Smith},
    title = { Martin-Löf’s Type Theory },
    year = {2000}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1497	The Definition of Standard ML - Milner, Tofte, et al. - 1997
728	A formulation of the simple theory of types - Church - 1940
634	A framework for defining logics - Harper, Honsell, et al. - 1999
417	The calculus of constructions - Coquand, Huet - 1988
395	The formulae-as-types notion of construction - Howard - 1980
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
235	Constructive mathematics and computer programming - Martin-Lof - 1982
216	Report on the programming language Haskell, a non-strict, purely functional language - Hudak, Jones, et al. - 1992
144	LEGO proof development system: User's manual - Luo, Pollack - 1992
99	Inductively defined types - Coquand, Paulin - 1988
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
63	et al. Report on the programming language Haskell: A non-strict, purely functional language. Version 1.2 - Hudak, Jones, et al. - 1992
59	Inductive families - Dybjer - 1994
59	An Intuitionistic Theory of Types - Martin-Lof - 1973
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
48	Hauptsatz for the intuitionistic theory of iterated inductive definitions - Martin-Löf - 1971
42	Natural Deduction. Almquist - Prawitz - 1965
38	and Gérard Huet. The Calculus of Constructions - Coquand - 1988
37	Logic and Computation - Paulson - 1987
35	Benthem Jutting. Checking Landau’s “Grundlagen” in the AUTOMATH system - van - 1977
29	From Semantics to Rules: A Machine Assisted Analysis - Coquand - 1993
27	A short description of another logical framework - Augustsson, Coquand, et al. - 1990
27	Do-it-yourself type theory - Backhouse, Chisholm, et al. - 1989
21	Zur Deutung der intuitionistischen Logik. Mathematische Zeitschrift, 35:58 65 - Kolmogorov - 1932
21	Infinitely long terms of transfinite type - Tait - 1965
20	Mathematics as a numerical language - Bishop - 1970
16	The De�nition of Standard ML - Milner, Tofte, et al. - 1990
16	The independence of peano's fourth axiom from Martin-Lof's type theory without universes - Smith - 1988
14	Programming in Martin-Lf's Type Theory: An Introduction - Nordstrm, Petersson, et al. - 1990
14	On the meaning and construction of the rules in Martin-Löf’s theory of types - Backhouse - 1987
13	A framework for de��ning logics - Harper, Honsel, et al. - 1942
13	Intuitionistic Type Theory - Martin-Lf - 1984
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 machine checked proof that Ackermann’s function is not primitive recursive - Szasz - 1993
5	A Theory of Types - Martin-Lf - 1971
5	Constructive Mathematics and Computer Programming - Martin-Lf - 1982
4	Ramsey’s theorem in type theory - Fridlender - 1993
4	Machine Checked Normalization Proofs for Typed Combinator Calculi - Gaspes, Smith - 1992
3	Inductively dened types - Coquand, Paulin-Mohring - 1990
3	A machine-assisted proof of the fundamental theorem of arithmetic - Sydow - 1992
2	On the meaning and construction of the rules in Martin-L#f's theory of types - Backhouse - 1987
2	Formal Proofs of Combinatorial Completeness - Gaspes - 1992
2	ber eine bisher noch nicht benutze erweitrung des ��niten standpunktes - Gdel - 1958
2	Hauptsatz for the Intuitionistic Theory of Iterated Inductive De��nitions - Martin-Lf - 1971