BABEL

swMATH3018MaRDI QIDQ15552FDOQ15552

Author name not available (Why is that?)

Official website: http://www.mathematik.uni-marburg.de/~loogen/babel.html

Described by source

• Logic programming with functions and predicates: The language Babel

Cited In (85)

• Functional and Logic Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards the uniform implementation of declarative languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Similarity-Based Equality with Lazy Evaluation
• Higher-order narrowing with definitional trees
• Implementation of a UU-algorithm for primitive recursive tree functions
• Title not available (Why is that?)
• A proposal for disequality constraints in Curry
• A Syntactic Approach to Combining Functional Notation, Lazy Evaluation, and Higher-Order in LP Systems
• Overlapping Rules and Logic Variables in Functional Logic Programs
• Integration of declarative and constraint programming
• Termination of Narrowing in Left-Linear Constructor Systems
• Title not available (Why is that?)
• Relating the implementation techniques of functional and functional logic languages
• The narrowing-driven approach to functional logic program specialization
• Title not available (Why is that?)
• A new framework for declarative programming
• Improving the efficiency of non-deterministic computations
• An evaluation semantics for narrowing-based functional logic languages
• An approach to declarative programming based on a rewriting logic
• Incremental constraint satisfaction for equational logic programming
• Title not available (Why is that?)
• Programming with narrowing: a tutorial
• Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
• Title not available (Why is that?)
• The integration of functions into logic programming: From theory to practice
• Ensuring the quasi-termination of needed narrowing computations
• Analyses of unsatisfiability for equational logic programming
• 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?)
• Title not available (Why is that?)
• On-demand strategy annotations revisited: an improved on-demand evaluation strategy
• Title not available (Why is that?)
• Completeness results for basic narrowing
• Cost-augmented partial evaluation of functional logic programs
• 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 integrated framework for the diagnosis and correction of rule-based programs
• Title not available (Why is that?)
• Evaluation strategies for functional logic programming
• Title not available (Why is that?)
• A tight, practical integration of relations and functions.
• Miranda
• Oz
• Hiord
• Mercury
• Curry
• Kima
• Kernel-LEAF
• Likelog
• TeaBag
• TOY
• TPA
• PAKCS
• Title not available (Why is that?)
• Database query languages and functional logic programming
• FRIL
• DiSCiPl
• Specialization of functional logic programs based on needed narrowing
• An universal resolving algorithm for inverse computation of lazy languages
• Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
• Transformation and debugging of functional logic programs
• Functional and Logic Programming
• Functional and Logic Programming
• A safe relational calculus for functional logic deductive databases
• Forward slicing of functional logic programs by partial evaluation
• An implementation of syntax directed functional programming on nested- stack machines
• Level-confluence of conditional rewrite systems with extra variables in right-hand sides
• Title not available (Why is that?)
• Title not available (Why is that?)
• Functional Logic Programming: From Theory to Curry
• A debugging scheme for functional logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Declarative debugging of functional logic programs
• Title not available (Why is that?)
• Dynamic detection of determinism in functional logic languages

This page was built for software: BABEL