Evaluation strategies for functional logic programming
From MaRDI portal
Publication:2456576
Recommendations
Cites work
- scientific article; zbMATH DE number 1630028 (Why is no real title available?)
- scientific article; zbMATH DE number 1696604 (Why is no real title available?)
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1332654 (Why is no real title available?)
- scientific article; zbMATH DE number 512892 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1088020 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 1405629 (Why is no real title available?)
- A deterministic lazy narrowing calculus
- A monadic semantics for core Curry
- A needed narrowing strategy
- An approach to declarative programming based on a rewriting logic
- Computing in systems described by equations
- Conditional rewrite rules: Confluence and termination
- Functional logic programming with failure: a set-oriented view
- Higher-order narrowing with definitional trees
- Kernel-LEAF: A logic plus functional language
- Lazy narrowing: strong completeness and eager variable elimination
- Leftmost outside-in narrowing calculi
- Logic programming with functions and predicates: The language Babel
- Narrowing vs. SLD-resolution
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Polymorphic types in functional logic programming
- Program derivation in type theory: A partitioning problem
- Programming as a Discipline of Mathematical Nature
- Programming in equational logic: Beyond strong sequentiality
- Sequential evaluation strategies for parallel-or and related reduction systems
- Strongly sequential and inductively sequential term rewriting systems
- The integration of functions into logic programming: From theory to practice
Cited in
(25)- Implementing a library for probabilistic programming using non-strict non-determinism
- An evaluation semantics for narrowing-based functional logic languages
- Lazy context cloning for non-deterministic graph rewriting
- scientific article; zbMATH DE number 1696605 (Why is no real title available?)
- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
- Cost-augmented partial evaluation of functional logic programs
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Transforming functional logic programs into monadic functional programs
- Relating the implementation techniques of functional and functional logic languages
- Compiling collapsing rules in certain constructor systems
- Inductively Sequential Term-Graph Rewrite Systems
- Functional Logic Programming: From Theory to Curry
- Reduction strategies for declarative programming
- scientific article; zbMATH DE number 7453116 (Why is no real title available?)
- Compiling a functional logic language: \textit{The Fair Scheme}
- Programming with narrowing: a tutorial
- Optimistic evaluation
- scientific article; zbMATH DE number 1692896 (Why is no real title available?)
- A rule-based approach to the implementation of evaluation strategies
- Evaluation strategies for functional logic programming
- Higher-order narrowing with definitional trees
- scientific article; zbMATH DE number 826303 (Why is no real title available?)
- Needed computations shortcutting needed steps
- Functional logic programming in Maude
- Type-level computation using narrowing in \(\Omega\)mega
This page was built for publication: Evaluation strategies for functional logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456576)
