Results 1  10
of
10
Lazy rewriting on eager machinery
 ACM Transactions on Programming Languages and Systems
, 2000
"... The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behaviour of a term rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives a ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
The article introduces a novel notion of lazy rewriting. By annotating argument positions as lazy, redundant rewrite steps are avoided, and the termination behaviour of a term rewriting system can be improved. Some transformations of rewrite rules enable an implementation using the same primitives as an implementation of eager rewriting. 1
Cones and Foci for Protocol Verification Revisited
 In Proc. 6th Conference on Foundations of Software Science and Computation Structures, LNCS 2620
, 2003
"... Abstract. We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
(Show Context)
Abstract. We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is more generally applicable, and does not require a preprocessing step to eliminate τloops. We prove soundness of our approach and give an application. 1
Within ARM's Reach: Compilation of LeftLinear Rewrite Systems via Minimal Rewrite Systems
, 1997
"... A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A new compilation technique for leftlinear term rewriting systems is presented, where rewrite rules are transformed into socalled minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM).
Compiling a functional logic language: The basic scheme
 In Proceedings of the Eleventh International Symposium on Functional and Logic Programming
, 2012
"... Abstract. We present the design of a compiler for a functional logic programming language and discuss the compiler’s implementation. The source program is abstracted by a constructor based graph rewriting system obtained from a functional logic program after syntax desugaring, lambda lifting and sim ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We present the design of a compiler for a functional logic programming language and discuss the compiler’s implementation. The source program is abstracted by a constructor based graph rewriting system obtained from a functional logic program after syntax desugaring, lambda lifting and similar transformations provided by a compiler’s frontend. This system is nondeterministic and requires a specialized normalization strategy. The target program consists of 3 procedures that execute graph replacements originating from either rewrite or pulltab steps. These procedures are deterministic and easy to encode in an ordinary programming language. We describe the generation of the 3 procedures, discuss the correctness of our approach, highlight some key elements of an implementation, and benchmark the performance of a proofofconcept. Our compilation scheme is elegant and simple enough to be presented in one page. 1
JustinTime: On Strategy Annotations
 Proc. of 1st International Workshop on Reduction Strategies in Rewriting and Programming, WRS'01
, 2001
"... A simple kind of strategy annotations is investigated, giving rise to a class of strategies, including leftmostinnermost. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
A simple kind of strategy annotations is investigated, giving rise to a class of strategies, including leftmostinnermost.
Cones and foci: A mechanical framework for protocol verification
, 2006
"... We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generall ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld, our method is more generally applicable, because it does not require a preprocessing step to eliminate τloops. We prove soundness of our approach and present a set of rules to prove the reachability of focus points. Our method has been formalized and proved correct using PVS. Thus we have established a framework for mechanical protocol verification. We apply this framework to the Concurrent Alternating Bit Protocol.
Remarks on Thatte's Transformation of Term Rewriting Systems
"... We carry out a detailed analysis of Thatte's transformation of term rewriting systems. We refute an earlier claim that this transformation preserves con°uence for weakly persistent systems. We prove the preservation of weak normalization, and of con°uence in weakly normalizing systems and in n ..."
Abstract
 Add to MetaCart
(Show Context)
We carry out a detailed analysis of Thatte's transformation of term rewriting systems. We refute an earlier claim that this transformation preserves con°uence for weakly persistent systems. We prove the preservation of weak normalization, and of con°uence in weakly normalizing systems and in nonoverlapping systems with linear subtemplates. We conclude by proving that weak persistence is an undecidable property of term rewriting systems. 1
ABSTRACT Cones and Foci for Protocol Verification Revisited
, 2002
"... CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ..."
Abstract
 Add to MetaCart
(Show Context)
CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.
Compilation of LeftLinear Rewrite Systems via Minimal Rewrite Systems
, 1997
"... and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of ..."
Abstract
 Add to MetaCart
(Show Context)
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
Compiling a Functional Logic Language: The Fair Scheme
, 2013
"... Abstract. We present a compilation scheme for a functional logic programming language. The input program to our compiler is a constructorbased graph rewriting system in a nonconfluent, but wellbehaved class. This input is an intermediate representation of a functional logic program in a language ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We present a compilation scheme for a functional logic programming language. The input program to our compiler is a constructorbased graph rewriting system in a nonconfluent, but wellbehaved class. This input is an intermediate representation of a functional logic program in a language such as Curry or T OY. The output program from our compiler consists of three procedures that make recursive calls and execute both rewrite and pulltab steps. This output is an intermediate representation that is easy to encode in any number of programming languages. Our design evolves the Basic Scheme of Antoy and Peters by removing the “left bias ” that prevents obtaining results of some computations—a behavior related to the order of evaluation, which is counter to declarative programming. The benefits of this evolution are not only the strong completeness of computations, but also the provability of nontrivial properties of these computations. We rigorously describe the compiler design and prove some of its properties. To state and prove these properties, we introduce novel definitions of “need ” and “failure.” For nonconfluent constructorbased rewriting systems these concepts are more appropriate than the classic definition of need of Huet and Levy.