Internalising modified realisability in constructive type theory
A modified realisability interpretation of infinitary logic is formalised and proved sound in constructive type theory (CTT). The logic considered subsumes first order logic. The interpretation makes it possible to extract programs with simplified types and to incorporate and reason about them in CT...
Main Author: | Erik Palmgren |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2005-10-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/2266/pdf |
Similar Items
-
Kripke Semantics for Martin-L\"of's Extensional Type Theory
by: Steve Awodey, et al.
Published: (2011-09-01) -
Normalisation by Evaluation for Type Theory, in Type Theory
by: Thorsten Altenkirch, et al.
Published: (2017-10-01) -
Modalities in homotopy type theory
by: Egbert Rijke, et al.
Published: (2020-01-01) -
The Independence of Markov's Principle in Type Theory
by: Thierry Coquand, et al.
Published: (2017-08-01) -
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
by: Andreas Abel, et al.
Published: (2011-05-01)