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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical structures in computer science Vol. 29; no. 8; pp. 1125 - 1150
Main Authors:	GUIDI, FERRUCCIO, SACERDOTI COEN, CLAUDIO, TASSI, ENRICO
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2019 Cambridge University Press (CUP)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!