A deterministic lazy narrowing calculus

DOI10.1006/JSCO.1997.0197zbMath0983.68090OpenAlexW2061708450WikidataQ112879187 ScholiaQ112879187MaRDI QIDQ1264462

Satoshi Okui, Aart Middeldorp

Publication date: 29 April 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/69265d378013107de2f5d42c4ed9ce9f66b6f555

zbMATH Keywords

lazy narrowing calculus

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (6)

A Finite Representation of the Narrowing Space ⋮ Constraint functional logic programming over finite domains ⋮ The unification problem for confluent right-ground term rewriting systems. ⋮ Evaluation strategies for functional logic programming ⋮ Lazy narrowing: strong completeness and eager variable elimination ⋮ Solving Equations by Graph Transformation

This page was built for publication: A deterministic lazy narrowing calculus