A simple type-theoretic language: Mini-TT
Kapitel i bok, 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

Författare

Thierry Coquand

Göteborgs universitet

Y. Kinoshita

National Institute of Advanced Industrial Science and Technology

Bengt Nordström

Chalmers, Data- och informationsteknik, Datavetenskap

M. Takeyama

National Institute of Advanced Industrial Science and Technology

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

139-164

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1017/CBO9780511770524.007

ISBN

9780521518253