Equational logic as a programming language
Equational logic as a programming language
Logic programming: functions, relations, and equations
Logic programming: functions, relations, and equations
The relation between logic and functional languages: A survey
Journal of Logic Programming
Design and implementation of a generic, logic and functional programming language
Proc. of the European symposium on programming on ESOP 86
A refinement of strong sequentiality for term rewriting with constructors
Information and Computation
Computational semantics of term rewriting systems
Algebraic methods in semantics
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Computing in Horn clause theories
Computing in Horn clause theories
Enumerating outer narrowing derivationsfor constructor-based term rewriting systems
Journal of Symbolic Computation
Journal of Symbolic Computation
Narrowing and unification in functional programming mechanism for absolute set a bstraction
RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
Proceedings of the third European symposium on programming on ESOP '90
Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Kernel-LEAF: a logic plus functional language
Journal of Computer and System Sciences
Detecting redundant narrowing derivations by the LSE-SL reducibility test
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Sequentiality in orthogonal term rewriting systems
Journal of Symbolic Computation
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
NV-sequentiality: a decidable condition for call-by-need computations in term-rewriting systems
SIAM Journal on Computing
Term graph rewriting: theory and practice
Term graph rewriting: theory and practice
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Computing in Systems Described by Equations
Computing in Systems Described by Equations
Compiling Logic Programs with Equality
PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
On the Interaction of Lazy Evaluation and Backtracking
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
A Demand Driven Computation Strategy for Lazy Narrowing
PLILP '93 Proceedings of the 5th International Symposium on Programming Language Implementation and Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract)
Proceedings of the Third International Conference on Algebraic and Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
On Comleteness of Narrowing Strategies
CAAP '88 Proceedings of the 13th Colloquium on Trees in Algebra and Programming
Lazy Narrowing in a Graph Machine
Proceedings of the Second International Conference on Algebraic and Logic Programming
Implementation of an interpreter for abstract equations
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Integration of functional and logic programming
ACM Computing Surveys (CSUR)
Specialization of lazy functional logic programs
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A unified computation model for functional and logic programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial evaluation of functional logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Journal of the ACM (JACM)
Type-based nondeterminism checking in functional logic programs
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Functional and constraint logic programming
Constraints in computational logics
A Partial Evaluation Framework for Curry Programs
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Using Static Analysis to Compile Non-sequential Functional Logic Programs
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
A Functional Logic Programming Approach to Graphical User Interfaces
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Complete Strategies for Term Graph Narrowing
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
Automatic Optimization of Multi-paradigm Declarative Programs
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Extensions: A Technique for Structuring Functional-Logic Programs
PSI '99 Proceedings of the Third International Andrei Ershov Memorial Conference on Perspectives of System Informatics
UPV-CURRY: An Incremental CURRY Interpreter
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
An Automatic Composition Algorithm for Functional Logic Programs
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
TOY: A Multiparadigm Declarative System
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
An Abstract Machine Based System for a Lazy Narrowing Calculus
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
An implementation of narrowing strategies
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Higher-order narrowing with definitional trees
Journal of Functional Programming
Leftmost outside-in narrowing calculi
Journal of Functional Programming
A general framework for lazy functional logic programming with algebraic polymorphic types
Theory and Practice of Logic Programming
Adding constraints to curry via flat guards
Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
A new generic scheme for functional logic programming with constraints
Higher-Order and Symbolic Computation
Equivalence of Two Formal Semantics for Functional Logic Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Smallcheck and lazy smallcheck: automatic exhaustive testing for small values
Proceedings of the first ACM SIGPLAN symposium on Haskell
Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics
Applications of Declarative Programming and Knowledge Management
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in cflp
Theory and Practice of Logic Programming
Using an abstract representation to specialize functional logic programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Bidirectionalizing graph transformations
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Towards the uniform implementation of declarative languages
Computer Languages
Lazy narrowing with simplification
Computer Languages
| Hi-index | 0.00 |
Narrowing is the operational principle of languages that integrate functional and logic programming. We propose a notion of a needed narrowing step that, for inductively sequential rewrite systems, extends the Huet and Le´vy notion of a needed reduction step. We define a strategy, based on this notion, that computes only needed narrowing steps. Our strategy is sound and complete for a large class of rewrite systems, is optimal w.r.t. the cost measure that counts the number of distinct steps of a derivation, computes only independent unifiers, and is efficiently implemented by pattern matching.