Algebraic semantics and complexity of term rewriting systems

DOI10.1007/3-540-51081-8_116MaRDI QIDQ5055729zbMATH OpenOpenAlexFDO

Authors Tohru Naoi, Yasuyoshi Inagaki

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-51081-8_116

Mathematics Subject Classification ID

Continuous lattices and posets, applications (06B35) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 3988695
• scientific article; zbMATH DE number 1722708
• scientific article; zbMATH DE number 4074465
• Term rewriting in \(\mathrm{CT}_\Sigma \)
• Compositional term rewriting: An algebraic proof of Toyama's theorem

Cites work

• Algebraic semantics and complexity of term rewriting systems
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Computing in systems described by equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Continuous Data Types
• Data Types as Lattices
• Fundamental properties of infinite trees
• scientific article; zbMATH DE number 3906432 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3589704 (Why is no real title available?)
• scientific article; zbMATH DE number 4001450 (Why is no real title available?)
• Infinite trees in normal form and recursive equations having a unique solution
• Initial Algebra Semantics and Continuous Algebras
• On the descriptive power of term rewriting systems
• Operational and Semantic Equivalence Between Recursive Programs
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus

Cited in

(15)

• On sufficient-completeness and related properties of term rewriting systems
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• Complexity analysis of term-rewriting systems
• scientific article; zbMATH DE number 1722708 (Why is no real title available?)
• scientific article; zbMATH DE number 4016185 (Why is no real title available?)
• scientific article; zbMATH DE number 3869406 (Why is no real title available?)
• scientific article; zbMATH DE number 3988695 (Why is no real title available?)
• scientific article; zbMATH DE number 4074465 (Why is no real title available?)
• scientific article; zbMATH DE number 2080020 (Why is no real title available?)
• Algebraic semantics and complexity of term rewriting systems
• Clocked lambda calculus
• Algebraic semantics of rewriting terms and types
• Semantics of non-terminating rewrite systems using minimal coverings
• Reducibility of operation symbols in term rewriting systems and its application to behavioral specifications
• A compact fixpoint semantics for term rewriting systems

This page was built for publication: Algebraic semantics and complexity of term rewriting systems

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