Higher-order matching for program transformation

DOI10.1016/S0304-3975(00)00402-3zbMath0983.68020MaRDI QIDQ5958614

Oege de Moor, Ganesh Sittampalam

Publication date: 3 March 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

automatic program transformation

Mathematics Subject Classification ID

Theory of programming languages (68N15) General topics in the theory of software (68N01)

Related Items (4)

Algebra of Programming Using Dependent Types ⋮ A survey of strategies in rule-based program transformation systems ⋮ Deterministic second-order patterns ⋮ A Survey of Rewriting Strategies in Program Transformation Systems

Uses Software

• ELAN
• Haskell

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A transformation-based optimiser for Haskell
• Higher-order unification via combinators
• The promotion and accumulation strategies in transformational programming
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• A restricted form of higher-order rewriting applied to an HDL semantics
• Efficient second-order matching
• Higher-order unification, polymorphism, and subsorts
• The Clausal Theory of Types

This page was built for publication: Higher-order matching for program transformation