113 search results - page 8 / 23 » Reduction Strategies for Left-Linear Term Rewriting Systems |
POPL
1994
ACM
15 years 4 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
108
click to vote
PLILP
1993
Springer
15 years 4 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
122
Voted
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
98
Voted
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
101
click to vote
ICTAC
2004
Springer
15 years 5 months ago
2004
Springer
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...