Cyclic lambda calculi

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

Volumn 1281, Issue , 1997, Pages 77-106

  Ariola, Zena M ^a   Blom, Stefan ^b  

^a UNIVERSITY OF OREGON   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL MECHANICS; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); PATHOLOGY;

COMPUTATIONAL LAMBDA CALCULUS; CURRENT THEORIES; CYCLIC LAMBDA CALCULUS; FUNCTIONAL LANGUAGES; GARBAGE COLLECTION; LAMBDA ABSTRACTION; REDUCTION THEORY; SOUND AND COMPLETE;

CALCULATIONS;

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

References (39)

1. M. Abadi, L. Cardelli, P.-L, Curie, B. J.-J. Levy. Explicit substitutions. Journal of Functional Programming, 4(1):375-416, 1991.
2. Z. M. Ariola. Relating graph and term rewriting via Böhm models. Applicable Algebra in Engineering, Communication and Computing, 7(5), 1996.
3. Z. M. Ariola and S. Blom. Lambda calculi plus letrec. Technical Report CIS-TR-97-05, Department of computer and information science, University of Oregon. ftp://ftp.cs.uoregoii.edu/pub/ariola/cyclic-calculi.ps.
4. Z. M. Ariola and M. Felleisen. The call-by-need lambda calculus. Journal of Functional Programming, 7(3), 1997.
5. Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler. The call-by-need lambda calculus. In Proc. ACM Conference on Principles of Programming Languages, pages 233-246, 1995.
6. Z. M. Ariola and J. W. Klop. Lambda calculus with explicit recursion. Technical Report CIS-TR-96-04, Department of computer and information science, University of Oregon. To appear in Information and computation.
7. Z. M. Ariola and J. W. Klop. Cyclic lambda graph rewriting. In Proc. Ninth Symposium on Logic in Computer Science (LICS'94), Paris, France,pages 416-425, 1994.
8. Z. M. Ariola and J. W. Klop. Equational term graph rewriting. Fundamentae Informatidae, 26(3,4):207-240, 1996. Extended version: CWI Report CS-R9552.
9. Z. M. Ariola, J. W. Klop, J. R. Kennaway, F. J. de Vries, and M. R. Sleep. Syntactic definitions of undefined: On defining the undefined. In Proc. TACS 94, Sendai, Japan, 1994.
10. Arvind, L.-Augusston, J. Hicks, R. S. Nikhil, S. Peyton-Jones, J. Stoy, and W, Williams. pH: A Parallel Haskell. Technical report, MIT Laboratory for Computer Science, September 1993.
11. 3: an implicitly parallel λ-calculus with letrec, synchronization and side-effects. Technical Report 393, MIT Laboratory for Computer Science, 1997.
12. A. Asperti and C. Laneve. Interaction systems I: The theory of optimal reductions. Mathematical structures for computer science, 4:457-504, 1994.
13. H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam, 1984.
14. H. P. Barendregt, M. C. J. D. van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Term graph rewriting. In J. W. de Bakker, A. 3. Nijman, and P. C. Treleaven, editors, Proc. Conference on Parallel Architecture and Languages Europe (PARLE '87), Eindhoven, The Netherlands, Springer-Verlag LNCS 259, pages 141-158, 1987.
15. Z. Benaissa, P. Lescanne, and K.H. Rose. Modeling sharing and recursion for weak reduction strategies using explicit substitution. In PLIP'96, 1996.
16. S. Billot and B. Lang. The structure of shared forests in ambiguous parsing. In Proceedings of the Twenty-Seventh Annual Meeting of the Association for Computational Linguistics, 1989. Association for Computational Linguistics
17. B. Harper. Introduction to Standard ML. Technical report, ECS-LFCS-86-14, Laboratory for the Foundation of Computer Science, Edinburgh University, 1986.
18. M. Hasegawa. Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In Proc. Conference on Typed Lambda Calculi and Applications, April 1997.
19. P. Hudak, S. Peyton Jones, P. Wadler, B. Boutel, J. Fairbairn, J. Fasel, K. Hammond, J. Hughes, T. Johnsson, D. Kieburtz, R. Nikhil, W. Partain, and J. Peterson. Report on the programming language Haskell. ACM SIGPLAN Notices, 27(5):1-64, 1992.
20. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. JACM, 27(4), 1980.
21. J. R, Kennaway, J. W, Klop, M. E. Sleep, and F. J. de Vries. Infinitary lambda calculus. In Proc. Rewriting Techniques and Applications, Kaiserslautern, 1995.
22. P. Klint. A meta-environment for generating programming environments. In Algebraic Methods II: Theory, Tools and Applications. Springer-Verlag LNCS 4&0, pages 105-124, 1991.
23. P. Klint and E. Visser. Using filters for the disambiguation of context-free grammars. In G. Pighizzini and P. San Pietro, editors, Proc. ASMICS Workshop on Parsing Theory, pages 1-20, Milano, Italy, October 1994. Tech. Rep. 126-1994, Dipartimento di Scienze delL'lnformazione, Università di Milano.
24. Y. Lafont. Interaction nets. In Proc. A CM Conference on Principles of Programming Languages, San Francisco, 1990.
25. J. Launchbury. A natural semantics for lazy evaluation. In Proc. ACM Conference on Principles of Programming Languages, pages 144-154, 1993.
26. J.-J, Levy. An algebraic interpretation of the λ/?κ-calculus and an application of a labelled λ-calculus. Theoretical Computer Science, 2(1):97-114, 1976.
27. J.-J. Levy. Reductions Correctes et Optimales dans le Lambda-Calcul. PhD thesis, Universite Paris VII, October 1978.
28. I.C. Mackie. The geometry of implementation. PhD thesis, University of London, 1994.
29. J. Maraist, M. Odersky, D. Turner, and P. Wadler. Call-by-name, call-by-value, call-by-need, and the linear lambda calculus. In Proc. of Mathematical Foundations of Programming Semantics (MFPS), 1995.
30. E. Moggi. Computational lambda calculus and monads. Technical Report ECS-LFCS-88-86, Edinburgh University, 1988.
31. J. Niehren. Functional computation as concurrent computation. In Proc. ACM Conference on Principles of Programming Languages, pages 333-343, 1996.
32. R. S. Nikhil. Id (version 90.1) reference manual. Technical Report 284-2, MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA 02139, 1991.
33. S. L. Peyton Jones. The implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, N.J., 1987.
34. G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125-159, 1975.
35. K. H. Rose. Explicit cyclic substitutions. In M. Rusinowitch and J. L. Rémy, editors, Proc. 3rd International Workshop on Conditional Term Rewriting Systems (CTRS-92), Pont-à-Mousson, France, Springer-Verlag LNCS 656, pages 36-50, 1992.
36. D. Sangiorgi and R. Milner. Techniques of "weak bisimulation up to." Technical report, 1993.
37. P. Selinger. Order-incompleteness and finite lambda models. In Proc. Symposium on Logic in Computer Science (LICS'96), 1996.
38. M. Tomita. Efficient Parsing for Natural Languages. A Fast Algorithm for Practical Systems. Iíluwer Academic Publishers, 1985.
39. C. Wadsworth. Semantics and Pragmatics of the Lambda-Calculus. 1971. PhD thesis, University of Oxford.