Higher-order matching for program transformation
From MaRDI portal
Recommendations
Cites work
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- A restricted form of higher-order rewriting applied to an HDL semantics
- A transformation-based optimiser for Haskell
- Efficient second-order matching
- Higher-order unification via combinators
- Higher-order unification, polymorphism, and subsorts
- scientific article; zbMATH DE number 2185677 (Why is no real title available?)
- scientific article; zbMATH DE number 176135 (Why is no real title available?)
- scientific article; zbMATH DE number 1223619 (Why is no real title available?)
- scientific article; zbMATH DE number 1761878 (Why is no real title available?)
- More efficient bottom-up multi-pattern matching in trees
- Program development by specification and transformation. The PROSPECTRA methodology, language family, and system
- Proving and applying program transformations expressed with second-order patterns
- The Clausal Theory of Types
- The promotion and accumulation strategies in transformational programming
Cited in
(10)- Deterministic second-order patterns
- A survey of strategies in rule-based program transformation systems
- scientific article; zbMATH DE number 1696596 (Why is no real title available?)
- A survey of rewriting strategies in program transformation systems
- Algebra of Programming Using Dependent Types
- Higher-order Transformations and Type Simulations
- scientific article; zbMATH DE number 1738298 (Why is no real title available?)
- A matching process modulo a theory of categorical products
- Logic for Programming, Artificial Intelligence, and Reasoning
- Logic Based Program Synthesis and Transformation
This page was built for publication: Higher-order matching for program transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958614)