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

Bibliografiset tiedot
Päätekijät:	Robert Constable, Wojciech Moczydlowski
Aineistotyyppi:	Artikkeli
Kieli:	English
Julkaistu:	Logical Methods in Computer Science e.V. 2008-09-01
Sarja:	Logical Methods in Computer Science
Aiheet:	computer science - logic in computer science f.4.1
Linkit:	https://lmcs.episciences.org/1140/pdf

Samankaltaisia teoksia

Normalization of IZF with Replacement
Tekijä: Wojciech Moczydlowski
Julkaistu: (2008-04-01)

A Normalizing Intuitionistic Set Theory with Inaccessible Sets
Tekijä: Wojciech Moczydlowski
Julkaistu: (2007-08-01)

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

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

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

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

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

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

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

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

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

On completeness of reducibility candidates as a semantics of strong normalization
Tekijä: Denis Cousineau
Julkaistu: (2012-02-01)

On the strength of proof-irrelevant type theories
Tekijä: Benjamin Werner
Julkaistu: (2008-09-01)

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

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

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

The Completeness of Propositional Resolution: A Simple and Constructive Proof
Tekijä: Jean Gallier
Julkaistu: (2006-11-01)

Transforming structures by set interpretations
Tekijä: Thomas Colcombet, et al.
Julkaistu: (2007-05-01)

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

Almost periodic functions, constructively
Tekijä: Bas Spitters
Julkaistu: (2005-12-01)

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

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

Coalgebraic trace semantics via forgetful logics
Tekijä: Bartek Klin, et al.
Julkaistu: (2017-04-01)

Internalising modified realisability in constructive type theory
Tekijä: Erik Palmgren
Julkaistu: (2005-10-01)

Realizability algebras: a program to well order R
Tekijä: Jean-Louis Krivine
Julkaistu: (2011-08-01)

Exhaustible sets in higher-type computation
Tekijä: Martin Escardo
Julkaistu: (2008-08-01)

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

Width and size of regular resolution proofs
Tekijä: Alasdair Urquhart
Julkaistu: (2012-06-01)

Game semantics for first-order logic
Tekijä: Olivier Laurent
Julkaistu: (2010-10-01)

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

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

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

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

The Algebraic Intersection Type Unification Problem
Tekijä: Andrej Dudenhefner, et al.
Julkaistu: (2017-08-01)

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

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

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

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

Bounded Linear Logic, Revisited
Tekijä: Ugo Dal Lago, et al.
Julkaistu: (2010-12-01)

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