Algebraic specification
Functional programming with bananas, lenses, envelopes and barbed wire
Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
PolyP—a polytypic programming language extension
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types and programming languages
Types and programming languages
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Java Virtual Machine Specification
Java Virtual Machine Specification
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Typed Combinators for Generic Traversal
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
A Strafunski Application Letter
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Monads for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
Merging Monads and Folds for Functional Programming
Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text
An Overview of HATS: A Language Independent High Assurance Transformation System
ASSET '99 Proceedings of the 1999 IEEE Symposium on Application - Specific Systems and Software Engineering and Technology
Term rewriting with traversal functions
ACM Transactions on Software Engineering and Methodology (TOSEM)
A transformational perspective into the core of an abstract class loader for the SSP
ACM Transactions on Embedded Computing Systems (TECS)
Model-driven Transformation-based Generation of Java Stress Tests
Electronic Notes in Theoretical Computer Science (ENTCS)
Generative programming techniques for Java library migration
GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
A higher-order strategy for eliminating common subexpressions
Computer Languages, Systems and Structures
More precise typing of rewrite strategies
Proceedings of the Eleventh Workshop on Language Descriptions, Tools and Applications
Program transformation using HATS 1.84
GTTSE'05 Proceedings of the 2005 international conference on Generative and Transformational Techniques in Software Engineering
Programming errors in traversal programs over structured data
Science of Computer Programming
| Hi-index | 0.00 |
The distributed data problem is characterized by the desire to bring together semantically related data from syntactically unrelated portions of a term. A strategic combinator called transient and a strategic constant called skip are introduced in the context of a higher-order strategic framework. The notion of traversal is lifted to the higher order as well. The resulting framework allows the manipulation of data to be expressed directly in strategic terms. The impact of this dynamic approach to strategy creation is then explored for several instances of the distributed data problem. Problems considered include three strategic benchmarks as well as two transformations that arise within a class loader for the Java virtual machine.