Derivation of a parsing algorithm in Martin-Löf's theory of types (Q1097045): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6423(87)90002-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031355212 / rank | |||
Normal rank | |||
Latest revision as of 19:33, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Derivation of a parsing algorithm in Martin-Löf's theory of types |
scientific article |
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
