Mixin modules and computational effects

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

Volumn 2719, Issue , 2003, Pages 224-238

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

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS;

COMPUTATIONAL COMPONENTS; COMPUTATIONAL EFFECTS; EQUATIONAL REASONING; IMPERATIVE FEATURES; IMPERATIVE PROGRAMMING LANGUAGES; OPERATIONAL ASPECTS; PURELY FUNCTIONAL; REWRITE RULES;

CALCULATIONS;

EID: 8344263264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_20     Document Type: Article

References (22)

1. D. Ancona and E. Zucca. A primitive calculus for module systems. In G. Nadathur, editor, Principles and Practice of Declarative Programming, 1999, number 1702 in Lecture Notes in Computer Science, pages 62-79. Springer Verlag, 1999.
2. D. Ancona and E. Zucca. A calculus of module systems. Journal of Functional Programming, 12(2):91-132, March 2002.
3. G. Bracha and W. Cook. Mixin-based inheritance. In Proc. of the Joint ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications and the European Conference on Object-Oriented Programming, October 1990.
4. G. Boudol. The recursive record semantics of objects revisited. To appear in Journal of Functional Programming, 2002.
5. G. Bracha. The Programming Language JIGSAW: Mixins, Modularity and Multiple Inheritance. PhD thesis, Department of Comp. Sci., Univ. of Utah, 1992.
6. W.R. Cook. A Denotational Semantics of Inheritance. PhD thesis, Dept. of Computer Science, Brown University, 1989.
7. D. Duggan and C. Sourelis. Mixin modules. In Intl. Conf. on Functional Programming, Philadelphia, May 1996. ACM Press.
8. L. Erkök and J. Launchbury. Recursive monadic bindings. In Intl. Conf. on Functional Programming 2000, pages 174-185, 2000.
9. L. Erkök and J. Launchbury. A recursive do for Haskell. In Haskell Workshop'02, pages 29-37, 2002.
10. L. Erkök, J. Launchbury, and A. Moran. Semantics of fixIO. In FICS'01, 2001.
11. L. Erkök, J. Launchbury, and A. Moran. Semantics of value recursion for monadic input/output. Journal of Theoretical Informatics and Applications, 36(2):155-180, 2002.
12. R.B. Findler and M. Flatt. Modular object-oriented programming with units and mixins. In Intl. Conf. on Functional Programming 1998, September 1998.
13. M. Flatt and M. Felleisen. Units: Cool modules for HOT languages. In PLDI'98 - ACM Conf. on Programming Language Design and Implementation, pages 236-248, 1998.
14. A. V. Hense. Denotational semantics of an object-oriented programming language with explicit wrappers. Formal Aspects of Computing, 5(3):181-207, 1993.
15. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Conference record of POPL '94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 123-137, 1994.
16. T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In D. Le Métayer, editor, ESOP 2002 - Programming Languages and Systems, number 2305 in Lecture Notes in Computer Science, pages 6-20. Springer Verlag, 2002.
17. X. Leroy. Manifest types, modules and separate compilation. In Proc. 21st ACM Symp. on Principles of Programming Languages, pages 109-122. ACM Press, 1994.
18. E. Moggi and S. Fagorzi. A Monadic Multi-stage Metalanguage. In A.D. Gordon, editor, Foundations of Software Science and Computational Structures - FOSSACS 2003, volume 2620 of LNCS, pages 358-374. Springer Verlag, 2003.
19. E. Machkasova and F.A. Turbak. A calculus for link-time compilation. In G. Smolka, editor, ESOP 2000 - Programming Languages and Systems, number 1782 in Lecture Notes in Computer Science, pages 260-274, Berlin, 2000. Springer Verlag.
20. U. S. Reddy. Objects as closures: Abstract semantics of object-oriented languages. In Proc. ACM Conf. on Lisp and Functional Programming, pages 289-297, 1988.
21. Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994.
22. J.B. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In G. Smolka, editor, ESOP 2000 - Programming Languages and Systems, number 1782 in Lecture Notes in Computer Science, pages 412-428, Berlin, 2000. Springer Verlag.