A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and βequivalence checker for the λ-calculus with products, sums, and guarded fixpoints. Our approach is based on compilation to the bytecode of an abstract machine performing weak reductions on non-closed terms, derived with minimal modifications from the ZAM machine used in the Objective Caml bytecode interpreter, and complemented by a recursive "read back" procedure. Andoi:10.1145/581478.581501 dblp:conf/icfp/GregoireL02 fatcat:hyc6jim7rreu3jfllyghftt3ii