Strongly sequential and inductively sequential term rewriting systems
type: Item
instance of: scholarly article
title: Strongly sequential and inductively sequential term rewriting systems
zbMATH Open document ID: 1339.68136
DOI: 10.1016/S0020-0190(98)00016-7
author: Michael Hanus
author: Salvador Lucas
author: Aart Middeldorp
published in: Information Processing Letters
publication date: 2016-06-09T00:00:00Z
full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000167
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68N30
zbMATH DE Number: 6590716
zbMATH Keywords: definitional trees
zbMATH Keywords: neededness
zbMATH Keywords: strong sequentiality
zbMATH Keywords: term rewriting
zbMATH Keywords: declarative programming
MaRDI profile type: MaRDI publication profile
cites work: A needed narrowing strategy
cites work: Q4385532
cites work: Bounded, strongly sequential and forward-branching term rewriting systems
cites work: Q4297316
cites work: Sequentiality in orthogonal term rewriting systems
cites work: Q3776590
cites work: Classes of equational programs that compile into efficient machine code
description: scientific article; zbMATH DE number 6590716