Completeness for typed lazy inequalities. Abstract: Familiar beta eta -equational reasoning on lambda -terms is unsound for proving observational congruences ...
Dec 1, 1990 · A complete logic, based on sequents, for proving termination-observational congruences between simply-typed terms without constants is developed ...
Familiar &equational reasoning on A-terms is un- sound for proving observational congruences when ter- mination of the standard lazy interpreter is taken ...
A complete logic, based on sequents, for proving termination-observational congruences between simply-typed terms without constants is developed and it is ...
Strictness Analysis Algorithms Based on an Inequality System for Lazy ...
link.springer.com › chapter
We propose an inequality system for lazy types, from which two algorithms for strictness analysis are extracted. The key idea is elimination of the transitive ...
One of the strengths of lazy clause generation is the use of equality, disequality and inequality literals in explanations and nogoods. This can make ...
Apr 14, 2008 · We propose an inequality system for lazy types, from which two algorithms for strictness analysis are extracted. The key idea is elimination of ...
May 28, 2024 · We propose Lisa, a lazy alignment that constrains the model iterates to be proximal to the last round switching point.
Narrowing is an important method for solving unification problems in equational theories that are presented by confluent term rewriting systems.
Missing: inequalities | Show results with:inequalities
It is motivated by, and leads to a completeness theorem for, the logic of pure, typed "lazy" lambda-calculus, when not just integers, but termination--even of ...