Extended term rewriting systems
From MaRDI portal
Recommendations
- Automata, Languages and Programming
- scientific article; zbMATH DE number 1118018
- Publication:4207592
- scientific article; zbMATH DE number 1722708
- Term Rewriting and Applications
- Simply terminating rewrite systems with long derivations
- scientific article; zbMATH DE number 4090779
- scientific article; zbMATH DE number 3870642
- Term rewriting systems in logic programming and in functional programming
- scientific article; zbMATH DE number 1368955
Cites work
- scientific article; zbMATH DE number 4179332 (Why is no real title available?)
- scientific article; zbMATH DE number 4191131 (Why is no real title available?)
- scientific article; zbMATH DE number 3888893 (Why is no real title available?)
- scientific article; zbMATH DE number 3951980 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 4090848 (Why is no real title available?)
- scientific article; zbMATH DE number 4092758 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1142320 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 3358455 (Why is no real title available?)
- A rationale for conditional equational programming
- Computing in systems described by equations
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Mathematical foundations of computer science 1975. 4th symposium, Mariánské Lázně, September 1--5, 1975
- Pairing Without Conventional Restraints
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- The lambda calculus, its syntax and semantics
- Unique normal forms for lambda calculus with surjective pairing
Cited in
(9)- Conditional linearization
- Open problems in rewriting
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Head boundedness of nonterminating rewritings
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- A Human-Oriented Term Rewriting System
- Symbol different term rewrite systems
- Murg term rewrite systems
- Descendants and origins in term rewriting.
This page was built for publication: Extended term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881265)