Programmable environment calculus as theory of dynamic software evolution

International Workshop on Principles of Software Evolution (IWPSE)

Volumn 2000-January, Issue , 2000, Pages 221-225

  Nishizaki, Shin Ya ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTER SOFTWARE; DIFFERENTIATION (CALCULUS); MAPPING;

DYNAMIC CLASS LOADING; DYNAMIC EVOLUTION; EXPLICIT SUBSTITUTIONS; FIRST-CLASS ENVIRONMENTS; IMPORTANT FEATURES; SOFTWARE EVOLUTION; THEORETICAL STUDY; THEORY OF DYNAMICS;

DYNAMICS;

EID: 84949792474     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPSE.2000.913242     Document Type: Conference Paper

References (17)

1. M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375-416, October 1991.
2. P.-L. Curien. An abstract framework for environment machines. Theoretical Comput. Sci., 82:389-402, 1991.
3. P.-L. Curien, T. Hardin, and J.-J. Lévy. Confluence properties of weak and strong calculi of explicit substitutions. J. ACM, 43(2):362-397, March 1996.
4. D. Dean. Formal Aspects of Mobile Code Security. PhD thesis, Princeton University, January 1999.
5. D. Gelernter, S. Jagannathan, and T. London. Environments as first-class objects. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 98-110, 1987.
6. ™ 2 Platform Security Architecture, API Design, and Implementation. Addison-Weslay, 1999.
7. C. Hanson. MIT Scheme Reference Manual. MIT, 1.62 edition, 1996.
8. B. Lampson and R. Burstall. Pebble, a kernel language for modules and abstract data types. Information and Computation, 16:278-346, 1988.
9. O. Laumann. Elk - The Extension Language Kit Scheme Reference, 1995.
10. ™ Virtual Machine Specification, Second Edition. Addison-Weslay, 1999.
11. S. Nishizaki. ML with first-class environments and its type inference algorithm. In Logic, Language and Computation (Lecture Notes in Computer Science, vol. 792), pages 95-116. Springer, 1994.
12. S. Nishizaki. Simply typed lambda calculus with first-class environments. Publication of Research Institute for Mathematical Sciences Kyoto University, 30(6):1055-1121, 1995.
13. S. Nishizaki. Polymorphic environment calculus and its type inference algorithm. Higher-Order and Symbolic Computation (in printing), 13(3), 2000.
14. S. Nishizaki and Y. Akama. Translations of first-class environments to records. In 1st International Workshop on Explicit Substitutions, 1998.
15. M. Odersky. A functional theory of local names. In Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pages 48-59, 1994.
16. C. Queinnec and D. D. Roure. Sharing code through first-class environments. In Proceedings of the 1996 ACM SIGPLAN international conference on Functional programming, pages 251-261, 1996.
17. M. Sato, T Sakurai, and R. Burstall. Explicit environments. In Typed Lambda Calculi and Applications, 1999.