The integration of functions into logic programming: From theory to practice

The Journal of Logic Programming

Volumn 19-20, Issue SUPPL. 1, 1994, Pages 583-628

  Hanus, Michael ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL OPERATORS; PROGRAMMING THEORY; PROLOG (PROGRAMMING LANGUAGE);

FUNCTIONAL LOGIC LANGUAGES; OPERATIONAL SEMANTICS;

LOGIC PROGRAMMING;

EID: 0028427164     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-1066(94)90034-5     Document Type: Article

References (133)

1. An Overview of LIFE
2. Le Fun: Logic, Equations, and Functions
3. Functions as Passive Constraints in LIFE
4. Analyses of Inconsistency for Incremental Equational Logic Programming
5. Narrowing Approximations as an Optimization for Equational Logic Programs
6. A Needed Narrowing Strategy
7. LEAF: A Language which Integrates Logic, Equations and Functions
8. The Relation between Logic and Functional Languages: A Survey
9. Design and Implementation of a Generic, Logic and Functional Programming Language
10. Completion-Time Optimization of Rewrite-Time Goal Solving
11. An Optimal Narrowing Strategy for General Canonical Systems
12. Unification in Incompletely Specified Theories: A Case Study
13. Towards a Clean Amalgamation of Logic Programs with External Procedures
14. An Extension of WAM for K-LEAF: A WAM-Based Compilation of Conditional Narrowing
15. Logic and Functional Programming on Distributed Memory Architectures
16. IDEAL: An Ideal Deductive Applicative Language
17. Narrowing vs. SLD-Resolution
18. S-SLD-resolution—An Operational Semantics for Logic Programs with External Procedures
19. Avoiding Dynamic Delays in Functional Logic Programs
20. Synthesis of Directionality Information for Functional Logic Programs
21. The Implementation of Lazy Narrowing
22. Compiling Lazy Narrowing into Prolog
23. Efficient Integration of Simplification into Prolog
24. The Categorical Abstract Machine
25. The Unification of Functional and Logic Languages
26. Narrowing and Unification in Functional Programming—An Evaluation Mechanism for Absolute Set Abstraction
27. A New Perspective on Integrating Functional and Logic Languages
28. Register Allocation in a Prolog Machine
29. Functional Computations in Logic Programs
30. Rewrite Systems
31. Equation Solving in Conditional AC-Theories
32. Conditional Equational Programming and the Theory of Conditional Term Rewriting
33. Logic Programming cum Applicative Programming
34. Equational Programming
35. Solving Goals in Equational Languages
36. On Completeness of Narrowing Strategies
37. Uniform Narrowing Strategies
38. First-Order Unification in an Equational Theory
39. SLOG: A logic Programming Language Interpreter Based on Clausal Superposition and Rewriting
40. Prolog with Simplification
41. Extending SLD-Resolution to Equational Horn Clauses Using E-Unification
42. Complete Sets of Transformations for General E-Unification
43. A Completion Procedure for Conditional Equations
44. Experiences with the RAP System—A Specification Interpreter Combining Term Rewriting and Resolution
45. Kernel LEAF: A Logic plus Functional Language
46. A Completeness Result for E-Unification Algorithms Based on Conditional Narrowing
47. Eglog: Equality, Types, and Generic Modules for Logic Programming
48. Models and Equality for Logical Programming
49. On the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming
50. On the Interaction of Lazy Evaluation and Backtracking
51. Compiling Logic Programs with Equality
52. A Functional and Logic Language with Polymorphic Types
53. Efficient Implementation of Narrowing and Rewriting
54. Improving Control of Logic Programs by Using Functional Logic Languages
55. Incremental Rewriting in Narrowing Derivations
56. On the Completeness of Residuation
57. Lazy Unification with Simplification
58. Towards the Global Optimization of Functional Logic Programs
59. A Debugging Model for Functional Logic Programs
60. Andorra Prolog: An Integration of Prolog and Committed Choice Languages
61. Standard ML
62. Narrowing Techniques Applied to Idempotent Unification
63. Global Compilation of Prolog
64. Foundations of Equational Logic Programming
65. Report on the Functional Programming Language Haskell
66. Why Functional Programming Matters
67. Canonical Forms and Unification
68. Unification in Conditional-Equational Theories
69. A Theory of Complete Logic Programs with Equality
70. A Fully Abstract Semantics for a First-Order Functional Language with Logic Variables
71. An Implementation of Narrowing
72. Enriching Prolog with S-Unification
73. Conditional Rewrite Rules
74. Simplifying Conditional Term Rewriting Systems Unification Termination and Confluence
75. Simple Word Problems in Universal Algebras
76. Detecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test
77. Graph-Based Implementation of a Functional Logic Language
78. Implementing a Lazy Functional Logic Language with Disequality Constraints
79. Independent AND-Parallel Implementation of Narrowing
80. Our LIPS Are Sealed: Interfacing Functional and Logic Programming Systems
81. A Tiny Constraint Functional Logic Programming Language and Its Continuation Semantics
82. The Implementation of Functional Logic Programming languages
83. Relating the Implementation Techniques of Functional and Functional Logic Languages
84. A Demand Driven Computation Strategy for Lazy Narrowing
85. Dynamic Detection of Determinism in Functional Logic Languages
86. A General Scheme for Constraint Functional Logic Programming
87. An Approach to Constraint Functional Logic Programming
88. Flang: A Functional-Logic Language
89. Flang and Its Implementation
90. Some Global Optimizations for a Prolog Compiler
91. Counterexamples to Completeness Results for Basic Narrowing
92. Lazy Narrowing in a Graph Machine
93. Efficient Lazy Narrowing Using Demandedness Analysis
94. Logic Programming with Functions and Predicates: The Language BABEL
95. Compilation of Narrowing
96. CAMEL: An Extension of the Categorical Abstract Machine to Compile Functional/Logic Programs
97. Negation and Control in Prolog
98. Adding Equations to NU-Prolog
99. Basic Narrowing Revisited
100. Lazy Narrowing Calculi
101. Strategy-Controlled Reduction and Narrowing
102. Computing in Horn Clause Theories
103. Generic Induction Proofs
104. Higher-Order Equational Logic Programming
105. Narrowing as the Operational Semantics of Functional Languages
106. Improving Basic Narrowing Techniques
107. NARROWER A New Algorithm for Unification and Its Application to Logic Programming
108. LOGLISP: Motivation, Design and Implementation
109. Quty: A Concurrent Language Based on Logic and Function
110. A Typed Functional Extension of Logic Programming
111. Universal Unification and a Classification of Equational Theories
112. An Introduction to Unification Theory
113. Set Abstraction in Functional and Logic Programming
114. A Domain-Theoretic Approach to Functional and Logic Programming
115. A domain-theoretic approach to functional and logic programming
116. Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity
117. Fresh: A Higher-Order Language Based on Unification and Multiple Results
118. TEL (Version 0.9) Report and User Manual
119. FUNLOG: A Computational Model Integrating Logic Programming and Functional Programming
120. Semantics of a Logic Programming Language with a Reducibility Predicate
121. LIPS on a MIPS: Results Form a Prolog Compiler for a RISC
122. Compiler Optimizations for the WAM
123. Miranda: A Non-Strict Functional Language with Polymorphic Types
124. Logic Programming with Equations
125. Can Logic Programming Execute as Fast as Imperative Programming?
126. An Abstract Prolog Instruction Set
127. Design of a Compiler for Lazy Pattern Driven Narrowing
128. Enumerating Outer Narrowing Derivations for Constructor-Based Term Rewriting Systems