Abstract:
Abstract. This paper deals with the application of constructive type theory to the theory of programming languages. The main aim of this work is to investigate constructive formalisations of the mathematics of programs. Here, we consider a small typed functional language and prove some properties about it, arriving at the property that establishes that well typed expressions cannot go wrong. First, we give the de��nitions and proofs in an informal style, and then we present and explain the formalisation of these de��nitions and proofs. For the formalisation, we use the proof editor ALF and its pattern matching facility. 1
Citations
|
1064
|
A Structural Approach to Operational Semantics
– Plotkin
- 1981
|
|
801
|
A theory of type polymorphism in programming
– Milner
- 1978
|
|
444
|
Lambda calculi with types
– Barendregt
- 1991
|
|
256
|
Principal type-schemes for functional programs
– Damas, Milner
- 1982
|
|
182
|
Logic programming in the LF logical framework
– Pfenning
- 1991
|
|
104
|
Semantics with Applications: A Formal Introduction
– Nielson, Nielson
- 1992
|
|
98
|
The ALF proof editor and its proof engine
– Magnusson, Nordström
- 1994
|
|
91
|
Type Assignment in Programming Languages
– Damas
- 1985
|
|
88
|
A Simple Applicative Language: MINI-ML
– Clement
- 1986
|
|
72
|
The Semantics of Programming Languages: An Elementary Introduction Using Structural Operational Semantics
– Hennessy
- 1990
|
|
67
|
The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions
– Pollack
- 1994
|
|
44
|
Natural semantics and some of its meta-theory in Elf
– Michaylov, Pfenning
- 1991
|
|
35
|
A User's Guide to ALF
– Altenkirch, Gaspes, et al.
- 1994
|
|
20
|
Type theory and programming
– Coquand, Nordstrom, et al.
- 1994
|
|
15
|
A framework for de��ning logics
– Harper, Honsell, et al.
- 1993
|
|
15
|
Programming in Martin-L#f's Type Theory. An Introduction
– Nordstrm, Petersson, et al.
- 1990
|
|
8
|
The new Implementation of ALF. In The informal proceeding from the logical framework workshop at Bastad
– Magnusson
- 1992
|
|
4
|
A machine-assisted proof of the subject reduction property for a small typed functional language
– Bove
- 1995
|
|
3
|
Machine-assisted application of constructive type theory to the theory of functional programming languages. a ��rst experiment using alf
– Tasistro
- 1997
|
|
2
|
Programming in MartinL #f's Type Theory. An Introduction
– Nordstrm, Petersson, et al.
- 1990
|
|
1
|
Polymorphic type systems : A proof - theoretic approach
– Holmstrm
- 1983
|
