Functional Logic Programming: From Theory to Curry
From MaRDI portal
Publication:4916076
DOI10.1007/978-3-642-37651-1_6zbMath1383.68017MaRDI QIDQ4916076
Publication date: 19 April 2013
Published in: Programming Logics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37651-1_6
Related Items
Default rules for Curry, Symbolic Analysis of Maude Theories with Narval, Functional Logic Programming in Maude, Termination of Narrowing in Left-Linear Constructor Systems, Compiling Collapsing Rules in Certain Constructor Systems, From Boolean Equalities to Constraints, Termination of narrowing via termination of rewriting, A partial evaluation framework for order-sorted equational programs modulo axioms, Transforming Boolean equalities into constraints, Equivalence of Two Formal Semantics for Functional Logic Programs, A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
Uses Software
Cites Work
- A compositional semantic basis for the analysis of equational Horn programs
- Lazy narrowing: strong completeness and eager variable elimination
- Programming in equational logic: Beyond strong sequentiality
- Conditional rewrite rules: Confluence and termination
- Truly concurrent constraint programming
- Foundations of equational logic programming
- Dynamic slicing of lazy functional programs based on redex trails
- Operational semantics for declarative multi-paradigm languages
- Evaluation strategies for functional logic programming
- Kernel-LEAF: A logic plus functional language
- Reduction Strategies for Declarative Programming
- A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424.
- Narrowing and Rewriting Logic: from Foundations to Applications
- Implementing Relational Specifications in a Constraint Functional Logic Language
- Analysis of residuating logic programs
- Specialization of functional logic programs based on needed narrowing
- A needed narrowing strategy
- On a Tighter Integration of Functional and Logic Programming
- Logic programming with functions and predicates: The language Babel
- Nondeterministic algebraic specifications and nonconfluent term rewriting
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Higher-order narrowing with definitional trees
- The integration of functions into logic programming: From theory to practice
- Analyses of unsatisfiability for equational logic programming
- The execution algorithm of mercury, an efficient purely declarative logic programming language
- Leftmost outside-in narrowing calculi
- FUNCTIONAL PEARL Concurrent distinct choices
- An approach to declarative programming based on a rewriting logic
- Term Rewriting and All That
- A proof theoretic approach to failure in functional logic programming
- Declarative Programming with Function Patterns
- Functional and Logic Programming
- Functional and Logic Programming
- Functional and Logic Programming
- Programming Languages and Systems
- Constraint functional logic programming over finite domains
- A Virtual Machine for Functional Logic Computations
- Overlapping Rules and Logic Variables in Functional Logic Programs
- Run-Time Profiling of Functional Logic Programs
- Logic Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
