Intuitionistic Fixed Point Logic

02/01/2020
by   Ulrich Berger, et al.
0

We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define a realizability interpretation of IFP and use it to extract computational content from proofs about abstract structures specified by arbitrary classically true disjunction free formulas. The interpretation is shown to be sound with respect to a domain-theoretic denotational semantics and a corresponding lazy operational semantics of a functional language for extracted programs. We also show how extracted programs can be translated into Haskell. As an application we extract a program converting the signed digit representation of real numbers to infinite Gray-code from a proof of inclusion of the corresponding coinductive predicates.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/29/2021

Extracting total Amb programs from proofs

We present a logical system CFP (Concurrent Fixed Point Logic) from whos...
04/12/2019

Axiomatizing first-order consequences in inclusion logic

Inclusion logic is a variant of dependence logic that was shown to have ...
08/05/2020

Flexible coinductive logic programming

Recursive definitions of predicates are usually interpreted either induc...
09/14/2017

Extending Coinductive Logic Programming with Co-Facts

We introduce a generalized logic programming paradigm where programs, co...
05/29/2021

Computing with Infinite Objects: the Gray Code Case

Infinite Gray code has been introduced by Tsuiki <cit.> as a redundancy-...
07/14/2020

Nonclassical truth with classical strength. A proof-theoretic analysis of compositional truth over HYPE

Questions concerning the proof-theoretic strength of classical versus no...
08/30/2021

A Coinductive Version of Milner's Proof System for Regular Expressions Modulo Bisimilarity

By adapting Salomaa's complete proof system for equality of regular expr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.