Determinization of conditional term rewriting systems
type: Item
instance of: scholarly article
title: Determinization of conditional term rewriting systems
zbMATH Open document ID: 1253.68199
author: Masanori Nagashima
author: Masahiko Sakai
author: Toshiki Sakabe
published in: Theoretical Computer Science
publication date: 2013-01-07T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 6122467
zbMATH Keywords: deterministic conditional term rewriting system
zbMATH Keywords: functional program
zbMATH Keywords: rule-based transformation
describes a project that uses: InvX
describes a project that uses: LRinv
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.09.005
OpenAlex ID: W2123848106
cites work: Order-sorted completion: The many-sorted way
cites work: Operational termination of conditional term rewriting systems
cites work: Conditional rewrite rules: Confluence and termination
cites work: Completeness results for basic narrowing
cites work: Program Inversion for Tail Recursive Functions
cites work: Q2783416
cites work: Automatic Partial Inversion of Inductively Sequential Functions
cites work: Verification of Erlang processes by dependency pairs
cites work: Orderings for term-rewriting systems
cites work: Termination of term rewriting using dependency pairs
cites work: Modularity of simple termination of term rewriting systems with shared constructors
cites work: Term Rewriting and Applications
cites work: Programming Languages and Systems
cites work: Q5472880
cites work: Unravelings and ultra-properties
cites work: Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity
cites work: On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
cites work: A Transformation System for Developing Recursive Programs
cites work: Equivalence-preserving first-order unfold/fold transformation systems
cites work: Unfold⧸fold transformation of general logic programs for the well-founded semantics
cites work: BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS
cites work: Constraint-based correctness proofs for logic program transformations
cites work: A transformation system for deductive database modules with perfect model semantics
cites work: Transformations of CLP modules
cites work: Transforming constraint logic programs
cites work: Program development in computational logic. A decade of research advances in logic-based program development.
cites work: Rules + strategies for transforming lazy functional logic programs
DOI: 10.1016/J.TCS.2012.09.005
Recommended article: Characterizing and proving operational termination of deterministic conditional term rewriting systems
Recommended article: Reachability in Conditional Term Rewriting Systems
Recommended article: Q3817651
Recommended article: On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems
Recommended article: Q2766779
Recommended article: Q2980968
Recommended article: Combinations of simplifying conditional term rewriting systems
Recommended article: Conditional term rewriting and first-order theorem proving
Recommended article: Confluence of terminating conditional rewrite systems revisited
Recommended article: Dependency pairs for proving termination properties of conditional term rewriting systems
description: scientific article; zbMATH DE number 6122467