On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory (2008)

by Andreas Abel , Thierry Coquand , Peter Dybjer

Citations:

2 - 2 self

User correction supplied by mph

Datum	Value	Source
TITLE	On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory	SVM HeaderParse 0.2
AUTHOR NAME	Andreas Abel	user correction
AUTHOR AFFIL	Institut für Informatik, Ludwig-Maximilians-Universität	user correction
AUTHOR ADDR	D- München	user correction
AUTHOR NAME	Thierry Coquand	user correction
AUTHOR AFFIL		user correction
AUTHOR NAME	Peter Dybjer	user correction
AUTHOR AFFIL	Department of Computer Science, Chalmers University of Technology	user correction
AUTHOR ADDR	Rännvägen 6, S-41296 Göteborg	user correction
ABSTRACT	An algebraic presentation of Martin-Löf’s intuitionistic type theory is given which is based on the notion of a category with families with extra structure. We then present a type-checking algorithm for the normal forms of this theory, and sketch how it gives rise to an initial category with families with extra structure. In this way we obtain a purely algebraic formulation of the correctness of the type-checking algorithm which provides the core of proof assistants for intuitionistic type theory.	user correction
YEAR	2008	user correction
CITATIONS	13 found	ParsCit 1.0