Filters








53,322 Hits in 3.2 sec

Scoped Dynamic Rewrite Rules

Eelco Visser
2001 Electronical Notes in Theoretical Computer Science  
This paper addresses the second problem by extending rewriting strategies with scoped dynamic rewrite rules.  ...  Dynamic rules are generated at run-time and can access variables available from their definition context. Rules generated within a rule scope are automatically retracted at the end of that scope.  ...  Dynamic Rules This paper introduces the extension of rewriting strategies with scoped dynamic rules.  ... 
doi:10.1016/s1571-0661(04)00298-1 fatcat:tvher55swbgwplbvrl7rth6n6u

Composing Source-to-Source Data-Flow Transformations with Rewriting Strategies and Dependent Dynamic Rewrite Rules [chapter]

Karina Olmos, Eelco Visser
2005 Lecture Notes in Computer Science  
Data-flow facts are propagated using dynamic rewriting rules.  ...  In particular, we introduce the concept of dependent dynamic rewrite rules for modeling the dependencies of data-flow facts on program entities such as variables.  ...  Rewriting Strategies and Dynamic Rules In this section we show how rewriting strategies in combination with dynamic rewrite rules can be used to compose data-flow transformations on abstract syntax trees  ... 
doi:10.1007/978-3-540-31985-6_14 fatcat:aikscmbzhjegdngska4qfnnz3e

Formalization and abstract implementation of rewriting with nested rules

Sergio Antoy, Stephen Johnson
2004 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '04  
This paper formalizes term rewriting systems (TRSs), called scoped, in which a rewrite rule can be nested within another rewrite rule.  ...  Nesting of rewrite rules is intended to define a lexical scope with static binding.  ...  A notion of scoped dynamic rewrite rule is proposed in [20] .  ... 
doi:10.1145/1013963.1013981 dblp:conf/ppdp/AntoyJ04 fatcat:hqet6t7l2jexncnrmgds6xmez4

All about the with statement in JavaScript

Changhee Park, Hongki Lee, Sukyoung Ryu
2013 Proceedings of the 9th symposium on Dynamic languages - DLS '13  
Even though the rewriting process is not applicable to any dynamically generated with statements, our results are still promising.  ...  We show that we can rewrite all the static occurrences of the with statement that do not have any dynamic code generating functions.  ...  Rewriting rules. Figure 7 presents our rewriting rules for the abstract syntax in Figure 6 .  ... 
doi:10.1145/2508168.2508173 dblp:conf/dls/ParkLR13 fatcat:2fpf675dp5an3lmdiarbkxekv4

From Rogue to MicroRogue

Aaron Stump, Ryan Besand, James C. Brodman, Jonathan Hseu, Bill Kinnersley
2005 Electronical Notes in Theoretical Computer Science  
MicroRogue rewrites terms using a global set of first-order rules. Rules can be enabled, disabled, and dynamically added in scopes, which can be pushed and popped.  ...  The rewriting is explicit, in the sense that rules must be applied explicitly to terms to transform them. This paper begins with an imperative version of the Rewriting Calculus called Rogue.  ...  suggestions on a previous draft of the paper, and to Horatiu Cirstea, Germain Fauré, Claude Kirchner, Luigi Liquori, Benjamin Wack, and other members of the PROTHEO team for many excellent discussions on the Rewriting  ... 
doi:10.1016/j.entcs.2004.06.028 fatcat:jy5spqwif5a5vcddqkb6kufzcu

Semantics Driven Disambiguation: A Comparison of Different Approaches

Akim Demaille, Renaud Durlin, Nicolas Pierron, Benoît Sigoure
2009 Electronical Notes in Theoretical Computer Science  
We evaluate three approaches to write disambiguation filters for SDF grammars: algebraic equations with ASF, rewrite-rules with programmable traversals for Stratego, and attribute grammars with TAG (Transformers  ...  To evaluate modularity, the grammar is layered: it starts with a small core language, and several layers add new features, new production rules, and new ambiguities.  ...  The rule is scoped (with '{|' and '|}'): all dynamic rules named use created inside this strategy will be discarded at the end of the strategy.  ... 
doi:10.1016/j.entcs.2009.09.043 fatcat:dqj2f76nnjcfpczjkh7dmgnru4

Program Transformation with Stratego/XT [chapter]

Eelco Visser
2004 Lecture Notes in Computer Science  
Stratego is based on the paradigm of rewriting under the control of programmable rewriting strategies.  ...  This chapter gives an overview of the main ingredients involved in the composition of transformation systems with Stratego/XT, where we distinguish the abstraction levels of rules, strategies, tools, and  ...  Scoped dynamic rewrite rules allow the run-time generation of rewrite rules encapsulating context information (Section 8).  ... 
doi:10.1007/978-3-540-25935-0_13 fatcat:5d55spl7hvgrbcy2uai7ccbm44

A graph-based operational semantics for context-oriented programming

Hans Schippers, Tim Molderez, Dirk Janssens
2010 Proceedings of the 2nd International Workshop on Context-Oriented Programming - COP '10  
The semantics consists of a number of graph rewrite rules which can be applied to sample graphs using the AGG tool.  ...  By representing context-oriented programs in this manner, the delMDSOC rewrite rules are capable of describing the semantics of dynamically scoped layer activation and hence (a avor of) context-oriented  ...  The latter consists of a number of graph rewrite rules which describe the dynamics of a delegation-based message sending system.  ... 
doi:10.1145/1930021.1930027 dblp:conf/ecoop/SchippersMJ10 fatcat:ln54bgsxlrhyra7d3xbt4rdgzu

Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic [chapter]

Nasreddine Aoumeur, Gunter Saake
2002 Lecture Notes in Computer Science  
Moreover, by equipping such integration with an intrinsically concurrent and operational semantics, namely rewriting logic, we also provide validation by rapid-prototyping using Maude implementations.  ...  explicit distinction between local features and observed ones in (the enriched) class-diagrams which offers a clean separation between intraand inter-class-diagram reasoning; and (2) a full exploitation of rewriting  ...  That is, each operation or message dynamics is captured by a corresponding rewrite rule.  ... 
doi:10.1007/3-540-47961-9_22 fatcat:crtbvcwkjnhf3egcrcvgzkifae

Tradeoffs in retrofitting security

Mark Samuel Miller
2007 Proceedings of the 2007 symposium on Dynamic languages - DLS '07  
 JSON, ADsafe, Pthin Dynamic restrictions, rewriting  Object-grain  Dynamically substituted scope, rewriting  Virtualized Libraries  Caja Example: foo.bar A B C  ...  restrictions, rewriting  W7, Oz-E, CaPerl, Caja, FBJS?  ... 
doi:10.1145/1297081.1297082 dblp:conf/dls/Miller07 fatcat:momorzfz5batpnqtieezxwaypi

Aspects as Modular Language Extensions

Eric Van Wyk
2003 Electronical Notes in Theoretical Computer Science  
Our model of extensible languages is based on higher-order attribute grammars and an extension called "forwarding" that mimics a simple rewriting process.  ...  The rewrite rules are created at compile time from the aspect declarations in the object program and a standard inherited environment attribute provides a convenient mechanism to move in-scope rewrite  ...  1 t 1 →case m 2 of NoMatch → NoMatch Static s 2 → Dynamic(s 1 + s 2 ) t 1 Dynamic s 2 t 2 → Dynamic(s 1 + s 2 ) (andExpr t 1 t 2 ) Generating rewrite rules Recall that the advice code and possibly the  ... 
doi:10.1016/s1571-0661(05)82628-3 fatcat:yummg26rnnclxnxrd6aahn5bde

Code generation by model transformation: a case study in transformation modularity

Zef Hemel, Lennart C. L. Kats, Danny M. Groenewegen, Eelco Visser
2009 Journal of Software and Systems Modeling  
The normalization strategy has a simple extension interface and integrates non-local, context-sensitive transformation rules.  ...  This approach enables the transformation of code after generation, which in turn enables the extension of the target language with features that allow better modularity in code generation rules.  ...  To ensure that the rule is only applied in the lexical scope of its declaration, the dynamic rule is scoped 40 . The TypeOf rule, on the other hand, is not scoped.  ... 
doi:10.1007/s10270-009-0136-1 fatcat:pyapirp4rfh3tcr3iwli7pfufe

Modular and automated type-soundness verification for language extensions

Florian Lorenzen, Sebastian Erdweg
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
Our formalism then validates that the user-defined type rules are sufficient to guarantee that the code generated by the translation rules cannot contain any type errors.  ...  To build a type-sound language extension with our formalism, a developer declares an extended syntax, type rules for the extended syntax, and translation rules into the (possibly further extended) base  ...  x Figure 8 . 8 SugarFomega verification procedure for type rules. scoped rewrite rules [2] to activate axioms dynamically.  ... 
doi:10.1145/2500365.2500596 dblp:conf/icfp/LorenzenE13 fatcat:i7r7qdag5fazfekepe5ts52oym

Modular and automated type-soundness verification for language extensions

Florian Lorenzen, Sebastian Erdweg
2013 SIGPLAN notices  
Our formalism then validates that the user-defined type rules are sufficient to guarantee that the code generated by the translation rules cannot contain any type errors.  ...  To build a type-sound language extension with our formalism, a developer declares an extended syntax, type rules for the extended syntax, and translation rules into the (possibly further extended) base  ...  x Figure 8 . 8 SugarFomega verification procedure for type rules. scoped rewrite rules [2] to activate axioms dynamically.  ... 
doi:10.1145/2544174.2500596 fatcat:nyxnciexlnhc3mjb47bjtuwg2y

Trustworthy Refactoring via Decomposition and Schemes: A Complex Case Study

Dániel Horpácsi, Judit Kőszegi, Zoltán Horváth
2017 Electronic Proceedings in Theoretical Computer Science  
By using our strategic rewriting based refactoring specification language, we present the decomposition of a complex transformation into smaller steps that can be expressed as instances of refactoring  ...  Furthermore, Bravenboer and Olmos show that by adding dynamically defined rewrite rules into the system [1] , context-dependent transformations [13] are also definable.  ...  Both define the syntactic construct creating the binding, determine the place (the scope) of the binding, and they also specify the rewrite rule that will transform the target expression to use the newly  ... 
doi:10.4204/eptcs.253.8 fatcat:avvygyrjxnezflpgvnsdery2u4
« Previous Showing results 1 — 15 out of 53,322 results