Thierry Coquand, Bengt Nordström, Jan M. Smith, Björn von Sydow  Home/Search
Context Related
| cs.chalmers.se/pub...ndprogramming.ps.Z unibwmuenchen.de/...dprogramming.ps.gz cs.chalmers.se/pub/provers...eatcs.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.chalmers.se/~smith/ (more) From: fermivista.math...ibwmuenchen.de (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper gives an introduction to type theory, focusing on its recent use as a logical framework for proofs and programs. The first two sections give a background to type theory intended for the reader who is new to the subject. The following presents Martin-Lof's monomorphic type theory and an implementation, ALF, of this theory. Finally, a few small tutorial examples in ALF are given. (Update)
Context of citations to this paper: More
...with speedups of more than two orders of magnitude over traditional tactic based proof search. 1 Introduction Several provers [7 9, 11, 12, 15, 18] use higher order logics for reasoning because the expressivity of the logics permits concise problem descriptions, and because...
...theory, we recall the basic ideas and notions that we use. For a complete presentation of constructive type theory, see [ML84, NPS90, CNSvS94] A general formulation of type systems and their use in formal veri cation can be found in [Bar92] and [BG01] Constructive type...
Cited by: More
Type checking Dependent (Record) Types and Subtyping - Betarte (Correct)
Mutual General Recursion in Type Theory - Bove (2002) (Correct)
Generalised Simultaneous Inductive-Recursive Definitions and their .. - Bove (Correct)
Similar documents (at the sentence level):
11.5%: The ALF proof editor - Nordström (1993) (Correct)
7.1%: Martin-Löf's Type Theory - Nordström, Petersson, Smith (Correct)
Active bibliography (related documents): More All
0.6: A Pointfree approach to Constructive Analysis in Type Theory - Cederquist (1997) (Correct)
0.5: A Machine Assisted Proof of the Hahn-Banach Theorem - Cederquist (1997) (Correct)
0.4: An Implementation of the Heine-Borel Covering Theorem in Type.. - Cederquist (Correct)
Similar documents based on text: More All
0.4: A user's guide to ALF - Altenkirch, Gaspes, Nordström, von.. (1994) (Correct)
0.3: Inductive Definitions and Type Theory: An Introduction - Coquand, Dybjer (Correct)
0.3: A Machine-Assisted Proof of the Fundamental Theorem of Arithmetic - von Sydow (1992) (Correct)
Related documents from co-citation: More All
11: Programming in Martin-Lof's Type Theory (context) - Smith, Nordstrom et al. - 1990
7: The Theory of LEGO:A Proof Checker for the Extended Calculus of Constructions - Pollack - 1995
6: Lectures given at the Facolt'a de Lettere e Filosofia (context) - Martin-Lof, of et al. - 1987
BibTeX entry: (Update)
Thierry Coquand, Bengt Nordstrom, Jan M. Smith, and Bjorn von Sydow. Type theory and programming. EATCS, 52, February 1994. http://citeseer.ist.psu.edu/coquand94type.html More
@article{ coquand94type,
author = "Thierry Coquand and Bengt {Nordstr\"om} and Jan M. Smith and {Bj\"orn} von Sydow",
title = "Type Theory and Programming",
journal = "Bulletin of the European Association for Theoretical Computer Science",
volume = "52",
pages = "203--228",
year = "1994",
url = "citeseer.ist.psu.edu/coquand94type.html" }
Citations (may not include all citations):906 A Structural Approach to Operational Semantics - Plotkin - 1981
505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable - 1986 ACM
322 volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
266 Information and Computation (context) - Coquand, Huet et al. - 1988 DBLP
259 Combinatory Logic (context) - Curry, Feys - 1958
236 Intuitionistic Type Theory (context) - Martin-Lof - 1984
233 The formulae-as-types notion of construction (context) - Howard - 1980
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
183 Report on the Programming Language Haskell: A Non-Strict (context) - Hudak - 1992
146 Investigations into Logical Deduction (context) - Gentzen - 1969
116 Natural Deduction (context) - Prawitz - 1965
112 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
112 Constructivism in Mathematics (context) - Troelstra, van Dalen - 1988
109 Programming in Martin-Lof 's Type Theory (context) - Nordstrom, Petersson et al. - 1990
99 Foundations of Constructive Analysis (context) - Bishop - 1967
96 A survey of the project AUTOMATH (context) - de Bruijn - 1980
79 Pattern matching with dependent types (context) - Coquand - 1992
57 Proof-checking a data link protocol - Helmink, Sellink et al. - 1993 ACM DBLP
44 the interpretation of intuitionistic number theory (context) - Kleene - 1945
43 Logic and Computation (context) - Paulson - 1987 ACM
41 Notes on Constructive Mathematics (context) - Martin-Lof - 1968
38 Proof of Translation in Natural Semantics (context) - Despeyroux - 1986 DBLP
37 The coq proof assistant user's guide version (context) - Dowek, Felty et al. - 1991
34 Intuitionism: An Introduction (context) - Heyting - 1956
29 A short description of Another Logical Framework (context) - Augustsson, Coquand et al. - 1990
26 Extraction de Programmes dans le Calcul des Constructions (context) - Paulin-Mohring - 1989
26 Elements of intuitionism (context) - Dummett - 1977
23 Constructive validity (context) - Scott - 1970
23 The new Implementation of ALF (context) - Magnusson - 1992
21 A formalization of the strong normalization proof for System.. - Altenkirch - 1993 ACM DBLP
16 The Mathematical Language AUTOMATH (context) - de Bruijn - 1968
15 Computational foundations of basic recursive function theory - Constable, Smith - 1993 ACM DBLP
14 Mathematics as a numerical language (context) - Bishop - 1970
14 Intuitionistic Formal Spaces - A First Communication (context) - Sambin - 1986
13 A Globalization of the Hahn-Banach Theorem (context) - Mulvey, Pelletier - 1991
11 Real Theorem Provers Deserve Real User-Interfaces - Kahn, Thery et al. - 1992 ACM
11 Constructive topology and combinatorics - Coquand - 1992 ACM DBLP
11 Infinitely long terms of transfinite type (context) - Tait - 1965
9 Standard ML Proposal (context) - Milner - 1984
5 Ramsey's theorem in type theory - Fridlender - 1993
3 A model of intensional martin-lof type theory in which unici.. (context) - Hofmann - 1993
3 The point of pointless topology (context) - Johnstone - 1983
1 A Machine Assisted Analysis (context) - Coquand, to - 1993
1 Uber eine bisher noch nicht benutze erweitrung des finiten s.. (context) - Godel - 1958
1 An optimization algorithm for simply typed lambdacalculus (context) - Berardi - 1993
1 Salt Lake City (context) - Kahn, Technical et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.chalmers.se/~smith/): More
Optimized Encodings of Fragments of Type Theory in First Order.. - Tammet, Smith (1994) (Correct)
An Interpretation of Kleene's Slash in Type Theory - Smith (1993) (Correct)
The Strength of the Subset Type in Martin-Lof's Type Theory - Anne Salvesen (1988) (Correct)
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