TOY

swMATH9812MaRDI QIDQ21791FDOQ21791

Author name not available (Why is that?)

Official website: http://link.springer.com/chapter/10.1007/3-540-48685-2_19

Cited In (76)

• Overlapping Rules and Logic Variables in Functional Logic Programs
• A hierarchy of semantics for non-deterministic term rewriting systems
• Safe typing of functional logic programs with opaque patterns and local bindings
• Functional logic programming with failure: a set-oriented view
• The narrowing-driven approach to functional logic program specialization
• Title not available (Why is that?)
• Improving the efficiency of non-deterministic computations
• Programming with narrowing: a tutorial
• Title not available (Why is that?)
• A functional account of probabilistic programming with possible worlds. Declarative pearl
• Title not available (Why is that?)
• Termination of narrowing via termination of rewriting
• Operational semantics for declarative multi-paradigm languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalence of two formal semantics for functional logic programs
• Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
• A framework for timed concurrent constraint programming with external functions
• From Logic to Functional Logic Programs
• A new generic scheme for functional logic programming with constraints
• An integrated framework for the diagnosis and correction of rule-based programs
• Evaluation strategies for functional logic programming
• A theoretical framework for the declarative debugging of functional logic programs with lambda abstractions
• Improving lazy non-deterministic computations by demand analysis
• A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains
• Transforming functional logic programs into monadic functional programs
• A compact fixpoint semantics for term rewriting systems
• Compiling a functional logic language: \textit{The Fair Scheme}
• Oz
• A Program Transformation for Tracing Functional Logic Computations
• KiCS2
• Mercury
• Curry
• Kima
• Kernel-LEAF
• TeaBag
• EasyCheck
• XCentric
• TPA
• Freja
• Hat
• Hood
• PAKCS
• XPathLog
• Dynamic slicing of lazy functional programs based on redex trails
• Database query languages and functional logic programming
• CFLP
• Datafun
• nofib
• PFLP
• DiSCiPl
• Specialization of functional logic programs based on needed narrowing
• Transformation and debugging of functional logic programs
• Verification in ACL2 of a generic framework to synthesize SAT-provers
• A logical framework for debugging in declarative constraint programming
• A framework for interpreting traces of functional logic computations
• A safe relational calculus for functional logic deductive databases
• Run-Time Profiling of Functional Logic Programs
• Forward slicing of functional logic programs by partial evaluation
• 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
• Functional and Logic Programming
• Failure and equality in functional logic programming
• Functional Logic Programming: From Theory to Curry
• Semantic determinism and functional logic program properties
• Lazy context cloning for non-deterministic graph rewriting
• Title not available (Why is that?)
• 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
• A Virtual Machine for Functional Logic Computations
• Singular and plural functions for functional logic programming
• Declarative debugging meets the world
• Title not available (Why is that?)
• Denotation by Transformation

This page was built for software: TOY