### Abstract

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. © 1987.

Original language | English |
---|---|

Pages (from-to) | 1-42 |

Number of pages | 42 |

Journal | Science of Computer Programming |

Volume | 8 |

Issue number | 1 |

Publication status | Published - Feb 1987 |

## Fingerprint Dive into the research topics of 'Derivation of a parsing algorithm in martin-löf's theory of types'. Together they form a unique fingerprint.

## Cite this

Chisholm, P. (1987). Derivation of a parsing algorithm in martin-löf's theory of types.

*Science of Computer Programming*,*8*(1), 1-42.