B. Nordström, K. Petersson, J. M. Smith  Home/Search
Context
Related
| cs.chalmers.se/~bengt/pape...hlcs.ps.gz cs.chalmers.se/pub/csrepo...hlcs.ps.gz 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: cs.chalmers.se/Com...publications (more) From: math.chalmers.se/~smith/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ion b 2 B [x 2 A] ([x]b) 2 (x 2 A)B We will write repeated abstractions as [x 1 ; x 2 ; : : : ; xn ]b and also exclude the outermost parentheses when there is no risk of confusion. How do we know that this rule is correct, i.e. how do we know that [x]b is a function of the type (x 2 A)B? By the semantics of function types, we must know that when we apply [x]b of type (x 2 A)B on an object a of type A, then we get an object of type B[x / a]; the explanation is by fi-conversion:... (Update)
Similar documents (at the sentence level):
7.1%: Type Theory and Programming - Coquand, Nordström, Smith, von Sydow (1994) (Correct)
Active bibliography (related documents): More All
0.8: A user's guide to ALF - Altenkirch, Gaspes, Nordström, von.. (1994) (Correct)
0.5: Intuitionistic Model Constructions and Normalization Proofs - Coquand, Dybjer (1998) (Correct)
0.5: Program Development in Constructive Type Theory - Galmiche (1992) (Correct)
Similar documents based on text: More All
0.2: Program Derivation in Type Theory: A Partitioning Problem - Petersson, Smith (Correct)
0.2: The Weil-Petersson and Thurston Symplectic Forms - Sözen, Bonahon (Correct)
0.1: An Implementation of Standard ML Modules - David Macqueen Att (1988) (Correct)
BibTeX entry: (Update)
@misc{ nordstr-martinlfs,
author = "B. Nordström and K. Petersson and J. M. Smith",
title = "Martin-Löf's Type Theory",
url = "citeseer.ist.psu.edu/1666.html" }
Citations (may not include all citations):505 Implementing Mathematics with the NuPRL Proof Development Sy.. - Constable - 1986 ACM
419 A Formulation of the Simple Theory of Types (context) - Church - 1940 DBLP
322 volume 78 of Lecture Notes in Computer Science (context) - Gordon, Milner et al. - 1979
259 Combinatory Logic (context) - Curry, Feys - 1958
236 Intuitionistic Type Theory (context) - Martin-L - 1984
233 The formulae-as-types notion of construction (context) - Howard - 1980
191 LEGO Proof Development System: User's Manual (context) - Luo, Pollack - 1992
185 nition of Standard ML (context) - Milner, Tofte et al. - 1990
183 Report on the Programming Language Haskell: A Non-Strict (context) - Hudak - 1992
116 Natural Deduction (context) - Prawitz - 1965
85 The ALF proof editor and its proof engine (context) - Magnusson, Nordstr - 1994 ACM DBLP
46 The Calculus of Constructions (context) - Coquand, rard - 1986 ACM DBLP
43 Logic and Computation (context) - Paulson - 1987 ACM
37 The coq proof assistant user's guide version (context) - Dowek, Felty et al. - 1991
35 Formal Aspects of Computing (context) - Dybjer - 1994
34 Intuitionism: An Introduction (context) - Heyting - 1956
29 A short description of Another Logical Framework (context) - Augustsson, Coquand et al. - 1990
23 From Semantics to Rules: a Machine Assisted Analysis - Coquand - 1994 DBLP
21 Hauptsatz for the Intuitionistic Theory of Iterated Inductiv.. (context) - Martin-L - 1971
16 The Mathematical Language AUTOMATH (context) - de Bruijn - 1968
16 Zur Deutung der intuitionistischen Logik (context) - Kolmogorov - 1932
14 Mathematics as a numerical language (context) - Bishop - 1970
10 University of Stockholm (context) - Martin-L, of et al. - 1971
10 The Independence of Peano's Fourth Axiom from Martin-L#f's T.. - Smith - 1988
9 A survey of the project AUTOMATH (context) - de Bruijn - 1980
8 A Machine Checked Proof that Ackermann's Function is not Pri.. - Szasz - 1991
5 Ramsey's theorem in type theory - Fridlender - 1993
5 f's Type Theory (context) - Nordstr, Kent et al. - 1990
3 ned types (context) - Coquand, Paulin - 1989
2 and Gordon Plotkin (context) - Harper, Honsell - 1993
2 the meaning and construction of the rules in Martin-L#f's th.. (context) - Backhouse - 1987
2 Machine Checked Normalization Proofs for Typed Combinator Ca.. (context) - Gaspes, Smith - 1992
2 Formal Proofs of Combinatorial Completeness (context) - Gaspes - 1992
1 ber eine bisher noch nicht benutze erweitrung des øniten sta.. (context) - del - 1958
1 A machine-assisted proof of the fundamental theorem of arith.. (context) - rn - 1992
1 Checking Landau's iGrundlagenj in the AUTOMATH system (context) - Jutting - 1979
Documents on the same site (http://www.cs.chalmers.se/ComputingScience/Research/Logic/publications.html): More
A case study in machine-assisted proofs: The Integers form an.. - Betarte (1993) (Correct)
A constructive topological proof of van der Waerden's theorem - Coquand (1993) (Correct)
Combinator Shared Reduction and Infinite Objects in Type Theory - Coquand (1996) (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