Determinization of conditional term rewriting systems

DOI10.1016/j.tcs.2012.09.005zbMath1253.68199OpenAlexW2123848106MaRDI QIDQ1929232

Masahiko Sakai, Toshiki Sakabe, Masanori Nagashima

Publication date: 7 January 2013

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.09.005

zbMATH Keywords

functional programdeterministic conditional term rewriting systemrule-based transformation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (6)

Semi-inversion of Conditional Constructor Term Rewriting Systems ⋮ Reversible computation in term rewriting ⋮ Inverse Unfold Problem and Its Heuristic Solving ⋮ Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems ⋮ Determinization of inverted grammar programs via context-free expressions ⋮ Characterizing Compatible View Updates in Syntactic Bidirectionalization

Uses Software

• InvX
• LRinv

Cites Work

• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• Transformations of CLP modules
• Operational termination of conditional term rewriting systems
• Conditional rewrite rules: Confluence and termination
• Order-sorted completion: The many-sorted way
• Modularity of simple termination of term rewriting systems with shared constructors
• Equivalence-preserving first-order unfold/fold transformation systems
• A transformation system for deductive database modules with perfect model semantics
• Transforming constraint logic programs
• Completeness results for basic narrowing
• Rules + strategies for transforming lazy functional logic programs
• Program development in computational logic. A decade of research advances in logic-based program development.
• Constraint-based correctness proofs for logic program transformations
• Termination of term rewriting using dependency pairs
• Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
• Unravelings and ultra-properties
• BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
• Automatic Partial Inversion of Inductively Sequential Functions
• A Transformation System for Developing Recursive Programs
• On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Program Inversion for Tail Recursive Functions
• Term Rewriting and Applications
• Programming Languages and Systems
• Verification of Erlang processes by dependency pairs

This page was built for publication: Determinization of conditional term rewriting systems