scientific article

zbMath0611.68007MaRDI QIDQ3750994

Gérard Boudol

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebraic semanticsterm rewriting systemscomplete partial ordercall-by- need computationsnon-deterministic recursive definitionsterminating computations

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Relating two categorical models of term rewriting, Computing in unpredictable environments: semantics, reduction strategies, and program transformations, Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes, Evaluation strategies for functional logic programming, Elimination of conditions, Sequentiality in orthogonal term rewriting systems, Conditional rewriting logic as a unified model of concurrency, On abstract normalisation beyond neededness, Confluence by critical pair analysis revisited, Descendants and origins in term rewriting., A short scientific biography of Maurice Nivat, Redexes are stable in the λ-calculus, A causal semantics for CCS via rewriting logic