Simulating Induction-Recursion for Partial Algorithms

Dominique Larchey-Wendling (1) , Jean-François Monin

1 TYPES - Logic, Proof Theory and Programming

We describe a generic method to implement and extract partial recursive algorithms in Coq in a purely constructive way, using L. Paulson's if-then-else normalization as a running example.

Domaines: Logique en informatique [cs.LO]; Informatique et langage [cs.CL]; Langage de programmation [cs.PL]; Théorie et langage formel [cs.FL]; Génie logiciel [cs.SE]; Logique [math.LO]

Dominique Larchey-Wendling, Jean-François Monin. Simulating Induction-Recursion for Partial Algorithms. 24th International Conference on Types for Proofs and Programs,TYPES 2018, Jun 2018, Braga, Portugal. ⟨hal-02333374⟩