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

Podrobná bibliografie
Hlavní autoři:	Robert Constable, Wojciech Moczydlowski
Médium:	Článek
Jazyk:	English
Vydáno:	Logical Methods in Computer Science e.V. 2008-09-01
Edice:	Logical Methods in Computer Science
Témata:	computer science - logic in computer science f.4.1
On-line přístup:	https://lmcs.episciences.org/1140/pdf

Podobné jednotky

Normalization of IZF with Replacement
Autor: Wojciech Moczydlowski
Vydáno: (2008-04-01)

A Normalizing Intuitionistic Set Theory with Inaccessible Sets
Autor: Wojciech Moczydlowski
Vydáno: (2007-08-01)

Classical BI: Its Semantics and Proof Theory
Autor: James Brotherston, a další
Vydáno: (2010-07-01)

Intuitionistic Layered Graph Logic: Semantics and Proof Theory
Autor: Simon Docherty, a další
Vydáno: (2018-10-01)

A Finite-Model-Theoretic View on Propositional Proof Complexity
Autor: Erich Grädel, a další
Vydáno: (2022-06-01)

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
Autor: Vassilios Gregoriades
Vydáno: (2011-11-01)

From Proof Nets to the Free *-Autonomous Category
Autor: Francois Lamarche, a další
Vydáno: (2006-10-01)

A proof system for graph (non)-isomorphism verification
Autor: Milan Banković, a další
Vydáno: (2023-02-01)

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
Autor: Assia Mahboubi, a další
Vydáno: (2012-02-01)

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Autor: Stéphane Jean Eric Lengrand, a další
Vydáno: (2011-03-01)

A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
Autor: Andreas Abel, a další
Vydáno: (2011-05-01)

On completeness of reducibility candidates as a semantics of strong normalization
Autor: Denis Cousineau
Vydáno: (2012-02-01)

On the strength of proof-irrelevant type theories
Autor: Benjamin Werner
Vydáno: (2008-09-01)

Kripke Semantics for Martin-L\"of's Extensional Type Theory
Autor: Steve Awodey, a další
Vydáno: (2011-09-01)

$\mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads
Autor: Furio Honsell, a další
Vydáno: (2017-07-01)

Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
Autor: Gaëlle Fontaine, a další
Vydáno: (2018-02-01)

The Completeness of Propositional Resolution: A Simple and Constructive Proof
Autor: Jean Gallier
Vydáno: (2006-11-01)

Proof-irrelevant model of CC with predicative induction and judgmental equality
Autor: Gyesik Lee, a další
Vydáno: (2011-11-01)

Transforming structures by set interpretations
Autor: Thomas Colcombet, a další
Vydáno: (2007-05-01)

Almost periodic functions, constructively
Autor: Bas Spitters
Vydáno: (2005-12-01)

Algorithmic Randomness and Capacity of Closed Sets
Autor: Douglas Cenzer, a další
Vydáno: (2011-09-01)

A proof of strong normalisation using domain theory
Autor: Thierry Coquand, a další
Vydáno: (2007-12-01)

Coalgebraic trace semantics via forgetful logics
Autor: Bartek Klin, a další
Vydáno: (2017-04-01)

Internalising modified realisability in constructive type theory
Autor: Erik Palmgren
Vydáno: (2005-10-01)

Realizability algebras: a program to well order R
Autor: Jean-Louis Krivine
Vydáno: (2011-08-01)

Exhaustible sets in higher-type computation
Autor: Martin Escardo
Vydáno: (2008-08-01)

Width and size of regular resolution proofs
Autor: Alasdair Urquhart
Vydáno: (2012-06-01)

On linear rewriting systems for Boolean logic and some applications to proof theory
Autor: Anupam Das, a další
Vydáno: (2017-04-01)

Game semantics for first-order logic
Autor: Olivier Laurent
Vydáno: (2010-10-01)

First-order query evaluation on structures of bounded degree
Autor: Wojciech Kazana, a další
Vydáno: (2011-06-01)

Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Autor: Mark Bickford, a další
Vydáno: (2011-05-01)

Consistency and Completeness of Rewriting in the Calculus of Constructions
Autor: Daria Walukiewicz-Chrzaszcz, a další
Vydáno: (2008-09-01)

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
Autor: Matthias Hoelzel, a další
Vydáno: (2021-07-01)

The Algebraic Intersection Type Unification Problem
Autor: Andrej Dudenhefner, a další
Vydáno: (2017-08-01)

No solvable lambda-value term left behind
Autor: Á. García-Pérez, a další
Vydáno: (2016-06-01)

Qualitative and Quantitative Monitoring of Spatio-Temporal Properties with SSTL
Autor: L. Nenzi, a další
Vydáno: (2018-10-01)

Mixin Composition Synthesis based on Intersection Types
Autor: Jan Bessai, a další
Vydáno: (2018-02-01)

Axioms for Modelling Cubical Type Theory in a Topos
Autor: Ian Orton, a další
Vydáno: (2018-12-01)

Bounded Linear Logic, Revisited
Autor: Ugo Dal Lago, a další
Vydáno: (2010-12-01)

Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
Autor: Federico Aschieri, a další
Vydáno: (2010-09-01)