Standardization and Confluence in Pure Lambda-Calculus Formalized for the Matita Theorem Prover

Ferruccio Guidi


We present a formalization of pure ?-calculus for the Matita interactive theorem prover, including the proofs of two relevant results in reduction theory: the confluence theorem and the standardization theorem. The proof of the latter is based on a new approach recently introduced by Xi and refined by Kashima that, avoiding the notion of development and having a neat inductive structure, is particularly suited for formalization in theorem provers.

Full Text:

PDF (English)

DOI: 10.6092/issn.1972-5787/3392

Copyright (c) 2012 Ferruccio Guidi

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.