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
Онлайн хандалт:	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)

Proof-irrelevant model of CC with predicative induction and judgmental equality
-н: Gyesik Lee, зэрэг
Хэвлэсэн: (2011-11-01)

Transforming structures by set interpretations
-н: Thomas Colcombet, зэрэг
Хэвлэсэн: (2007-05-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)

Width and size of regular resolution proofs
-н: Alasdair Urquhart
Хэвлэсэн: (2012-06-01)

On linear rewriting systems for Boolean logic and some applications to proof theory
-н: Anupam Das, зэрэг
Хэвлэсэн: (2017-04-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)