A machine assisted proof of the subject reduction property for small typed functional language. Master Thesis
We present an experiment in formally describing a programming language and its properties in constructive type theory. By constructive type theory we understand primarily the formulation of Martin Löf's set theory. Constructive type theory can also be seen as a programming language where we write ty...
Saved in:
| Main Author: | |
|---|---|
| Format: | masterThesis |
| Language: | English |
| Published: |
1995
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.12008/2912 |
| Tags: |
No Tags, Be the first to tag this record!
|
| Summary: | We present an experiment in formally describing a programming language and its properties in constructive type theory. By constructive type theory we understand primarily the formulation of Martin Löf's set theory. Constructive type theory can also be seen as a programming language where we write types, and objects of these types can be view as funtional programming environments of proof assistants. The language we analyze is a small typed functional language. We present its syntax, its dynamic semanctics and its type system. Among other properties, we present a formalization pf the Subject Reduction property for the language. The proof assistant we use is ALF. |
|---|