1131 search results - page 72 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
90
Voted
ENTCS
2007
15 years 12 days 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...
140
click to vote
ALP
1997
Springer
15 years 4 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-...
PLDI
2010
ACM
15 years 9 months ago
2010
ACM
Synthesis of program fragments from specifications can make programs easier to write and easier to reason about. To integrate synthesis into programming languages, synthesis algor...
118
Voted
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
87
Voted
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...