Inductive definitions and type theory an introduction (preliminary version)
Paper in proceedings, 1994

We give a short introduction to Martin-Löf's Type Theory, seen as a theory of inductive definitions. The first part contains historical remarks that motivate this approach. The second part presents a computational semantics, which explains how proof trees can be represented using the notations of functional programming.

Author

Peter Dybjer

Programming Logic

Thierry Coquand

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

Foundation of Software Technology and Theoretical Computer Science: 14th Conference Madras, India; (Lecture Notes in Computer Science; 880)

Vol. 880 60-76

Subject Categories

Other Mathematics

DOI

10.1007/3-540-58715-2_114

ISBN

3-540-58715-2

More information

Created

10/7/2017