Extraction of Efficient Programs in IΣ_1-arithmetic

10/01/2019
by   Ján Komara, et al.
0

Clausal Language (CL) is a declarative programming and verifying system used in our teaching of computer science. CL is an implementation of, what we call, PR+IΣ_1 paradigm (primitive recursive functions with IΣ_1-arithmetic). This paper introduces an extension of IΣ_1-proofs called extraction proofs where one can extract from the proofs of Π_2-specifications primitive recursive programs as efficient as the hand-coded ones. This is achieved by having the programming constructs correspond exactly to the proof rules with the computational content.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2018

Breaking the Loop: Recursive Proofs for Coinductive Predicates in Fibrations

The purpose of this paper is to develop and study recursive proofs of co...
research
08/03/2022

On Brooks' Theorem

In this note we give two proofs of Brooks' Theorem. The first is obtaine...
research
03/29/2013

Formalizing the Confluence of Orthogonal Rewriting Systems

Orthogonality is a discipline of programming that in a syntactic manner ...
research
03/15/2021

Classical (Co)Recursion: Mechanics

Primitive recursion is a mature, well-understood topic in the theory and...
research
10/29/2018

To Memory Safety through Proofs

We present a type system capable of guaranteeing the memory safety of pr...
research
11/15/2018

Axiomatic approach to the theory of algorithms and relativized computability

It is well known that many theorems in recursion theory can be "relativi...
research
11/14/2018

Lemma Functions for Frama-C: C Programs as Proofs

This paper describes the development of an auto-active verification tech...

Please sign up or login with your details

Forgot password? Click here to reset