Cited in
(79)- A hierarchy of semantics for non-deterministic term rewriting systems
- A Virtual Machine for Functional Logic Computations
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Safe typing of functional logic programs with opaque patterns and local bindings
- Functional logic programming with failure: a set-oriented view
- Singular and plural functions for functional logic programming
- Improving the efficiency of non-deterministic computations
- scientific article; zbMATH DE number 1973220 (Why is no real title available?)
- The narrowing-driven approach to functional logic program specialization
- Programming with narrowing: a tutorial
- scientific article; zbMATH DE number 1942461 (Why is no real title available?)
- A functional account of probabilistic programming with possible worlds. Declarative pearl
- scientific article; zbMATH DE number 2085287 (Why is no real title available?)
- Declarative debugging meets the world
- Termination of narrowing via termination of rewriting
- Operational semantics for declarative multi-paradigm languages
- scientific article; zbMATH DE number 1954119 (Why is no real title available?)
- scientific article; zbMATH DE number 2040977 (Why is no real title available?)
- Equivalence of two formal semantics for functional logic programs
- A framework for timed concurrent constraint programming with external functions
- A new generic scheme for functional logic programming with constraints
- An integrated framework for the diagnosis and correction of rule-based programs
- Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
- From Logic to Functional Logic Programs
- Evaluation strategies for functional logic programming
- A theoretical framework for the declarative debugging of functional logic programs with lambda abstractions
- ObjectCurry
- BABEL
- ECCE
- Oz
- KiCS2
- Mercury
- Curry
- Kima
- Kernel-LEAF
- TeaBag
- EasyCheck
- XCentric
- TPA
- Freja
- Hat
- Hood
- PAKCS
- XPathLog
- CFLP
- Datafun
- nofib
- PFLP
- DiSCiPl
- Transforming functional logic programs into monadic functional programs
- Improving lazy non-deterministic computations by demand analysis
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
- A compact fixpoint semantics for term rewriting systems
- scientific article; zbMATH DE number 7455733 (Why is no real title available?)
- Compiling a functional logic language: \textit{The Fair Scheme}
- Dynamic slicing of lazy functional programs based on redex trails
- A Program Transformation for Tracing Functional Logic Computations
- Database query languages and functional logic programming
- Specialization of functional logic programs based on needed narrowing
- Verification in ACL2 of a generic framework to synthesize SAT-provers
- Transformation and debugging of functional logic programs
- A logical framework for debugging in declarative constraint programming
- Denotation by Transformation
- A framework for interpreting traces of functional logic computations
- A safe relational calculus for functional logic deductive databases
- Forward slicing of functional logic programs by partial evaluation
- Run-Time Profiling of Functional Logic Programs
- Cooperation of algebraic constraint domains in higher-order functional and logic programming
- Extending the \(\mathcal{TOY}\) system with the \(\mathrm{ECL}^i\mathrm{PS}^e\) solver over sets of integers
- Failure and equality in functional logic programming
- Functional and Logic Programming
- Functional Logic Programming: From Theory to Curry
- Semantic determinism and functional logic program properties
- Lazy context cloning for non-deterministic graph rewriting
- scientific article; zbMATH DE number 1692905 (Why is no real title available?)
- A declarative debugging system for lazy functional logic programs
- A proposal for disequality constraints in Curry
- Implementing dynamic-cut in \(\mathcal{T}OY\)
- Reporting failures in functional logic programs
This page was built for software: TOY
