Decidable call-by-need computations in term rewriting
type: Item
instance of: scholarly article
title: Decidable call-by-need computations in term rewriting
zbMATH Open document ID: 1101.68628
author: Aart Middeldorp
author: Irène Durand
published in: Information and Computation
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 2136298
zbMATH Keywords: Term rewriting
zbMATH Keywords: Strategies
zbMATH Keywords: Call-by-need
zbMATH Keywords: Tree automata
describes a project that uses: Autowrite
MaRDI profile type: Publication
full work available at URL: j.ic.2004.10.003
OpenAlex ID: W2106516665
cites work: Sequentiality, monadic second-order logic and tree automata.
cites work: Q3979263
cites work: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
cites work: Q3702507
cites work: Q4808760
cites work: Bounded, strongly sequential and forward-branching term rewriting systems
cites work: Q2769431
cites work: Q4297316
cites work: Decidable approximations of term rewriting systems
cites work: Comparing curried and uncurried rewriting
cites work: Sequentiality in orthogonal term rewriting systems
cites work: Q4539643
cites work: Modular properties of conditional term rewriting systems
cites work: Q4705608
cites work: Decidability for left-linear growing term rewriting systems.
cites work: Computing in systems described by equations
cites work: Q2783416
cites work: NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
cites work: Q4808741
cites work: Classes of equational programs that compile into efficient machine code
cites work: Q2723905
cites work: Q5287535
DOI: 10.1016/J.IC.2004.10.003
description: scientific article; zbMATH DE number 2136298