Optimal non-deterministic functional logic computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1298, Issue , 1997, Pages 16-30

  Antoy, Sergio ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; LOGIC PROGRAMMING; RECONFIGURABLE HARDWARE;

FULLY COMPATIBLE; FUNCTIONAL LOGIC LANGUAGES; FUNCTIONAL LOGIC PROGRAMMING; LOGIC COMPUTATION; NON DETERMINISM; NONDETERMINISTIC COMPUTATION; RELATED WORKS; REWRITE SYSTEMS;

COMPUTER CIRCUITS;

EID: 84957612447     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0027000     Document Type: Conference Paper

References (13)

1. S. Antoy. Definitional trees. In Proc. of the 4th Intl. Conf. on Algebraic and Logic Programming, pages 143-157. Springer LNCS 632, 1992.
2. S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268-279, Portland, 1994. Full versions at URL www.cs.pdx.βdu/~antoy/publicat ions.html.
3. R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, New York, NY, 1988.
4. Curry: An integrated functional logic language. M. Hanus (ed.), Draft Dec. 5, 1996.
5. E. Eder. Properties of substitutions and unifications. Journal of Symbolic Computation, 1:31-46, 1985.
6. J. C. Gonzalez Moreno, F. J. López Fraguas, M. T. Hortalá González, and M. Rodriguez Artalejo. A rewriting logic for declarative programming. In ESOP' 96, Linköping, Sweden, April, 1996. LNCS 1058, Extended version TR DIA 95/5.
7. M. Hanus. On extra variables in (equational) logic programming. In Proc. Twelfth International Conference on Logic Programming, pages 665-679. MIT Press, 1995.
8. M. Hanus. A unified computation model for functional logic programming. In Proc. 24th ACM Symposium on Principles of Programming Languages, pages 80-93, Paris, 1997.
9. G. Huet and J.-J. Lévy. Computations in orthogonal term rewriting systems. In J.-L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge, MA, 1991. Previous version: Call by need computations in non-ambiguous linear term rewriting systems, Technical Report 359, INRIA, Le Chesnay, France, 1979.
10. H. Hussmann. Nondeterministic algebraic specifications and nonconfluent rewriting. J. of Logic Programming, 12:237-255, 1992.
11. A. Middeldorp, Call by need computations to root-stable form. In Proc. 24th ACM Symposium on Principles of Programming Languages, pages 94-105, Paris, 1997.
12. R. A. O'Keefe. The Craft of Prolog. The MIT Press, Cambridge, MA, 1990.
13. T. Suzuki, A. Middeldorp, and T. Ida. Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In 6th International Conference on Rewriting Techniques and Applications, pages 179-193, Kaiserslautern, 1995. Lecture Notes in Computer Science 914.