A simple type-theoretic language: Mini-TT
Book chapter, 2009

This paper presents a formal description of a small functional language with dependent types. The language contains data types, mutual recursive/ inductive definitions and a universe of small types. The syntax, semantics and type system is specified in such a way that the implementation of a parser, interpreter and type checker is straightforward. The main difficulty is to design the conversion algorithm in such a way that it works for open expressions. The paper ends with a complete implementation in Haskell (around 400 lines of code).

dependent types

type checker

recursive

programming language

type theory

data types

Author

Thierry Coquand

University of Gothenburg

Y. Kinoshita

National Institute of Advanced Industrial Science and Technology (AIST)

Bengt Nordström

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

M. Takeyama

National Institute of Advanced Industrial Science and Technology (AIST)

From Semantics to Computer Science : Essays in Honour of Gilles Kahn

Vol. 9780521518253 139-164
9780521518253 (ISBN)

Subject Categories

Computer Science

DOI

10.1017/CBO9780511770524.007

ISBN

9780521518253

More information

Latest update

7/12/2024