Transforming functional logic programs into monadic functional programs
From MaRDI portal
Recommendations
Cites work
- A Fully Abstract Semantics for Constructor Systems
- A Virtual Machine for Functional Logic Computations
- An approach to declarative programming based on a rewriting logic
- Evaluation strategies for functional logic programming
- Higher-order narrowing with definitional trees
- scientific article; zbMATH DE number 1630028 (Why is no real title available?)
- scientific article; zbMATH DE number 5007864 (Why is no real title available?)
- scientific article; zbMATH DE number 3907744 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- Multi-paradigm Declarative Languages
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Purely functional lazy non-deterministic programming
Cited in
(7)- Rules + strategies for transforming lazy functional logic programs
- Monadification of functional programs
- Purely functional lazy non-deterministic programming
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- scientific article; zbMATH DE number 1956457 (Why is no real title available?)
- scientific article; zbMATH DE number 1543356 (Why is no real title available?)
- Monadic translation of classical sequent calculus
This page was built for publication: Transforming functional logic programs into monadic functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003513)