TOY

swMATH9812MaRDI QIDQ21791

No author found.

Related Items (56)

From Logic to Functional Logic Programs ⋮ Extending the $\mathcal{TOY}$ System with the ECL i PS e Solver over Sets of Integers ⋮ Compiling a Functional Logic Language: The Fair Scheme ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A functional account of probabilistic programming with possible worlds. Declarative pearl ⋮ Database query languages and functional logic programming ⋮ Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the Valencian Research Council under grant GV01-424. ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ A new generic scheme for functional logic programming with constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ Unnamed Item ⋮ Functional Logic Programming with Failure: A Set-Oriented View ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Evaluation strategies for functional logic programming ⋮ Transforming Functional Logic Programs into Monadic Functional Programs ⋮ A Theoretical Framework for the Declarative Debugging of Functional Logic Programs with Lambda Abstractions ⋮ Declarative Debugging Meets the World ⋮ Singular and plural functions for functional logic programming ⋮ Functional Logic Programming: From Theory to Curry ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Transformation and Debugging of Functional Logic Programs ⋮ A Logical Framework for Debugging in Declarative Constraint Programming ⋮ Programming with narrowing: a tutorial ⋮ Termination of narrowing via termination of rewriting ⋮ A Virtual Machine for Functional Logic Computations ⋮ A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains ⋮ A Program Transformation for Tracing Functional Logic Computations ⋮ Dynamic slicing of lazy functional programs based on redex trails ⋮ A compact fixpoint semantics for term rewriting systems ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Overlapping Rules and Logic Variables in Functional Logic Programs ⋮ Cooperation of Algebraic Constraint Domains in Higher-Order Functional and Logic Programming ⋮ Specialization of functional logic programs based on needed narrowing ⋮ Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming ⋮ Run-Time Profiling of Functional Logic Programs ⋮ Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers ⋮ A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems ∗ ⋮ Functional and Logic Programming ⋮ A Declarative Debugging System for Lazy Functional Logic Programs ⋮ Denotation by Transformation ⋮ Forward slicing of functional logic programs by partial evaluation ⋮ Semantic Determinism and Functional Logic Program Properties ⋮ Lazy Context Cloning for Non-Deterministic Graph Rewriting ⋮ Equivalence of Two Formal Semantics for Functional Logic Programs ⋮ A Framework for Timed Concurrent Constraint Programming with External Functions ⋮ Reporting Failures in Functional Logic Programs ⋮ A Framework for Interpreting Traces of Functional Logic Computations ⋮ Implementing Dynamic-Cut in <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mi mathvariant="script">T</mml:mi></mml:math>OY ⋮ A Proposal for Disequality Constraints in Curry ⋮ Improving Lazy Non-Deterministic Computations by Demand Analysis

This page was built for software: TOY