Tom Hirschowitz  Home/Search
Context
Related
| enslyon.fr/LIP/Pub/R...RR200346.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: enslyon.fr/LIP/Pub/rr2003 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Mixin modules are a notion of modules that allows cross-module recursion and late binding, two features missing in ML-style modules. They have been well de ned in a call-by-name setting, but in a call-by-value setting, they tend to con ict with the usual static restrictions on recursive de nitions. Moreover, the semantics of instantiation has to specify an order of evaluation, which involves a di cult design choice. Previous proposals [12, 14] rely on the dependencies between components... (Update)
Active bibliography (related documents): More All
0.7: Call-by-Value Mixin Modules - Reduction Semantics, Side.. - Hirschowitz, Leroy.. (Correct)
0.5: HARE: An Optimizing Portable Compiler for Scheme - Teodosiu (Correct)
0.4: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998) (Correct)
Similar documents based on text: More All
0.5: Decidable and Undecidable Problems About Quantum Automata - Blondel, Jeandel, Koiran (Correct)
0.5: Parallel Evaluation of Relational Queries on a Network of .. - Brunie, Exbrayat, Flory (1999) (Correct)
0.4: Remote object detection in cluster-based Java - Antoniu, Hatcher (2001) (Correct)
BibTeX entry: (Update)
@misc{ hirschowitz-rigid,
author = "Tom Hirschowitz",
title = "Rigid Mixin Modules",
url = "citeseer.ist.psu.edu/hirschowitz03rigid.html" }
Citations (may not include all citations):521 Compiling with continuations (context) - Appel - 1992
215 A type-theoretic approach to higherorder modules with sharin.. - Harper, Lillibridge - 1994
185 nition of Standard ML (context) - Milner, Tofte et al. - 1990
128 and separate compilation (context) - Leroy, modules - 1994
122 and modularization (context) - Cardelli, linking - 1997
94 Units: cool modules for HOT languages - Flatt, Felleisen - 1998
67 Mixin modules - Duggan, Sourelis - 1996
48 A primitive calculus for module systems - Ancona, Zucca - 1999
48 What is a recursive module - Crary, Harper et al. - 1999
31 Mixin modules in a call-by-value setting - Hirschowitz, Leroy - 2002
25 A calculus for link-time compilation - Machkasova, Turbak - 2000
21 Software and documentation available on the Web (context) - Leroy, Doligez et al. - 1996
14 Modularity and Multiple Inheritance (context) - Bracha, Language et al. - 1992
8 Mixin modules and computational eects - Ancona, Fagorzi et al. - 2003
8 Towards a practical type theory for recursive modules - Dreyer, Harper et al. - 2001
7 A reduction semantics for call-by-value mixin modules - Hirschowitz, Leroy et al. - 2003
6 Compilation of extended recursion in call-by-value functiona.. - Hirschowitz, Leroy et al. - 2003
6 Equational reasoning for linking with rst-class primitive m.. (context) - Wells, Vestergaard - 2000
2 Lisp and Functional Programming (context) - MacQueen, Standard - 1984
1 Call-by-value mixin modules (context) - Hirschowitz - 2003
http://www.plt-scheme
Documents on the same site (http://www.ens-lyon.fr/LIP/Pub/rr2003.html): More
A Brief Survey Of The Theory Of The π-Calculus - Hirschkoff (2003) (Correct)
A simple test qualifying the accuracy of Horner's rule for.. - Boldo, Daumas (2003) (Correct)
A Linear Algorithm For Real-Time Scheduling With Optimal.. - Gaujal, Navet, Walsh (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC