Relative normalization in deterministic residual structures

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

Volumn 1059, Issue , 1996, Pages 180-195

  Glauert, John ^a   Khasidashvili, Zurab ^a  

^a UNIVERSITY OF EAST ANGLIA   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; FORESTRY;

COMPUTATION STRUCTURE; DETERMINISTIC FAMILY STRUCTURES; DETERMINISTIC RESIDUAL STRUCTURES; EVENT STRUCTURES; NORMALIZATION THEOREM; OPTIMALITY THEOREMS; REWRITING SYSTEMS; STABLE DETERMINISTIC RESIDUAL STRUCTURES;

COMPUTATION THEORY;

EID: 84947930295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_37     Document Type: Conference Paper

References (32)

1. Antoy S., Echahed R., Hanus M. A needed narrowing strategy. In: Proc. Of POPL'94, Portland, Oregon, 1994.
2. Antoy S. and Middeldorp A. A Sequential Reduction Strategy. In Proc. of the 4th International Conference on Algebraic and Logic Programming, ALP'94, Madrid, Springer LNCS. vol. 850, p. a, 1994.
3. Ariola Z.M., Felleisen M., Maraist J., Odersky M., Wadler P. A Call-By-Need Lambda Calculus. In: Proc. POPL'95, 1995.
4. Asperti A., Laneve C. Interaction Systems I: The theory of optimal reductions. Mathematical Structures in Computer Science, vol. 11, Cambridge University Press, 1993i p. 1-48.
5. Barendregt H. P. The Lambda Calculus, its Syntax and Semantics. North-Holland, 1984.
6. Batendregt H. P., Kennaway J. R., Klop J. W., Sleep M. R. Needed Reduction and spine strategies for the lambda calculus. Information and Computation, v. 75, no. 3, 1987, p. 191-231.
7. Berry G. Modéles complétement adéquats et stables desλ-calculs typés. Thése de l'Université de Paris 8, 1979.
8. Curry H. B., Feys R. Combinatory Logic. vol. 1, North-Holland, 1958.
9. Glauert J.R.W., Khasidashvili Z. Relative Normalization in Orthogonal Expression Reduction Systems. In: Proc. of the 4th International workshop on Conditional (and Typed) Term Rewriting Systems, CTRS'94, Springer LNCS, vol. 968, N. Dershowitz, ed. Jerusalem, 1994, p. 144-165.
10. Gonthier G., Lévy J.-J., Melliés P.-A. An abstract Standardisation theorem. In: Proc. LICS'92, Santa Cruz, California, 1992, p. 72-81.
11. I-Iuet G., Lévy J.-J. Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, J.-L. Lassez and G. Plotldn, eds. MIT Press, 1991.
12. Kennaway J.R. Sequential evaluation strategy for parallel-or and related reduction systems. Annals of Pure and Applied Logic 43, 1989, p.31-56.
13. Kennaway J. R., Sleep M. R. Neededness is hypernormalizing in regular combinatory reduction systems. Report. University of East Anglia, 1989.
14. Kennaway J. R., Klop J. W., Sleep M. R, de Vries F.-J. Event structures and orthogonal term graph rewriting. In: M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, eds. Term Graph Rewriting: Theory and Practice. John Wiley, 1993.
15. Kennaway J. R., Klop J. W., Sleep M. R, De Vries F.-J. Transfinite reductions in orthogonal term graph rewriting. Inf. and Comp., To appear.
16. Khasidashvili Z. β-reductions and /β-developments of A-terms with the least number of steps. In: Proc. of the International Conference on Computer Logic COLOG'88, Taénn 1988, Springer LNCS, v. 417, P. Martin-LSf and G. Mints, eds. 1990, p. 105-111.
17. Khasidashvili Z. The Church-Rosser theorem in Orthogonal Combinatory Reduction Systems. Report 1825, INRIA Rocquencourt, 1992.
18. Khasidashvili Z. Optimal normalization in orthogonal term rewriting systems. In: Proc. RTA'flJ, Springer LNCS, vol. 690, C. Kirchner, ed. Montreal, 1993, p. 243-258.
19. Klop J. W. Combinatory Reduction Systems. Mathematical Centre Tracts n. 127, CWI, Amsterdam, 1980.
20. Klop J. W. Term Rewriting Systems. In: S. Abramsky, D. Gabbay, and T. Malbanm eds. Handbook of Logic in Computer Science, vol. 2, Oxford University Press, 1992, p. 1-116.
21. L6vy J.-J. Réductions correctes et optimales dans le lambda-calcul, Thése de l'Université de Paris 7, 1978.
22. L6vy J.-J. Optimal reductions in the Lambda-calculus. In: To H. B. Curry: Essays on Combinatory Logic, Lambda-calculus and Formalism, Hindley J. R., Seldin J. P. eds, Academic Press, 1980, p. 159-192.
23. Maranget L. Optimal derivations in weak A-calculi and in orthogonal Term Rewriting Systems. In: Proc. POPL'91, p. 255-269.
24. Maranget L. La stratégie paresseuse. Thése de l'Université de Paris 7, 1992.
25. Nipkow T. Orthogonal higher-order rewrite systems are confluent. In: Proc. of the 1st International Conference on Typed Lambda Calculus and Applications, TLCA'93, Springer LNCS, vol. 664, Bazem M., Groote J.F., eds. Utrecht, 1993, p. 306-317.
26. NScker E. Efficient Functional Programming. Compilation and Programming Techniques. Ph.D. Thesis, Catholic University of Nijmegen, 1994.
27. Van Oostrom V. Confluence for Abstract and Higher-Order Rewriting. Ph.D. Thesis, Free University of Amsterdam, 1994.
28. Van Oostrom V., van Raamsdonk F. Weak orthogonality implies confluence: the higher-order case. In: Proc. of the 3 "a International Conference on Logical Foundations of Computer Science, LFCS'94, Springer LNCS, vol. 813, Narode A., Matiyasevich Yu. V. eds. St. Petersburg, 1994. p. 379-392.
29. Sekar R.C., Ramakrishnan I.V. Programming in Equational Logic: Beyond Strong Sequentiality. Proe. of the 5 th IEEE Symposium on Logic in Computer Science, LICS'95, Philadelphia, 1990. p. 230-242.
30. Stark E. W. Concurrent transition systems. Theoretical Computer Science,vol. 64, 1989, p. 221-270.
31. Winskel G. Events in Computation. Ph.D. Thesis, Univ. Edinburgh, 1080.
32. Yoshida N. Optimal reduction in weak X-calculus with shared environments. In Proc. of ACM Conference on Functional Programming Languages and Computer Architecture, FPCA'93, Copenhagen, 1993, p. 243-252.