Evaluation strategies for functional logic programming
From MaRDI portal
Publication:2456576
DOI10.1016/J.JSC.2004.12.007zbMATH Open1129.68019OpenAlexW2070953905MaRDI QIDQ2456576FDOQ2456576
Authors: Sergio Antoy 
Publication date: 19 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2004.12.007
Recommendations
definitional treesnarrowingfunctional logic programmingconstructor-based rewrite systemsEvaluation strategies
Cites Work
- Logic programming with functions and predicates: The language Babel
- Title not available (Why is that?)
- Strongly sequential and inductively sequential term rewriting systems
- A needed narrowing strategy
- Title not available (Why is that?)
- Programming as a Discipline of Mathematical Nature
- Title not available (Why is that?)
- Title not available (Why is that?)
- Conditional rewrite rules: Confluence and termination
- A monadic semantics for core Curry
- Computing in systems described by equations
- Higher-order narrowing with definitional trees
- Title not available (Why is that?)
- Narrowing vs. SLD-resolution
- Kernel-LEAF: A logic plus functional language
- The integration of functions into logic programming: From theory to practice
- Sequential evaluation strategies for parallel-or and related reduction systems
- Programming in equational logic: Beyond strong sequentiality
- A deterministic lazy narrowing calculus
- Lazy narrowing: strong completeness and eager variable elimination
- Title not available (Why is that?)
- Polymorphic types in functional logic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approach to declarative programming based on a rewriting logic
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Program derivation in type theory: A partitioning problem
- Title not available (Why is that?)
- Functional logic programming with failure: a set-oriented view
- Leftmost outside-in narrowing calculi
Cited In (25)
- Relating the implementation techniques of functional and functional logic languages
- An evaluation semantics for narrowing-based functional logic languages
- Programming with narrowing: a tutorial
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reduction strategies for declarative programming
- Cost-augmented partial evaluation of functional logic programs
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Optimistic evaluation
- Transforming functional logic programs into monadic functional programs
- Compiling a functional logic language: \textit{The Fair Scheme}
- Type-level computation using narrowing in \(\Omega\)mega
- Functional logic programming in Maude
- Higher-order narrowing with definitional trees
- Inductively Sequential Term-Graph Rewrite Systems
- A rule-based approach to the implementation of evaluation strategies
- Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
- Needed computations shortcutting needed steps
- Evaluation strategies for functional logic programming
- Functional Logic Programming: From Theory to Curry
- Lazy context cloning for non-deterministic graph rewriting
- Implementing a library for probabilistic programming using non-strict non-determinism
- Compiling collapsing rules in certain constructor systems
Uses Software
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)
