13 search results - page 2 / 3 » A simple rewrite notion for call-time choice semantics |
PPDP
2005
Springer
13 years 10 months ago
2005
Springer
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
POPL
1995
ACM
13 years 8 months ago
1995
ACM
Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing s...
POPL
1994
ACM
13 years 9 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...
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
ENTCS
2006
13 years 5 months ago
2006
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are noto...