Searched: RULE[^A-Za-z]
Results from BX12 web
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
We are proud to feature the following two invited talks: Juan de Lara (Autonomous University of Madrid, Spain): Bidirectional Transformations with Graphical Constraints ...
to be announced
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 6
Results from Book web
Previous Up Next Introduction In the previous chapter we saw that pure term rewriting is not adequate for term rewriting because of the lack of control over the application ...
Previous Up Next Introduction So far we have assumed the basic actions applied by strategies are rewrite rules. However, taking a closer look at rules, we see that ...
Previous Up Introduction The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the context ...
Number of topics: 3
Results from GPCE06 web
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 1
Results from GPCE08 web
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 1
Results from Gpce web
The International Conference on Generative Programming and Component Engineering (GPCE) Bylaws Organizational Goals Program generation techniques have the potential ...
The International Conference on Generative Programming and Component Engineering (GPCE) Bylaws Aim Program generation techniques have the potential to revolutionize ...
Number of topics: 2
Results from Gpce04 web
CALL FOR TUTORIAL PROPOSALS INCLUDE{ConferenceHeader} Tutorial Chair Jeff Gray, University of Alabama at Birmingham (tutorials04@gpce.org) Important Dates Proposal ...
Number of topics: 1
Results from Gpce05 web
CALL FOR TUTORIAL PROPOSALS INCLUDE{ConferenceHeader} Tutorial Chairs Andrew Malton, University of Waterloo Jeff Gray, University of Alabama at Birmingham Tutorial ...
Number of topics: 1
Results from HART14 web
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
We are proud to feature an invited talk by Oleg Kiselyov!
to be announced
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 6
Results from IPA06 web
TOC Getting Started To start a proper shell and initialize your path, run the following commands. ( martin is on purpose. Don't change the username to your own account ...
Number of topics: 1
Results from Main web
Name: Arthur van Dam Email: adam@cs.uu.nl Personal homepage: http://www.eye-home.net Research homepage: http://arthur.van-dam.net/twiki/ Country: Netherlands Main ...
Name: Dhinakar Jacob Email: dhinakarjacob@yahoo.com Homepage: http://www.geocities.com/dhinakarjacob Country: India Comment: Reverse Engineering, Business Rule Extraction ...
Name: Eelco Visser Email: visser@cs.uu.nl Affiliation: Utrecht University Country: Netherlands Homepage URL: http://www.cs.uu.nl/~visser Other TWiki homepages Stratego ...
Number of topics: 3
Results from PEPM07 web
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
Call For Papers ACM SIGPLAN 2007 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'07) Nice, France January 15-16, 2007 (Co-located with POPL 2007) http ...
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 4
Results from PEPM08 web
The following papers have been accepted for presentation at the workshop (in no particular order): Jakob Puchinger and Peter Stuckey. Automating Branch-and-Bound ...
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
Call For Papers ACM SIGPLAN 2008 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'08) Nice, France January 7-8, 2008 (Co-located with POPL 2008) http ...
Monday, January 7, 2008 Opening: 8:45 9:00 Invited Talk 1: 9:00 10:00 Session Chair: Oege de Moor Monica Lam: Combining Static and Dynamic Analysis for Securing ...
Monday, January 7, 2008 Opening: 8:45 9:00 Invited Talk 1: 9:00 10:00 Ras Bodik. Program Synthesis by Sketching. Coffee break Session 1: 10:30 12:00 (Staging and ...
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 7
Results from PEPM10 web
The following papers (in no particular order) will be presented at the workshop. Regular research papers: Christopher Brown and Simon Thompson. Clone Detection and ...
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
to be announced
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 7
Results from PEPM11 web
The following papers (in no particular order) will be presented at the workshop. Regular research papers: Torben Mogensen. Partial Evaluation of the Reversible Language ...
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
to be announced
The PEPM Symposium/Workshop series aims to bring together researchers and practitioners working in the areas of program transformation and generation. For PEPM 2006 ...
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 7
Results from PEPM12 web
The following papers (in no particular order) will be presented at the workshop. Regular research papers: Naoki Kobayashi, Kazutaka Matsuda and Ayumi Shinohara. Functional ...
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
to be announced
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 5
Results from PEPM13 web
The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
Call For Papers ACM SIGPLAN 2010 Workshop on PARTIAL EVALUATION AND PROGRAM MANIPULATION (PEPM'10) Madrid, Spain January, 2010 (Co-located with POPL 2010) http:/ ...
to be announced
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 5
Results from PEPM14 web
The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program ...
C A L L F O R P A P E R S P E P M 2014 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM14 January 20 ...
to be announced
What should a tutorial look like? In case your tutorial is accepted, the following offers suggestions for preparing and presenting your tutorial. 1. Contents When ...
Number of topics: 5
Results from Sandbox web
Super Scalar Sample Sort This is a paper I wrote for ETH, I thought I might as well publish it here Introduction Abstract The Sample Sort Algorithm How it works The ...
Number of topics: 1
Results from Sdf web
The SDF parser (SGLR) reads a file that contains the parse table. The format for this file and its implementation is a part of the SDF bundle. This part is called ...
Number of topics: 1
Results from Spoofax web
Updates of Spoofax cause Eclipse to time out; why? Due to a known problem with the combination of Eclipse 3.7, Java 1.7, and Windows, the update manager can be very ...
Refactorings Spoofax helps you to enrich your editor with refactorings. You can find the refactorings in the context menu of the file being edited. http://strategoxt ...
This page provides a tour of the different features of Spoofax. For additional supporting material and documentation, visit our page. For a quick overview of features ...
Number of topics: 3
Results from Stratego web
An rewrite rule is a rule that can be used inside a stategy expression. An anonymous rewrite rule of the form: \ p1 p2 where s \ is desugared to {x1, ..., xn : ?p1 ...
Aster is an attribute grammar system based on Stratego. It makes use of the standard Stratego facilities such as matching and syntax to specify attribute equations ...
Success and failure in Stratego allows one to avoid computing with Boolean values all the time. However, sometimes it is necessary to capture the failure (or success ...
Karl Trygve Kalleberg and Eelco Visser. Combining Aspect-Oriented and Strategic Programming . RULE 2005. In H. Cirstea and N. Martí-Oliet, editors, Proceedings of ...
A term consisting of a constructor C and subterms ti: C(t1, t2, ..., tn) defines a congruence operator C(s1, s2, ..., sn) This is an operator that first matches a ...
TOC Description A contextual rule is a rule in which the left-hand side and right-hand side terms contain contexts of the form x t . A typical example of a contextual ...
Each rule or strategy applies to an implicit subject term. See versus strategies for a discussion. Visser 13 May 2003 The implicit current subject term is related ...
A dynamic rule is an ordinary RewriteRule that is generated at run-time. A dynamic rule can inherit bindings of variables from its generation context. Dynamic rules ...
rules allow the run-time addition of rewrite rules. This can be used to model context-sensitive rewriting and has a host of applications in program transformation ...
This page collects references to language constructs in other languages that have some commonalities with dynamic rewrite rules. Dynamically Scoped Variables in Lisp ...
We're currently rethinking the concept of dynamic rules; quite some changes are at stake. This topic collects some of our reasoning on behaviour and implementation ...
Ideas for improving the error reporting of the StrategoCompiler. Feel free to add more ideas. check import graph: operators used in a module should be visible through ...
A. van Dam. Extending Dynamic Rules. An Application-Oriented Study into Stratego's new Dynamic Rules. Master's thesis, Utrecht University, Utrecht, The Netherlands ...
TOC Installation Q: I get errors when compiling Stratego programs or when running compiled Stratego programs. A: If you've carefully followed the instructions and ...
15 Mar 2007 - 04:01 - NEW
Eric Bouwers, Martin Bravenboer, and Eelco Visser. Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking. In Proceedings of LDTA'07, ...
TOC Introduction The Stratego/XT Grammar Engineering Tools is a collection of tools for the recovery, development, testing, and maintenance of grammars. Currently ...
HSX: A Framework for Haskell Transformation Note that this was the second Stratego project and probably not up-to-date with modern Stratego programming practices ...
Good layout is important for the readability and hence maintainability of programs. This holds for any programming language. Stratego aims at not only providing a ...
Naming conventions are important in any platform. If the naming conventions are followed in the library and by the developers of a project, you can remember the name ...
A term is in normal form if no rule applies anywhere within the term. This implies that rules are applied everywhere in a term. This is not always appropriate. In ...
Abstracting over Term Patterns with Overlays Overlays are abstractions over term patterns that can be used just like ordinary term constructors. Overlays can be used ...
This page contains plans for past releases. See ReleasePlan for planning of future releases. StrategoXT 0.9.3 released September 1, 2003 New names for si and sc : ...
M. Bravenboer, A. van Dam, K. Olmos, and E. Visser. Program Transformation with Scoped Dynamic Rewrite Rules. Fundamenta Informaticae, 69:1--56, 2005. (techrep) Abstract ...
After GPCE/OOPSLA in Vancouver Tijs van der Storm challenged me to write a Stratego program that prints its own source. So I set to work, with the following result ...
Description The design of Stratego specifications can be improved by Transform.ReFactoring. Here is a list of refactorings. Please add to the list if you use missing ...
This page provides the tentative scheduling for future releases of StrategoXT. See PastReleases for an overview of the development of StrategoXT. Note that except ...
Some/many rules can be used both ways. For example, in propositional logic we have A10 : Impl(x, y) Or(Not(x), y) A11 : Or(Not(x), y) Impl(x, y) It would be more ...
A rewrite rule has the form Lab : l r where s where Lab is the label or name of the rule, l is the left-hand side term pattern, r the right-hand side term pattern ...
A rewriting strategy is an algorithm for transforming a term with respect to a set of rules. Some rewriting strategies are normalizing strategies, i.e., rewrite a ...
In stratego all information is represented as a ATerm. An ATerm can be thought of as a structured tree-like representation of the information that needs to be transformed ...
Stratego provides scope constructs for several types of data. The variable scope {x1,...,xn:s} delimits the scope of bindings to the term variables xi to the strategy ...
E. Visser. Scoped dynamic rewrite rules. In M. van den Brand and R. Verma, editors, Rule Based Programming (RULE'01), volume 59/4 of Electronic Notes in Theoretical ...
A pragmatic approach to separate compilation has been introduced in StrategoRelease094. A module can be compiled as a library which results in a single C program containing ...
You insist on the importance of separation of concerns, in particular in separation between rules and strategies, so that rules become basic strategies on top of ...
Alan van Dam. Simplifying the Simplifier. HsOpt: a modular, rewrite rule based simplifier for the Helium compiler, a non-strict functional compiler. Institute of Information ...
by Transform.BasLuttik and Main.EelcoVisser In Alex Sellink (editor) Proceedings of the 2nd International Workshop on the Theory and Practice of Algebraic Specifications ...
Strategic Pattern Matching is a paper about extending standard first-order term pattern matching using strategies to define complex patterns. Specifically it describes ...
30 May 2003 - 10:41 - NEW
E. Visser. Stratego: A language for program transformation based on rewriting strategies. System description of Stratego 0.5. In A. Middeldorp, editor, Rewriting Techniques ...
StrategoBox is a syntax defintion for using ConcreteSyntax for the Tools.BoxLanguage inside the StrategoLanguage. With StrategoBox you can write powerful PrettyPrinters ...
Upcoming STARTINCLUDE 2009-06-16 Code Generation 2009 tutorial on Creating Domain-Specific Languages with Stratego/XT. STOPINCLUDE Past 2008-10-21 OOPSLA 2008 talk ...
This page provides an alphabetic glossary of terminology in the language. It is not complete nor finished. Feel free to add an entry or to improve an existing entry ...
Since its always interesting to see how ideas develop, this page contains a reconstruction of the development of StrategoLanguage and its implementation. March 1997 ...
INCLUDE{WebNotice} Stratego is a small and efficient domain-specific language for program transformation. It is based on the paradigm of programmable rewriting strategies ...
This is an overview of topics covering the various constructs in the language. This is a subset of the glossary, which also lists concept, advice, design and tool ...
INCLUDE{WebNotice} Full bibliography of Stratego Bibliography of Stratego/XT related publications at researchr by year and type strategoxt.bib Overview transformation ...
Released May 10, 2004 Download See the installation instructions if you are not familiar with the standard installation procedure of tarballs or RPMs. Source tar.gz ...
Issues fixed in StrategoXT 0.10 Bug STR-8 Scopes and Undefined are reserved terms STR-10 Incorrect variable unbound error when using the ( ) construct STR-11 Unbound ...
Resolved Issues for StrategoXT 0.11 Bug STR-7 pack-sdf fails with the message ERROR: Module Java.sdf not found if sglr does not exist STR-52 Illegal C code for mutual ...
Released October 04, 2004 Download See the installation instructions if you are not familiar with the standard installation procedure of tarballs or RPMs. Source tar ...
Issues closed and resolved in StrategoXT 0.12 Bug STR-90 sdf2rtg (or maybe just pp-rtg) does not support quoted constructors STR-96 Generic application of dynamic ...
Stratego/XT 0.13 released January 13, 2005 Download See the installation instructions if you are not familiar with the standard installation procedure of tarballs ...
Stratego/XT 0.14 released May 9th, 2005 Download See the installation instructions if you are not familiar with the standard installation procedure of tarballs or ...
Stratego/XT 0.15 released July 5, 2005 This is an experimental release featuring a refactoring of the internals of the language definition and compiler. Please report ...
Release Notes Stratego/XT Version 0.15 (Stratego Core Compiler Experimental) Bug STR-220 syntax priority issue: 's1 STR-224 Term projection in annotations is broken ...
Stratego/XT 0.16 released November 4th, 2005 RED Warning: ENDCOLOR This release has known issues with recent GCC 4.x, GNU Make 3.81, Mac OS X, and operating systems ...
Release Notes Stratego/XT Version 0.16 (Stratego Core Compiler) Bug STR-14 Scoping problem at higher optimization levels STR-15 strc doesn't work if invoked with ...
Stratego/XT STRATEGOXTVERSION released August 31st, 2005 Download See the installation instructions if you are not familiar with the standard installation procedure ...
Stratego/XT 0.17 released July 2009 Known issues On 64 bit systems, parsing using SGLR (which is used in many Stratego programs) can result in SEGV due to limited ...
Release Notes Stratego/XT Version 0.17 Bug STR-248 implode-asfix: support AsFix2ME constructs STR-263 Extend ArgOption with default value argument STR-283 pp ...
Version 0.5 released: March 26, 2001 SUMMARY OF CHANGES (with respect to release 0.4.22) StrategoScript an interpreter for Stratego Syntax clean up Compiler and library ...
Changes since StrategoRelease053 Summary Dynamic rules: see ScopedDynamicRewriteRules paper Lots of improvements to the library (thanks Main.HedzerWestra and Main ...
See also StrategoRelease061 StrategoRelease062 StrategoRelease063 Stratego version 0.6 is available from www.stratego-language.org SUMMARY OF CHANGES (with respect ...
Stratego version 0.6.1 is available from http://www.stratego-language.org SUMMARY OF CHANGES (with respect to release StrategoRelease06) COMPILER Added compile time ...
Stratego version 0.6.2 is now available from StrategoDownload released: October 6, 2001 SUMMARY OF CHANGES (with respect to release 0.6) CONTRIBUTIONS Bug reports ...
Available from StrategoDownload New features TermWrap TermProject Release Announcement Version 0.6.3 released: November 26, 2001 SUMMARY OF CHANGES (with respect to ...
Stratego 0.6.4 is now available from http://www.stratego-language.org The release fixes a "fikse bug in Stratego!!" in the translation of Strategy Rules (rules of ...
Stratego/XT 0.9 released on January 26, 2003 Contents TOC Download Source distribution StrategoXT is built using the ATermLibrary, the SDF syntax definition formalism ...
StrategoXT 0.9.4 StrategoXT 0.9.4 released January 22, 2004 Download See the installation instructions if you are not familiar with the standard installation procedure ...
Tools in stratego-tools: Stratego Tools in StrategoXT 0.10 contains a new tool, pp-stratego-latex-alltt. This tool is useful for including Stratego code in publications ...
Strategies for Program Transformation Stratego Tutorial at ETAPS Full Day Tutorial on April 14, 2002 at Transform.ETAPS 2002 in Grenoble, France Handouts are now ...
A StrategyRule of the form Lab :: s1 s2 where s3 is syntactic sugar for a StrategyDefinition of the form Lab s1; where(s3); s2 StrategoRelease06 introduced a bug ...
Question: Is there any symbol table implementation in stratego? Yes. There are several ways to go about using symbol table like functionality in Stratego programs ...
Introduction Stratego uses terms to represent the abstract syntax of programs or documents. A term consists of a constructor and a list of argument terms. Sometimes ...
A transformation rule is a description of a single transformation step. Examples of transformation rules are constant folding beta reduction in the lambda calculus ...
Warm fusion is a program transformation technique for deforesting functional programs developed by John Launchbury and Tim Sheard. Warm fusion works by the cata/build ...
See also the WebChanges page. STARTINCLUDE 2010-05-28 Version 0.5 of the Spoofax Language Workbench has been released. Read the announcement on the main page. 2010 ...
Number of topics: 76
Results from Sts web
TXL solution to Chairmarks #4.5: Static slicing. This example implements backward static slicing using cascaded markup to a fixed point. Notes: In an implementation ...
TXL solution to Chairmarks #3.2, Common subexpression elimination. Thie simple example demonstrates the basics of common subexpression elimination at the statement ...
TXL solution to Chairmarks #4.6: Clone detection with consistent renaming. This example implements clone detection for clones of structured statements (if, while, ...
TXL solution to Chairmarks #3.4, Constant folding, recognize and resolve opportunities to fold constant expressions. Thie simple example demonstrates constant propagation ...
TXL solution to Chairmarks #2.3, Declarations-to-global, move all declarations from any nesting level to the global scope. Main.JamesCordy 02 Nov 2005 File "TILtoglobal ...
TXL solution to Chairmarks #2.4, Declarations-to-local, move all declarations to their most local location. Main.JamesCordy 02 Nov 2005 File "TILtolocal.Txl" TXL ...
TXL solution to Chairmarks #4.6: Clone detection. This example implements clone detection for exact clones of structured statements (if, while, for) in a TIL program ...
TXL solution to Chairmarks #2.1, declaring "for" statement to nondeclaring "for" statement. Main.JamesCordy 10 Oct 2005 File "TILfordeclare.Txl" TXL transformation ...
TXL solution to Chairmarks #2.2, transform all "for" statements to their equivalent "while" statement form. Main.JamesCordy 10 Oct 2005 File "TILfortowhile.Txl" ...
TXL solution to Chairmarks #2.5, Goto elimination, recognize and transform while-equivalent goto structures. Main.JamesCordy 31 Dec 2007 File "TILgotoelim.Txl" Goto ...
A more sophisticated TXL solution to Chairmarks #3.1, Move all invariant assigned computations outside of while loops. This is a more sophisticated version of Invariant ...
TXL solution to Chairmarks #3.1, Move all invariant assignments outside of while loops. This is a simple demonstration of the basics of data flow checking and code ...
TXL solution to Chairmarks #4.1: Removing redundant declarations. Main.JamesCordy 04 Jul 2006 File "TILredundant.Txl" TXL transformation to remove unused declarations ...
TXL solution to Chairmarks #4.3: Self-tracing program transformation. Main.JamesCordy 10 Oct 2005 File "TILtrace.Txl" Simple transform to make a Tiny Imperative ...
TXL solution to Chairmarks #3.5, Statement folding, recognizing and optimizing compile-time known if statements, and possibly while and for statements. Thie simple ...
TXL solution to Chairmarks #3.3, Strength reduction, recognize opportunities to reduce multiplication by an iterator to iterative addition. Thie simple example demonstrates ...
TXL solution to Chairmarks #4.7: Syntactic markup Marking up program statements or expressions with some structural property. This example demonstrates the use of ...
TXL solution to Chairmarks #5.1: A complete Imperative Language interpreter implemented as a standalone TXL source transformation. No other libraries or support modules ...
TXL solution to Chairmarks #4.4: Type inference. This example implements type inference for untyped variables in a TIL program and flags all type conflicts and ambiguous ...
Number of topics: 19
Results from TWiki web
DragonSkin installation This topic describes how to install !DragonSkin and perform some simple administrator-level (i.e. requiring the editing of template and CSS ...
TOC STARTINCLUDE # Appendix D: TWiki Development Timeline 01-Sep-2004 Release (Cairo) Major New Features Automatic upgrade script, and easier first-time installation ...
TWiki Topics TOC The basic building block of a TWiki site is called a topic , identified by a unique, hopefully descriptive, TWIKIWEB .WikiWord title. It may seem ...
To upgrade an earlier TWiki version like 01 Sep 1999 to version 01 May 2000 you should do the following things: Back up your system. Update the templates in the /templates ...
Table Plugin Gives extra control of table display: Allows sorting Changing table properties like border width, cell spacing and cell padding Changing background color ...
Text Formatting FAQ The most frequently asked questions about text formatting are answered. Also, TextFormattingRules contains the complete TWiki shorthand system ...
# TWiki Shorthand Basics If you can enter text, you're ready for TWiki. With a few simple, intuitive TextFormattingRules, you'll be able to use plain text to create ...
Number of topics: 7
Results from Tiger web
After allocation rule Finish puts the finishing touches to the body of a procedure by generating code for allocating the frame on entering the function and for deleting ...
Tiger Abstract Syntax This is the first set of HpcExercises that will teach you the structure of the abstract syntax of the TigerLanguage, the use of the StrategoCompiler ...
Translation to Intermediate Representation This is the second set of HpcExercises. These will teach you to write a more complex transformation (translation to IR ...
Implement translation of TigerAbstractSyntax expressions to IntermediateRepresentation code in module TAS2IR in the TigerTrans package. The TigerTrans package contains ...
Number of topics: 4
Results from Tools web
Description An asfix to asfix tool that reserves comments that were of the input source code by putting them in annotations of the AST. It is difficult to decide ...
This is one of the XT UserStories RECOVERING A SYNTAX DEFINITION FOR STRATEGO This directory contains a syntax definition in SDF2 of the Stratego language. This file ...
Summary Calculates conflicting patterns in an AST from an SDF syntax definition. Description sdf2ast-conflicts calculates a list of conflicting patterns in an AST ...
Introduction sdf2parenthesize generates a Stratego transformation tool that adds the necessary parentheses to an abstract syntax tree. The information is obtained ...
Number of topics: 4
Results from Transform web
A new revision of this paper is available under the title Survey of Strategies in Rule Based Program Transformation Systems. Main.EelcoVisser 12 Mar 2004 Main.EelcoVisser ...
E. Visser. A Survey of Strategies in Rule-Based Program Transformation Systems. Journal of Symbolic Computation, 40(1):831--873, 2005. Special issue on Reduction Strategies ...
BENEVOL 2004 2nd BElgium Netherlands Workshop on software EVOLution Location: UA, Antwerpen Date: July 8-9, 2004 Sponsors: Lunch and dinner are sponsored by the two ...
Homepage: http://www.semdesigns.com/Products/DMS/DMSToolkit.html DMSSoftwareReengineeringToolkit is a DesignMaintenanceSystem for software ReEngineering from SemanticDesigns ...
Homepages http://eelcovisser.org Stratego.EelcoVisser ProgramTransformation interests Taxonomy Systems Strategies Organization on Rule Based Programming ProgramTransformationOrg ...
The first workshop on this topic was very successful, resulting in the GenerativeModelTransformer project. A second workshop is scheduled for 27 October at OOPSLA ...
Cameron and Ito. Grammar-Based Definition of Metaprogramming Systems. ACM Transactions on Programming Languages and Systems Vol. 6, No. 1, January 1984, Pages 20-54 ...
Description Intentional programming developed at Microsoft Research Ait98 is a method for extending a language with new constructs or intentions . The meaning of ...
Description OPTIMIX is a specification language for the specification of optimizers based on graph rewriting developed by UweAssman at the University of Karlsruhe ...
Description OPTRAN LMW88 is a specification language for attributed tree transformation written by Reinhard Wilhelm at the University of Saarlandes in the early 1980 ...
Description of the language R++ from http://www.research.att.com/sw/tools/r++/ : R++ extends the C++ language with a single new programming construct the rule. In ...
Description Puma Grosch91 is the program transformation generator of the Coctail compiler toolkit. A Puma specification specifies a transformation of an abstract ...
Homepage: http://www.dsic.upv.es/~rdp03/ Federated Conference on Rewriting, Deduction and Programming (RDP) to be held in Valencia, Spain, in June 2003 Participating ...
WorkshopOnRuleBasedProgramming Submission: June Workshop: October 2002: http://www.program-transformation.org/rule02 2001: http://www.cwi.nl/~markvdb/RULE2001/ 2000 ...
Ralf Laemmel works at CWI and VU: http://www.cwi.nl/~ralf. Transformation topics: SCP Special Issue on Program Transformation http://homepages.cwi.nl/~ralf/pt-scp ...
A rewrite rule is a rule of the form lhs rhs where lhs and rhs are term patterns. It declares that any instance of lhs rewrites to the corresponding instance of rhs ...
The following papers have been accepted for the on Rule Based Programming 2002. A program will be available soon. Ralf Laemmel Towards Generic Refactoring Olivier ...
Definitions Here are some attempts at definitions of rule-based programming. Feel free to comment or add your own. The rule-based programming paradigm is characterized ...
Proceedings of the WorkshopOnRuleBasedProgramming 2002: to appear 2001: http://www.elsevier.nl/locate/entcs/volume59.html 2000: http://www.loria.fr/~ckirchne/ rule2000 ...
Program of the 2002 ACM SIGPLAN on Rule Based Programming (RULE'02) October 5, 2002, Pittsburgh, Pensylvania, USA. Time Title Authors 10:30 Design Patterns for Functional ...
Name of the workshop on Rule Based Programming (RULE) Associated with PPDP The goals of the workshop The rule-based programming paradigm is characterized by the repeated ...
EelcoVisser. Scannerless Generalized-LR parsing . Technical Report P9707, Programming Research Group, University of Amsterdam, July 1997. Online: http://www.cs.uu ...
Stephen F. Heffner entered the computer field in 1963 as a Customer Engineer for IBM. He has been involved in systems analysis, design, and programming since 1964 ...
TXL: Tree Transformation Language Homepage: http://www.txl.ca/ The TreeRewriting language TXL (developed by JamesCordy at Queen's University in Kingston, Canada) ...
Conferences and Workshops on Program Transformation Transform-based Events Events with their home page on this wiki. Feel free to use this wiki to host the webpage ...
A transformation rule is a description (in some formal language) of the transformation of (a part of) a program. Many formal languages for the description of transformation ...
Tree rewriting is a synonym for rewriting, i.e., the process of transforming trees (structured data) into other trees by applying rewriting rules. tree rewriting is ...
Homepage: http://www-sop.inria.fr/croap/personnel/Christophe.Roudet/TrfL/ TrfL is a rule based language designed for program transformations. For the end-user, TrfL ...
See also the announcements about specific systems in SystemNews. STARTINCLUDE STOPINCLUDE 2007-01-08 program-transformation.org is back online after absence for a ...
If the title you want is just one word, how can you "smash" it together? 1. You can add some other word(s). For example, instead of Z , use ZSpecificationLanguage ...
Description (from call for papers) Rule-based formalisms are ubiquitous in computer science, and even more so in constraint reasoning and programming. In constraint ...
2002 ACM SIGPLAN Workshop on Rule-Based Programming Workshop Program Satellite event of PLI'02 Saturday, October 5, 2002 Pittsburgh, USA http://www.program-transformation ...
Number of topics: 32
Results from WGLD web
This needs to be updated to the actual procedure that has emerged during the meetings. Eelco Visser Talks are 50 minutes long, split equally between the presenter ...
Number of topics: 1