Sequential evaluation strategies for parallel-or and related reduction systems

DOI10.1016/0168-0072(89)90024-9zbMath0684.68043OpenAlexW2122429656MaRDI QIDQ1825644

J. R. Kennaway

Publication date: 1989

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(89)90024-9

zbMATH Keywords

abstract reduction systemscombinatory reduction systemsterm rewrite systemsevaluation strategies

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)

Related Items (14)

Context rewriting ⋮ Open problems in rewriting ⋮ Optimal normalization in orthogonal term rewriting systems ⋮ Needed reduction and spine strategies for the lambda calculus ⋮ A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy ⋮ Infinitary lambda calculus ⋮ Evaluation strategies for functional logic programming ⋮ Sequentiality in orthogonal term rewriting systems ⋮ A sequential reduction strategy ⋮ On abstract normalisation beyond neededness ⋮ Sequentiality, monadic second-order logic and tree automata. ⋮ Context-sensitive rewriting strategies ⋮ Combinatory reduction systems: Introduction and survey ⋮ Relative normalization in Deterministic Residual Structures

Cites Work

• The lambda calculus, its syntax and semantics
• Combinatory logic. Vol. II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential evaluation strategies for parallel-or and related reduction systems