Typed generic traversal with term rewriting strategies
From MaRDI portal
Publication:1394988
DOI10.1016/S1567-8326(02)00028-0zbMath1026.68076WikidataQ57400623 ScholiaQ57400623MaRDI QIDQ1394988
Publication date: 25 June 2003
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Related Items
A survey of strategies in rule-based program transformation systems, Transformation of structure-shy programs with application to XPath queries and strategic functions
Uses Software
Cites Work
- A higher-order implementation of rewriting
- A functional theory of exceptions
- A theory of type polymorphism in programming
- IThe 2nd international workshop on rewriting logic and its applications, RWLW.. Abbaye des Prèmontrès at Pont-á-Mousson, France, September 1998
- Comparing cubes of typed and type assignment systems
- CASL: the Common Algebraic Specification Language.
- A calculus for overloaded functions with subtyping
- Intersection and union types: Syntax and semantics
- The rewriting calculus - part I
- Type dispatch for named hierarchical types
- Fusing Logic and Control with Local Transformations
- Functional Characters of Solvable Terms
- Dynamic typing in polymorphic languages
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- Building program optimizers with rewriting strategies
- Intensional polymorphism in type-erasure semantics
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
