Definitional trees

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

Volumn 632 LNCS, Issue , 1992, Pages 143-157

  Antoy, Sergio ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTER CIRCUITS; LOGIC PROGRAMMING;

DEGREE OF PARALLELISM; DESIGN AND IMPLEMENTATIONS; EXPRESSIVE POWER; HIERARCHICAL STRUCTURES; HIGH LEVEL OF ABSTRACTION; PARALLEL IMPLEMENTATIONS; SEQUENTIAL COMPUTATIONS; SPECIFIC PROBLEMS;

FUNCTIONAL PROGRAMMING;

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

References (24)

1. Sergio Antoy. Design strategies for rewrite rules. In S. Kaplan aand M. Okada, editor, CTRS’90, pages 333-341, Montreal, Canada, June 1990. Lect. Notes in Comp. Sci., Vol. 516.
2. Sergio Antoy. Non-determinism and lazy evaluation in logic programming. In T. P. Clement and K.-K. Lau, editors, LOPSTR’91, pages 318-331, Manchester, UK, July 1991. Springer-Verlag.
3. G. Boudol. Computational semantics of term rewriting systems. In Maurice Nivat and John C. Reynolds, editors, Algebraic methods in semantics, chapter 5. Cambridge University Press, Cambridge, UK, 1985.
4. L. G. Bouma and H. R. Wakers. Implementing algebraic specifications. In J.A. Bergstra, J. Heering, and P. Klint, editors, Algebraic Specification, chapter 5. Addison-Wesley, Wokingham, England, 1989.
5. N. Dershowitz and J. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science B: Formal Methods and Semantics, chapter 6, pages 243-320. North Holland, Amsterdam, 1990.
6. J. Goguen, J. Meseguer, S. Leinwand, T. Winkler, and H. Aida. The rewrite rule machine project. Technical Report SRI-CSL-89-6, SRI International, Menlo Park, CA, 1989.
7. C. M. Hoffman and M. J. O’Donnell. Implementation of an interpreter for abstract equations. In 11th ACM Symposium on the Principle of Programming Languages, Salt Lake City, 1984.
8. Gérard Huet. Confluent reductions: Abstract properties and applications to termrewriting systems. JACM, 27:797-821, 1980.
9. Gérard Huet and Jean-Jacques Lévy. Call by need computations in non-ambiguous linear term rewriting systems. Technical Report 359, INRIA, Le Chesnay, France, 1979.
10. J. R. Kennaway. Sequential evaluation strategies for parallel-or and related reduction systems. Annals of Pure and Applied Logic, 43:31-56, 1989.
11. Claude Kirchner and Patrick Viry. Implementing parallel rewriting. In PLILP’90, pages 1-15, Linköping, Sweden, August 1990. Lect. Notes in Comp. Sci., Vol. 456.
12. Jan Willem Klop. Term rewriting systems. Technical Report CS-R9073, Stichting Mathematisch Centrum, Amsterdam, The Netherlands, 1990.
13. Jan Willem Klop and Aart Middledorp. Sequentiality in orthogonal term rewriting systems. Technical Report CS-R8932, Stichting Mathematisch Centrum, Amsterdam, The Netherlands, 1989.
14. H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodrfguez-Artalejo. Graphbased implementation of a functional language. In ESOP’90, pages 279-290, 1990. Lect. Notes in Comp. Sci., 432.
15. J. J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodrfguez-Artalejo. Lazy narrowing in a graph machine. In Conf. on Algebraic and Logic Progr., 1990. Lect. Notes in Comp. Sci., 463.
16. J. J. Moreno-Navarro and M. Rodrfguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 1992. (To appear).
17. Sanjai Narain. LOG(F): An optimal combination of logic programming, rewriting, and lazy evaluation. PhD thesis, University of California, Los Angeles, CA, 1988.
18. Sanjai Narain. Optimization by non-deterministic, lazy rewriting. In RTA '89, pages 326-342, Chapel Hill, NC, 1989. Lect. Notes in Comp. Sci., Vol. 355.
19. Sanja J Narain. Lazy evaluation in logic programming. In Third IEEE Conference on Computer Languages, pages 218-227, New Orleans, 1990.
20. Michael J. O’Donnell. Computing in systems described by equations. Springer-Verlag, 1977. Lect. Notes in Comp. Sci., Vol. 58.
21. Michael J. O’Donnell. Equational Logic as a Programming Language. MIT Press, 1985.
22. R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 230-241, Philadelphia, PA, June 1990.
23. Satish Thatte. A refinement of strong sequentiality for term rewriting with constructors. Information and Computation, 72:46-65, 1987.
24. Yonggong Yan. Building definitional trees. Master’s project, Portland State University, Portland, OR, March 1992.