Bounded, strongly sequential and forward-branching term rewriting systems
From MaRDI portal
Publication:1892142
DOI10.1006/JSCO.1994.1050zbMath0834.68061OpenAlexW2045435392MaRDI QIDQ1892142
Publication date: 8 June 1995
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1994.1050
Related Items (4)
Strongly sequential and inductively sequential term rewriting systems ⋮ Constructor equivalent term rewriting systems ⋮ Decidable call-by-need computations in term rewriting ⋮ Strong and NV-sequentiality of constructor systems
This page was built for publication: Bounded, strongly sequential and forward-branching term rewriting systems