Derivation of a parsing algorithm in Martin-Löf's theory of types
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.
scientific article; zbMATH DE number 4033122