Nondeterministic algebraic specifications and nonconfluent term rewriting
From MaRDI portal
Publication:3992231
DOI10.1016/0743-1066(92)90026-YzbMath0763.68050WikidataQ126858379 ScholiaQ126858379MaRDI QIDQ3992231
Publication date: 13 August 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items
Conditional rewriting logic: Deduction, models and concurrency ⋮ Compiling a Functional Logic Language: The Fair Scheme ⋮ Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the Valencian Research Council under grant GV01-424. ⋮ A new generic scheme for functional logic programming with constraints ⋮ Inductively Sequential Term-Graph Rewrite Systems ⋮ Evaluation strategies for functional logic programming ⋮ Transforming Functional Logic Programs into Monadic Functional Programs ⋮ Functional Logic Programming: From Theory to Curry ⋮ Programming with narrowing: a tutorial ⋮ A functorial semantics for multi-algebras and partial algebras, with applications to syntax. ⋮ Rasiowa-Sikorski deduction systems in computer science applications. ⋮ Semantic Determinism and Functional Logic Program Properties ⋮ Lazy Context Cloning for Non-Deterministic Graph Rewriting ⋮ Equivalence of Two Formal Semantics for Functional Logic Programs
