Generalizing inference systems by coaxioms

12/04/2017
by   Francesco Dagnino, et al.
0

After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference system allows coaxioms, which are, intuitively, axioms which can only be applied "at infinite depth" in a proof tree. This notion nicely subsumes standard inference systems and their inductive and coinductive interpretation, while providing more flexibility. Indeed, the classical results can be extended to our generalized framework, interpreting recursive definitions as fixed points which are not necessarily the least, nor the greatest one. This allows formal reasoning in cases where the inductive and coinductive interpretation do not provide the intended meaning, or are mixed together.

READ FULL TEXT
research
08/08/2018

Coaxioms: flexible coinductive definitions by inference systems

We introduce a generalized notion of inference system to support more fl...
research
02/14/2020

Flexible Coinduction in Agda

Theorem provers are tools that help users to write machine readable proo...
research
06/04/2020

Foundations of regular coinduction

Inference systems are a widespread framework used to define possibly rec...
research
09/14/2017

Extending Coinductive Logic Programming with Co-Facts

We introduce a generalized logic programming paradigm where programs, co...
research
04/11/2023

Complementation: a bridge between finite and infinite proofs

When a proposition has no proof in an inference system, it is sometimes ...
research
05/24/2016

Inductive supervised quantum learning

In supervised learning, an inductive learning algorithm extracts general...
research
11/06/2018

Unboxing Mutually Recursive Type Definitions in OCaml

In modern OCaml, single-argument datatype declarations (variants with a ...

Please sign up or login with your details

Forgot password? Click here to reset