Implementing type theory in higher order constraint logic programming

In this paper, we are interested in high-level programming languages to implement the core components of an interactive theorem prover for a dependently typed language: the kernel – responsible for type-checking closed terms – and the elaborator – that manipulates open terms, that is terms containin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Mathematical structures in computer science Jg. 29; H. 8; S. 1125 - 1150
Hauptverfasser:	GUIDI, FERRUCCIO, SACERDOTI COEN, CLAUDIO, TASSI, ENRICO
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cambridge, UK Cambridge University Press 01.09.2019 Cambridge University Press (CUP)
Schlagworte:	Computer Science Embedded systems High level languages Kernels Logic in Computer Science Logic programming Mathematical Software Programming languages Prolog Pure type systems Semantics Theorem proving
ISSN:	0960-1295, 1469-8072
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!