Explicit Environments

Fundamenta Informaticae

Volumn 45, Issue 1-2, 2001, Pages 79-115

  Sato, Masahiko ^a   Sakurai, Takafumi ^b   Burstall, Rod ^c  

^a KYOTO UNIVERSITY   (Japan)

^b CHIBA UNIVERSITY   (Japan)

^c UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039740328     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. Abadi, M., Cardelli, L., Curien, P.-L., Levy, J.-J.: Explicit substitutions, Journal of Functional Programming, 1, 1991, 375-116.
2. Abelson, H., Sussman, G. J.: Structure and Interpretation of Computer Programs, The MIT Press, 1985.
3. Barendregt, H. P.: The Lambda Calculus, Its Syntax and Semantics, North-Holland, 1981.
4. Benaissa, Z. E. A., Briand, D., Lescanne, P., Maibaum, T. S. E.: λυ, a calculus of explicit substitutions which preserves strong normalization, Journal of Functional Programming, 6, 1996, 699-722.
5. Bloo, R., Geuvers, H.: Explicit substitution On the edge of strong normalization, Theoretical Computer Science, 211, 1999, 375-395.
6. Bloo, R., Rose, K.: Preservation of strong normalization in named lambda calculi with explicit substitution and garbage collection, Proc. CSN'95 (Computer Science in Netherlands) (van Vliet J. C., Ed.), 1995. (ftp://ftp.diku.dk/diku/semantics/papers/D-246.ps)
7. Cardelli, L., Mitchell, J. C.: Operations on records, Mathematical Structures in Computer Science, 1, 1991, 3-48.
8. Cardelli, L., Wegner, P.: On understanding types, data abstraction, and polymorphism, Computing Surveys, 17, 1985, 471-522.
9. Di Cosmo, R., Kesner, D.: Strong normalization of explicit via cut elimination in proof nets, Proc. 12th IEEE Symposium on Logic in Computer Science, 1997, 35-47.
10. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types, Cambridge University Press, 1989.
11. Hardin, T.: Confluence results for the pure strong categorical combinatory logic CCL: λ-calculi as subsystems of CCL, Theoretical Computer Science, 46, 1986, 305-312.
12. Hashimoto, M., Ohori, A.: A typed context calculus, Preprint RIMS-1098, Research Institute for Mathematical Sciences, Kyoto University, 1996. (Journal version is to appear in Theoretical Computer Science.)
13. Hashimoto, M., Ohori, A.: A typed context calculus, Preprint RIMS-1098, Research Institute for Mathematical Sciences, Kyoto University, 1996. (Journal version is to appear in Theoretical Computer Science.)
14. Kamareddine, F., Ríos, A.: Extending a λ-calculus with explicit substitution which preserves strong normalization into a confluent calculus on open terms, Journal of Functional Programming, 7, 1997, 395-420.
15. Kamareddine, F., Ríos, A., Wells, J. B.: Calculi of generalized β-reduction and explicit substitutions: The type free and simply typed versions, Journal of Functional and Logic Programming, 1998(5), 1998, 1-44.
16. Lampson, B., Burstall, R.: Pebble, a kernel language for modules and abstract data types, Information and Computation, 76, 1988, 278-346.
17. McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, Part I, Comm. ACM, 3, 1960, 184-195.
18. Melliès, P.-A.: Typed λ-calculi with explicit substitutions may not terminate, Proc. Second International Conference on Typed Lambda Calculi and Applications, LNCS 902, 1995, 328-349.
19. Nishizaki, S.: ML with first-class environments and its type inference algorithm, Logic, Language and Computation, Festschrift in Honor of Satoru Takasu (N. D. Jones, M. Hagiya, M. Sato, Eds.), LNCS 792, 1994, 95-116.
20. Nishizaki, S.: Simply Typed Lambda Calculus with First-Class Environments, vol. 30(6), Publications of the Research Institute for Mathematical Sciences, Kyoto University, 1994.
21. Takahashi, M.: Parallel reductions in λ-calculus, Journal of Symbolic Computation, 7, 1989, 113-123.
22. Takeuti, G.: Proof Theory, North-Holland, 1975. Fundamenta lnformaticae 45 (2001 ) 117-121