Superposition with Datatypes and Codatatypes

Jasmin Christian Blanchette (1, 2, 3) , Nicolas Peltier (4) , Simon Robillard (5)

1 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
2 LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
3 VU - Vrije Universiteit Amsterdam [Amsterdam]
4 CAPP - Calculs algorithmes programmes et preuves
5 Chalmers University of Technology [Göteborg]

The absence of a finite axiomatization of the first-order theory of data-types and codatatypes represents a challenge for automatic theorem provers. We propose two approaches to reason by saturation in this theory: one is a conservative theory extension with a finite number of axioms; the other is an extension of the superposition calculus, in conjunction with axioms. Both techniques are refutationally complete with respect to nonstandard models of datatypes and non-branching codatatypes. They take into account the acyclicity of datatype values and the existence and uniqueness of cyclic codatatype values. We implemented them in the first-order prover Vampire and compare them experimentally.

Domaines: Logique en informatique [cs.LO]

Jasmin Christian Blanchette, Nicolas Peltier, Simon Robillard. Superposition with Datatypes and Codatatypes. IJCAR 2018 - 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. ⟨hal-01904588⟩