Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics

Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics

Church's Higher Order Logic is a basis for influential proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We factor HOL into a constructive core plus axioms of excluded middle and choice. We similarly factor standard...

Descripció completa

Dades bibliogràfiques
Autors principals:	Robert Constable, Wojciech Moczydlowski
Format:	Article
Idioma:	English
Publicat:	Logical Methods in Computer Science e.V. 2008-09-01
Col·lecció:	Logical Methods in Computer Science
Matèries:	computer science - logic in computer science f.4.1
Accés en línia:	https://lmcs.episciences.org/1140/pdf

Ítems similars

Normalization of IZF with Replacement
per: Wojciech Moczydlowski
Publicat: (2008-04-01)

A Normalizing Intuitionistic Set Theory with Inaccessible Sets
per: Wojciech Moczydlowski
Publicat: (2007-08-01)

Classical BI: Its Semantics and Proof Theory
per: James Brotherston, et al.
Publicat: (2010-07-01)

Intuitionistic Layered Graph Logic: Semantics and Proof Theory
per: Simon Docherty, et al.
Publicat: (2018-10-01)

A Finite-Model-Theoretic View on Propositional Proof Complexity
per: Erich Grädel, et al.
Publicat: (2022-06-01)

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
per: Vassilios Gregoriades
Publicat: (2011-11-01)

From Proof Nets to the Free *-Autonomous Category
per: Francois Lamarche, et al.
Publicat: (2006-10-01)

A proof system for graph (non)-isomorphism verification
per: Milan Banković, et al.
Publicat: (2023-02-01)

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
per: Assia Mahboubi, et al.
Publicat: (2012-02-01)

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
per: Stéphane Jean Eric Lengrand, et al.
Publicat: (2011-03-01)

A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
per: Andreas Abel, et al.
Publicat: (2011-05-01)

On completeness of reducibility candidates as a semantics of strong normalization
per: Denis Cousineau
Publicat: (2012-02-01)

On the strength of proof-irrelevant type theories
per: Benjamin Werner
Publicat: (2008-09-01)

Kripke Semantics for Martin-L\"of's Extensional Type Theory
per: Steve Awodey, et al.
Publicat: (2011-09-01)

$\mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads
per: Furio Honsell, et al.
Publicat: (2017-07-01)

Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
per: Gaëlle Fontaine, et al.
Publicat: (2018-02-01)

The Completeness of Propositional Resolution: A Simple and Constructive Proof
per: Jean Gallier
Publicat: (2006-11-01)

Proof-irrelevant model of CC with predicative induction and judgmental equality
per: Gyesik Lee, et al.
Publicat: (2011-11-01)

Transforming structures by set interpretations
per: Thomas Colcombet, et al.
Publicat: (2007-05-01)

Almost periodic functions, constructively
per: Bas Spitters
Publicat: (2005-12-01)

Algorithmic Randomness and Capacity of Closed Sets
per: Douglas Cenzer, et al.
Publicat: (2011-09-01)

A proof of strong normalisation using domain theory
per: Thierry Coquand, et al.
Publicat: (2007-12-01)

Coalgebraic trace semantics via forgetful logics
per: Bartek Klin, et al.
Publicat: (2017-04-01)

Internalising modified realisability in constructive type theory
per: Erik Palmgren
Publicat: (2005-10-01)

Realizability algebras: a program to well order R
per: Jean-Louis Krivine
Publicat: (2011-08-01)

Exhaustible sets in higher-type computation
per: Martin Escardo
Publicat: (2008-08-01)

Width and size of regular resolution proofs
per: Alasdair Urquhart
Publicat: (2012-06-01)

On linear rewriting systems for Boolean logic and some applications to proof theory
per: Anupam Das, et al.
Publicat: (2017-04-01)

Game semantics for first-order logic
per: Olivier Laurent
Publicat: (2010-10-01)

First-order query evaluation on structures of bounded degree
per: Wojciech Kazana, et al.
Publicat: (2011-06-01)

Knowledge-Based Synthesis of Distributed Systems Using Event Structures
per: Mark Bickford, et al.
Publicat: (2011-05-01)

Consistency and Completeness of Rewriting in the Calculus of Constructions
per: Daria Walukiewicz-Chrzaszcz, et al.
Publicat: (2008-09-01)

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
per: Matthias Hoelzel, et al.
Publicat: (2021-07-01)

The Algebraic Intersection Type Unification Problem
per: Andrej Dudenhefner, et al.
Publicat: (2017-08-01)

No solvable lambda-value term left behind
per: Á. García-Pérez, et al.
Publicat: (2016-06-01)

Qualitative and Quantitative Monitoring of Spatio-Temporal Properties with SSTL
per: L. Nenzi, et al.
Publicat: (2018-10-01)

Mixin Composition Synthesis based on Intersection Types
per: Jan Bessai, et al.
Publicat: (2018-02-01)

Axioms for Modelling Cubical Type Theory in a Topos
per: Ian Orton, et al.
Publicat: (2018-12-01)

Bounded Linear Logic, Revisited
per: Ugo Dal Lago, et al.
Publicat: (2010-12-01)

Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
per: Federico Aschieri, et al.
Publicat: (2010-09-01)