A calculus for dynamic linking

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

Volumn 2841, Issue , 2003, Pages 284-301

  Ancona, Davide ^a   Fagorzi, Sonia ^a   Zucca, Elena ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEPENDENCY ANALYSIS; DYNAMIC LINKING; LANGUAGE LEVELS; MODEL DYNAMICS; PROGRAMMING ENVIRONMENT; SOFTWARE CONFIGURATION; SYNTACTIC NOTION; TYPE SYSTEMS;

CALCULATIONS;

EID: 0142218856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_23     Document Type: Article

References (14)

1. D. Ancona, S. Fagorzi, E. Moggi, and E. Zucca. Mixin Modules and Computational Effects. In International Colloquium on Automata, Languages and Programming 2003, 2003. To appear.
2. D. Ancona and E. Zucca. A calculus of module systems. Journ. of Functional Programming, 12(2):91-132, 2002.
3. G. Bierman, M. Hicks, P. Sewell, and G. Stoyle. Formalizing dynamic software updating (extended abstract). In USE'03 - Workshop on Unexpected Software Evolution, 2003.
4. L. Cardelli. Program fragments, linking, and modularization. In ACM Symp. on Principles of Programming Languages 1997, pages 266-277. ACM Press, 1997.
5. K. Crary, R. Harper, and S. Puri. What is a recursive module? In PLDI'99 - ACM Conf. on Programming Language Design and Implementation, 1999.
6. S. Drossopoulou. Towards an abstract model of Java dynamic linking and verfication. In R. Harper, editor, TIC'00 - Third Workshop on Types in Compilation (Selected Papers), volume 2071 of Lecture Notes in Computer Science, pages 53-84. Springer, 2001.
7. S. Drossopoulou, S. Eisenbach, and D. Wragg. A fragment calculus - towards a model of separate compilation, linking and binary compatibility. In Proc. 14th Ann. IEEE Symp. on Logic in Computer Science, July 1999.
8. S. Drossopoulou, G. Lagorio, and S. Eisenbach. Flexible models for dynamic linking. In European Symposium on Programming 2003, 2003.
9. R.B. Findler and M. Flatt. Modular object-oriented programming with units and mixins. In Intl. Conf. on Functional Programming 1998, September 1998.
10. D. Gelernter and N. Carriero. Coordination languages and their significance. Comm. ACM, 35(1):96-107, January 1992.
11. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In D. Le Métayer, editor, European Symposium on Programming 2002, number 2305 in Lecture Notes in Computer Science, pages 6-20. Springer, 2002.
12. X. Leroy. A modular module system. Journal of Functional Programming, 10(3): 269-303, May 2000.
13. E. Machkasova and F.A. Turbak. A calculus for link-time compilation. In European Symposium on Programming 2000, number 1782 in Lecture Notes in Computer Science, pages 260-274. Springer, 2000.
14. J.B. Wells and R. Vestergaard. Confluent equational reasoning for linking with first-class primitive modules. In European Symposium on Programming 2000, number 1782 in Lecture Notes in Computer Science, pages 412-428. Springer, 2000.