Optimal non-deterministic functional logic computations
From MaRDI portal
Recommendations
Cited in
(24)- Evaluation strategies for functional logic programming
- Evaluation strategies for functional logic programming
- Reduction strategies for declarative programming
- Improving the efficiency of non-deterministic computations
- Semantic determinism and functional logic program properties
- Lazy context cloning for non-deterministic graph rewriting
- scientific article; zbMATH DE number 5007864 (Why is no real title available?)
- Compiling a functional logic language: \textit{The Fair Scheme}
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- A Fully Abstract Semantics for Constructor Systems
- scientific article; zbMATH DE number 3956406 (Why is no real title available?)
- scientific article; zbMATH DE number 1942455 (Why is no real title available?)
- Default rules for Curry
- Functional Logic Programming: From Theory to Curry
- From Logic to Functional Logic Programs
- Optimization by non-deterministic, lazy rewriting
- Termination of Narrowing in Left-Linear Constructor Systems
- Rewriting and Call-Time Choice: The HO Case
- Logic Programming
- Compiling collapsing rules in certain constructor systems
- An execution model for RICE
- Nondeterministic functions and the existence of optimal proof systems
- Programming with narrowing: a tutorial
- Termination of narrowing via termination of rewriting
This page was built for publication: Optimal non-deterministic functional logic computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364366)
