Constructor equivalent term rewriting systems are strongly sequential: A direct proof
type: Item
instance of: scholarly article
title: Constructor equivalent term rewriting systems are strongly sequential: A direct proof
zbMATH Open document ID: 0823.68048
DOI: 10.1016/0020-0190(94)00122-7
author: Irène Durand
author: Bruno Salinier
published in: Information Processing Letters
publication date: 1994-11-20T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 691034
zbMATH Keywords: term rewriting systems
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)00122-7
OpenAlex ID: W1995788030
cites work: Constructor equivalent term rewriting systems
cites work: Q4297316
cites work: Sequentiality in orthogonal term rewriting systems
cites work: Classes of equational programs that compile into efficient machine code
cites work: On the correspondence between two classes of reduction systems
description: scientific article; zbMATH DE number 691034