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

DOI10.1007/3-540-59200-8_66zbMATH Open1503.68091OpenAlexW1513375020MaRDI QIDQ5055839FDOQ5055839

Authors: Richard 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

Recommendations

• Processes, Terms and Cycles: Steps on the Road to Infinity
• scientific article; zbMATH DE number 1552533
• A higher-order implementation of rewriting
• Higher-order rewrite systems and their confluence
• Publication:4938608
• A hypergraph rewriting language and its semantics
• Higher-Order Logic Programming Languages with Constraints: A Semantics
• A hierarchy of semantics for non-deterministic term rewriting systems
• scientific article; zbMATH DE number 1722711

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• HDL constructs in linear word-level decision diagram based specification
• Higher-order matching for program transformation

Uses Software

• ML
• HOL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055839)