Residual Theory in Calculus: A Formal Development

50Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

We present the complete development, in Gallina, of the residual theory of 0-reduction in pure ?-calculus. The main result is the Prism Theorem, and its corollary Levy's Cube Lemma, a strong form of the parallel-moves lemma, itself a key step towards the confluence theorem and its usual corollaries (Church-Rosser, uniqueness of normal forms). Gallina is the specification language of the Coq Proof Assistant (Dowek et al1991; Huet 1992b). It is a specific concrete syntax for its abstract framework, the Calculus of Inductive Constructions (Paulin-Mohring, 1993). It may be thought of as a smooth mixture of higher-order predicate calculus with recursive definitions, inductively defined data types and inductive predicate definitions reminiscent of logic programming. The development presented here was fully checked in the current distribution version Coq V5.8. We just state the lemmas in the order in which they are proved, omitting the proof justifications. The full transcript is available as a standard library in the distribution of Coq. © 1994, Cambridge University Press. All rights reserved.

Cite

CITATION STYLE

APA

Huet, G. (1994). Residual Theory in Calculus: A Formal Development. Journal of Functional Programming, 4(3), 371–394. https://doi.org/10.1017/S0956796800001106

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free