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

Полное описание

Библиографические подробности
Главные авторы:	Robert Constable, Wojciech Moczydlowski
Формат:	Статья
Язык:	English
Опубликовано:	Logical Methods in Computer Science e.V. 2008-09-01
Серии:	Logical Methods in Computer Science
Предметы:	computer science - logic in computer science f.4.1
Online-ссылка:	https://lmcs.episciences.org/1140/pdf

Схожие документы

Normalization of IZF with Replacement
по: Wojciech Moczydlowski
Опубликовано: (2008-04-01)

A Normalizing Intuitionistic Set Theory with Inaccessible Sets
по: Wojciech Moczydlowski
Опубликовано: (2007-08-01)

Classical BI: Its Semantics and Proof Theory
по: James Brotherston, и др.
Опубликовано: (2010-07-01)

Intuitionistic Layered Graph Logic: Semantics and Proof Theory
по: Simon Docherty, и др.
Опубликовано: (2018-10-01)

A Finite-Model-Theoretic View on Propositional Proof Complexity
по: Erich Grädel, и др.
Опубликовано: (2022-06-01)

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
по: Vassilios Gregoriades
Опубликовано: (2011-11-01)

From Proof Nets to the Free *-Autonomous Category
по: Francois Lamarche, и др.
Опубликовано: (2006-10-01)

A proof system for graph (non)-isomorphism verification
по: Milan Banković, и др.
Опубликовано: (2023-02-01)

Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
по: Assia Mahboubi, и др.
Опубликовано: (2012-02-01)

A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
по: Stéphane Jean Eric Lengrand, и др.
Опубликовано: (2011-03-01)

A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
по: Andreas Abel, и др.
Опубликовано: (2011-05-01)

On completeness of reducibility candidates as a semantics of strong normalization
по: Denis Cousineau
Опубликовано: (2012-02-01)

On the strength of proof-irrelevant type theories
по: Benjamin Werner
Опубликовано: (2008-09-01)

Kripke Semantics for Martin-L\"of's Extensional Type Theory
по: Steve Awodey, и др.
Опубликовано: (2011-09-01)

$\mathsf{LLF}_{\cal P}$: a logical framework for modeling external evidence, side conditions, and proof irrelevance using monads
по: Furio Honsell, и др.
Опубликовано: (2017-07-01)

Some model theory for the modal $\mu$-calculus: syntactic characterisations of semantic properties
по: Gaëlle Fontaine, и др.
Опубликовано: (2018-02-01)

The Completeness of Propositional Resolution: A Simple and Constructive Proof
по: Jean Gallier
Опубликовано: (2006-11-01)

Transforming structures by set interpretations
по: Thomas Colcombet, и др.
Опубликовано: (2007-05-01)

Proof-irrelevant model of CC with predicative induction and judgmental equality
по: Gyesik Lee, и др.
Опубликовано: (2011-11-01)

Almost periodic functions, constructively
по: Bas Spitters
Опубликовано: (2005-12-01)

Algorithmic Randomness and Capacity of Closed Sets
по: Douglas Cenzer, и др.
Опубликовано: (2011-09-01)

A proof of strong normalisation using domain theory
по: Thierry Coquand, и др.
Опубликовано: (2007-12-01)

Coalgebraic trace semantics via forgetful logics
по: Bartek Klin, и др.
Опубликовано: (2017-04-01)

Internalising modified realisability in constructive type theory
по: Erik Palmgren
Опубликовано: (2005-10-01)

Realizability algebras: a program to well order R
по: Jean-Louis Krivine
Опубликовано: (2011-08-01)

Exhaustible sets in higher-type computation
по: Martin Escardo
Опубликовано: (2008-08-01)

On linear rewriting systems for Boolean logic and some applications to proof theory
по: Anupam Das, и др.
Опубликовано: (2017-04-01)

Width and size of regular resolution proofs
по: Alasdair Urquhart
Опубликовано: (2012-06-01)

Game semantics for first-order logic
по: Olivier Laurent
Опубликовано: (2010-10-01)

First-order query evaluation on structures of bounded degree
по: Wojciech Kazana, и др.
Опубликовано: (2011-06-01)

Knowledge-Based Synthesis of Distributed Systems Using Event Structures
по: Mark Bickford, и др.
Опубликовано: (2011-05-01)

Consistency and Completeness of Rewriting in the Calculus of Constructions
по: Daria Walukiewicz-Chrzaszcz, и др.
Опубликовано: (2008-09-01)

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics
по: Matthias Hoelzel, и др.
Опубликовано: (2021-07-01)

The Algebraic Intersection Type Unification Problem
по: Andrej Dudenhefner, и др.
Опубликовано: (2017-08-01)

No solvable lambda-value term left behind
по: Á. García-Pérez, и др.
Опубликовано: (2016-06-01)

Qualitative and Quantitative Monitoring of Spatio-Temporal Properties with SSTL
по: L. Nenzi, и др.
Опубликовано: (2018-10-01)

Mixin Composition Synthesis based on Intersection Types
по: Jan Bessai, и др.
Опубликовано: (2018-02-01)

Axioms for Modelling Cubical Type Theory in a Topos
по: Ian Orton, и др.
Опубликовано: (2018-12-01)

Bounded Linear Logic, Revisited
по: Ugo Dal Lago, и др.
Опубликовано: (2010-12-01)

Interactive Learning-Based Realizability for Heyting Arithmetic with EM1
по: Federico Aschieri, и др.
Опубликовано: (2010-09-01)