Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Completeness for typed lazy inequalities
1990 / IEEE / 0-8186-2073-0
This item was taken from the IEEE Periodical ' Completeness for typed lazy inequalities ' Familiar beta eta -equational reasoning on lambda -terms is unsound for proving observational congruences when termination of the standard lazy interpreter is taken into account. A complete logic, based on sequents, for proving termination-observational congruences between simply-typed terms without constants is developed. It is shown that the theory, like that of beta eta -reasoning in the ordinary types lambda -calculus, is decidable. The authors examined the termination behavior of the functional language PCF under the standard interpreters.<
Typed Lazy Inequalities
Beta Eta -equational Reasoning
Simply-typed Terms Without Constants
Functional Language Pcf
Standard Lazy Interpreter