A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. ... Based on the observation that the only existing (non-trivial) approach to prove termination of such lazy rewrite systems is flawed, we develop a modified approach for transforming lazy rewrite systems ... However, for the termination analysis of lazy rewrite systems it is favorable to consider term rewriting instead of graph rewriting. ...doi:10.1016/j.entcs.2008.03.052 fatcat:lpgg7ivtcvgkxaamy4ti26f24m
We also introduce a transformation which allows us to prove the termination of the new evaluation strategy by using standard rewriting techniques. ... A positive index prescribes the evaluation of an argument whereas a negative index means "evaluation on-demand". These on-demand indices have been proposed to support laziness in OBJ-like languages. ... This provides a formal framework for proving the termination of lazy rewriting (LR). ...doi:10.1016/j.tcs.2009.09.016 fatcat:a3u6i6gz4bdz3dt6qasgxx2ivu
Tennent, Syntactic control of interference revisited (40 pp. (electronic)); Peter W. O’Hearn and Uday S. Reddy, Objects, in- terference, and the Yoneda embedding (28 pp. (electronic)); F. ... (elec- tronic)); Gerard Boudol and Cosimo Laneve, Termination, dead- lock and divergence in the A-calculus with multiplicities (14 pp. ...
We study the semantics of documents and queries, the confluence of computations, termination and lazy query evaluation. ... The increasing popularity of XML and Web services have given rise to a new generation of documents, called Active XML documents (AXML), where some of the data is given explicitly while other parts are ... If one rewriting does not terminate, no rewriting terminates and any fair rewriting produces the same infinite system. ...doi:10.1145/1055558.1055564 dblp:conf/pods/AbiteboulBM04 fatcat:63voe7kkibc4ljmdyne6y3lqsm
the whole class of the leftlinear constructor-based conditional rewrite systems. ... We address the differences between demand driven and lazy strategies and between narrowing strategies and narrowing calculi. ... Acknowledgement I am grateful to Eva Ullan and the anonymous reviewers for their comments and suggestions on the initial version of this paper. ...doi:10.1145/773184.773205 dblp:conf/ppdp/Antoy01 fatcat:wkoqhitlwrdhjmi56y2trarigm
Lecture Notes in Computer Science
A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. ... TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. ... Because lazy graph rewriting is expensive, and most of the time not needed, most of the lazy functional abstract machines have add-ons for innermost (strict) rewriting, making them more complicated than ...doi:10.1007/3-540-61629-2_48 fatcat:uwcaliae3jbedca2o5nmtdq4kq
The transition relation of K(R, k ) L Π is the one-step rewriting relation of R, to which a self-loop is added for each deadlocked state. ... To any rewrite theory R = (Σ, E , ϕ, R) we can associate a Kripke structure K(R, k ) L Π in a natural way provided we: (i) specify a kind k in Σ so that the set of states is defined as T Σ/E ,k , and ( ... Acknowledgments: We thank Alberto Verdejo and the referees for helpful comments on earlier versions of this paper. ...doi:10.1016/j.entcs.2004.06.015 fatcat:j267et2gtnhkhf7s77auw2hoaa
, AC-termination of rewrite systems: a modified Knuth-Bendix or- dering (pp. 372-386). ... , Termi- nation proofs by multiset path orderings imply primitive recursive derivation lengths (pp. 347-358); Ke Li, Optimization of rewrit- ing and complexity of rewriting (pp. 359-371); Joachim Steinbach ...
Term rewriting is a Turing complete model of computation. ... decision procedure for the first-order theory for a decidable class of rewrite systems. ... A TRS R is terminating if there is no infinite rewrite sequence t 0 → R t 1 → R t 2 → R · · · . Example 3.1. We revisit Example 1.1 from the introduction. ...doi:10.4204/eptcs.313.4 fatcat:4w6zppr4rnf4vi37qbrccomiey
Lecture Notes in Computer Science
Implementation of this model is open to optimizations. The present paper discusses two such optimizations: symbolic execution and lazy evaluation. ... They are inspired by rewrite systems: an XSLT is an ordered set of rules. ... The next section briefly revisits the middleware architecture in  and basic technologies it employs. Section 3 covers symbolic execution, while section 4 deals with lazy evaluation. ...doi:10.1007/3-540-45440-3_12 fatcat:prgaije6unbqrbkomvmtvqb6wa
Ferreira, Delia Kesner and Laurence Puel, Reducing AC-termination to termination (239- 247). ... Simpson, Lazy functional algorithms for ex- act real functionals (456-464); Klaus Ambos-Spies, Steffen Lempp and Gunther Mainhardt, Randomness vs. completeness: on the For the web version of Mathematical ...
We show that LIQUIDHASKELL is able to prove 96% of all recursive functions terminating, while requiring a modest 1.7 lines of termination-annotations per 100 lines of code. ... Unfortunately, the classical translation of refinement types to verification conditions is unsound under lazy evaluation. ... McMillan, Andrey Rybalchenko, Philip Wadler, and the reviewers for their excellent suggestions and feedback about earlier versions of this paper. ...doi:10.1145/2692915.2628161 fatcat:g3rt2hu3azafhfrni5jy4ziixu
We show that LIQUIDHASKELL is able to prove 96% of all recursive functions terminating, while requiring a modest 1.7 lines of termination-annotations per 100 lines of code. ... Unfortunately, the classical translation of refinement types to verification conditions is unsound under lazy evaluation. ... McMillan, Andrey Rybalchenko, Philip Wadler, and the reviewers for their excellent suggestions and feedback about earlier versions of this paper. ...doi:10.1145/2628136.2628161 dblp:conf/icfp/VazouSJVJ14 fatcat:k4x3nousrze5rfqyrcdn32awfa
We show that LIQUIDHASKELL is able to prove 96% of all recursive functions terminating, while requiring a modest 1.7 lines of termination-annotations per 100 lines of code. ... Unfortunately, the classical translation of refinement types to verification conditions is unsound under lazy evaluation. ... McMillan, Andrey Rybalchenko, Philip Wadler, and the reviewers for their excellent suggestions and feedback about earlier versions of this paper. ...doi:10.1145/2541568.2541569 dblp:conf/plpv/Jhala14 fatcat:7md5gsdqqbhlzlrvypu3ulyqte
The VLDB journal
Timestamping the results of a transaction with the commit time of the transaction is a promising approach. The paper studies how this timestamping may be done using a spectrum of techniques. ... However, with few exceptions, the assignment of timestamp values has been considered only in the context of individual modification statements. ... This research, conducted in part while the first author visited the University of Arizona, was supported in part by the Danish Technical Research Council through grant 9700780, by the CHOROCHRONOS project ...doi:10.1007/s007780050008 fatcat:hkt3qfqkaveyfmmfq2xgh3i5ae
« Previous Showing results 1 — 15 out of 1,201 results