Reduction strategies for declarative programming

Electronic Notes in Theoretical Computer Science

Volumn 57, Issue , 2001, Pages 184-191

  Hanus, Michael ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; GRAPH THEORY; PATTERN MATCHING; PROBLEM SOLVING; SEMANTICS;

DECLARATIVE PROGRAMMING LANGUAGE; FUNCTIONAL LANGUAGES; HASKELL PROGRAM; REDUCTION STRATEGIES;

LOGIC PROGRAMMING;

EID: 1242286302     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00273-7     Document Type: Conference Paper

References (17)

1. S. Antoy. Definitional Trees. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, pp. 143-157. Springer LNCS 632, 1992.
2. S. Antoy. Optimal Non-Deterministic Functional Logic Computations. In Proc. International Conference on Algebraic and Logic Programming (ALP'97), pp. 16-30. Springer LNCS 1298, 1997.
3. S. Antoy, R. Echahed, and M. Hanus. Parallel Evaluation Strategies for Functional Logic Languages. In Proc. of the Fourteenth International Conference on Logic Programming (ICLP'97), pp. 138-152. MIT Press, 1997.
4. Antoy S., Echahed R., Hanus M. A Needed Narrowing Strategy. Journal of the ACM. Vol. 47:(No. 4):2000;776-822
5. L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 172-184, Boston, 1985.
6. González-Moreno J.C., Hortalá-González M.T., López-Fraguas F.J., Rodríguez-Artalejo M. An approach to declarative programming based on a rewriting logic. Journal of Logic Programming. Vol. 40:1999;47-87
7. J.C. González-Moreno, M.T. Hortalá-González, and M. Rodríguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming. In Proc. of the Fourteenth International Conference on Logic Programming (ICLP'97), pp. 153-167. MIT Press, 1997.
8. Hanus M. Lazy Narrowing with Simplification. Computer Languages. Vol. 23:(No. 2-4):1997;61-85
9. M. Hanus. A Unified Computation Model for Functional and Logic Programming. In Proc. of the 24th ACM Symposium on Principles of Programming Languages (Paris), pp. 80-93, 1997.
10. Hanus M., Lucas S., Middeldorp A. Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters. Vol. 67:(No. 1):1998;1-8
11. Hanus M., Prehofer C. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming. Vol. 9:(No. 1):1999;33-75
12. G. Huet, and J.-J. Levy. Call by need computations in non-ambiguous linear term rewriting systems. Rapport de Recherche No. 359, INRIA, 1979.
13. F.J. López-Fraguas, and J. Sánchez-Hernández. Proving Failure in Functional Logic Programs. In Proc. First International Conference on Computational Logic (CL 2000), pp. 179-183. Springer LNAI 1861, 2000.
14. J.J. Moreno-Navarro. Default Rules: An Extension of Constructive Negation for Narrowing-based Languages. In Proc. Eleventh International Conference on Logic Programming, pp. 535-549. MIT Press, 1994.
15. M. Rodríguez-Artalejo. Functional and Cosntraint Logic Programming. In CCL'99, pp. 202-270. Springer LNCS 2002, 2001.
16. Sekar R.C., Ramakrishnan I.V. Programming in Equational Logic: Beyond Strong Sequentiality. Information and Computation. Vol. 104:(No. 1):1993;78-109
17. Wadler P. Efficient Compilation of Pattern-Matching. Jones S.L.Peyton. The Implementation of Functional Programming Languages. 1987;78-103 Prentice Hall