34 search results - page 5 / 7 » A Complete Narrowing Calculus for Higher-Order Functional Lo... |
112
click to vote
ENTCS
2007
15 years 3 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
174
click to vote
ALP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
124
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
105
click to vote
CADE
2006
Springer
16 years 3 months ago
2006
Springer
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
123
click to vote
ESOP
2012
Springer
13 years 11 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...