Derivation of a parsing algorithm in Martin-Löf's theory of types
type: Item
instance of: scholarly article
title: Derivation of a parsing algorithm in Martin-Löf's theory of types
zbMATH Open document ID: 0634.68083
DOI: 10.1016/0167-6423(87)90002-5
author: Paul Chisholm
published in: Science of Computer Programming
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68N20
Mathematics Subject Classification ID: 03F35
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q65
zbMATH DE Number: 4033122
zbMATH Keywords: correctness proof of specification
zbMATH Keywords: parser
zbMATH Keywords: simple expression language
zbMATH Keywords: type theory
describes a project that uses: LCF
MaRDI profile type: Publication
full work available at URL: 0167-6423(87)90002-5
OpenAlex ID: W2031355212
description: scientific article; zbMATH DE number 4033122