Derivation of a parsing algorithm in Martin-Löf's theory of types (Q1097045)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4033122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derivation of a parsing algorithm in Martin-Löf's theory of types |
scientific article; zbMATH DE number 4033122 |
Statements
Derivation of a parsing algorithm in Martin-Löf's theory of types (English)
0 references
1987
0 references
Type theory is a mathematical language with computation rules developed by Per Martin-Löf. Type theory was initially developed as a formalization of constructive mathematics but Martin-Löf has pointed out that it can also be viewed as a formal system for the development of provably correct programs. Here, a parser for a simple expression language is specified and a program derived from the proof of correctness of its specification using the formalism of type theory. The proof is compared with a proof of the same problem formalized in the Edinburgh LCF system.
0 references
correctness proof of specification
0 references
parser
0 references
simple expression language
0 references
type theory
0 references
0.8024747371673584
0 references
0.7825108170509338
0 references
0.7647061347961426
0 references
