A restricted form of higher-order rewriting applied to an HDL semantics

DOI10.1007/3-540-59200-8_66zbMath1503.68091OpenAlexW1513375020MaRDI QIDQ5055839

Richard J. Boulton

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_66

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

Higher-order matching for program transformation

Uses Software

• ML
• HOL

Cites Work

• Unnamed Item
• Unnamed Item
• A unification algorithm for typed \(\overline\lambda\)-calculus
• Proving and applying program transformations expressed with second-order patterns
• A logic programming language with lambda-abstraction, function variables, and simple unification
• Decidable higher-order unification problems
• A formulation of the simple theory of types
• Higher-order unification, polymorphism, and subsorts
• The Clausal Theory of Types

This page was built for publication: A restricted form of higher-order rewriting applied to an HDL semantics