ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti

Abstract

The programming environment FoCaLiZe allows the user to specify, implement, and prove programs with the help of the theorem prover Zenon. In the actual version, those proofs are verified by Coq. In this paper we propose to extend the FoCaLiZe compiler by a backend to the Dedukti language in order to benefit from Zenon Modulo, an extension of Zenon for Deduction modulo. By doing so, FoCaLiZe can benefit from a technique for finding and verifying proofs more quickly. The paper focuses mainly on the process that overcomes the lack of local pattern-matching and recursive definitions in Dedukti.
Fichier principal
Vignette du fichier
ICTAC_2016.pdf (198.88 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01420638 , version 1 (20-12-2016)

Identifiers

Cite

Raphaël Cauderlier, Catherine Dubois. ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti. ICTAC 2016 - 13th International Colloquium on Theoretical Aspects of Computing, Oct 2016, Taipei, Taiwan. pp.459-468, ⟨10.1007/978-3-319-46750-4_26⟩. ⟨hal-01420638⟩
151 View
279 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More