DeepAI AI Chat
Log In Sign Up

Intuitionistic Fixed Point Logic

by   Ulrich Berger, et al.

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.


page 1

page 2

page 3

page 4


Extracting total Amb programs from proofs

We present a logical system CFP (Concurrent Fixed Point Logic) from whos...

Axiomatizing first-order consequences in inclusion logic

Inclusion logic is a variant of dependence logic that was shown to have ...

Extending Coinductive Logic Programming with Co-Facts

We introduce a generalized logic programming paradigm where programs, co...

Computing with Infinite Objects: the Gray Code Case

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

Data Layout from a Type-Theoretic Perspective

The specifics of data layout can be important for the efficiency of func...

Flexible coinductive logic programming

Recursive definitions of predicates are usually interpreted either induc...