Name
Abstract | ||
|---|---|---|
We introduce a generalized notion of inference system to support structural recursion on non well-founded datatypes. 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 on the existence and constructive characterization of least and greatest fixed points 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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-662-54434-1_2 | ESOP |
Field | DocType | Citations |
Discrete mathematics,Algebra,Axiom,Generalization,Inference,Coinduction,Data type,Fixed point,Rule of inference,Mathematics,Recursion | Conference | 2 |
PageRank | References | Authors |
0.36 | 25 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davide Ancona | 1 | 727 | 69.43 |
| Francesco Dagnino | 2 | 4 | 3.09 |
| Elena Zucca | 3 | 497 | 101.25 |