Joe Wells, René Vestergaard  Home/Search
Context Related
| cee.hw.ac.uk/~jbw/...:1999aug25.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: cee.hw.ac.uk/~jbw/papers/ (more) Homepages: J.Wells |
Rate this article:      (best)Comment on this article |
Abstract: Modules and linking are usually formalized by encodings which use the lambda calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we present the m-calculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of module components. In addition to supporting equational reasoning about modules and linking, the m-calculus allows smooth encodings of software structuring tools such as the lambda calculus, mutually... (Update)
Cited by: More
A Calculus for Dynamic Linking - Ancona, Fagorzi, Zucca (2003) (Correct)
Mixin Modules for Dynamic Rebinding - Davide Ancona Sonia (Correct)
Managing the Evolution of .NET Programs - Eisenbach, Jurisic, Sadler (Correct)
Similar documents (at the sentence level):
18.4%: Equational Reasoning for Linking with First-Class Primitive.. - Wells, Vestergaard (2000) (Correct)
Active bibliography (related documents): More All
2.9: Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (Correct)
0.4: A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
0.3: A Modular Interpreter In Scheme With Objects - Ganz, Friedman (2000) (Correct)
Similar documents based on text: More All
0.6: Cut Rules and Explicit Substitutions - Vestergaard, Wells (1999) (Correct)
0.4: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (Correct)
0.4: The Essence of Principal Typings - Wells (2002) (Correct)
Related documents from co-citation: More All
12: and modularization (context) - Cardelli, linking - 1997
9: A calculus of module systems - Ancona, Zucca - 2001
8: Mixin modules in a call-by-value setting - Hirschowitz, Leroy - 2002
BibTeX entry: (Update)
Joe Wells and Rene Vestergaard. Confluent Equational Reasoning for Linking with First-Class Primitive Modules. Technical report, Herriot-Watt University, August 1999. Also available from: http://www.cee.hw.ac.uk/jbw/papers/. http://citeseer.ist.psu.edu/article/wells99confluent.html More
@misc{ wells99confluent,
author = "Joe Wells and Ren{\'e} Vestergaard",
title = "Confluent Equational Reasoning for Linking with First-Class Primitive Modules",
text = "Joe Wells and Rene Vestergaard. Confluent Equational Reasoning for Linking
with First-Class Primitive Modules. Technical report, Heriot-Watt University,
August 1999. Also available from: http://www.macs.hw.ac.uk/\~{}jbw/papers/.",
year = "1999",
url = "citeseer.ist.psu.edu/article/wells99confluent.html" }
Citations (may not include all citations):384 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
380 The Java Language Specification (context) - Gosling, Joy et al. - 1996
215 A type-theoretic approach to higher-order modules with shari.. - Harper, Lillibridge
166 Classes and mixins - Flatt, Krishnamurthi et al. - 1998
128 and separate compilation (context) - Leroy, modules
122 and modularization (context) - Cardelli, linking - 1997
121 Higher-order modules and the phase distinction - Harper, Mitchell et al. - 1990
102 Type inference for record concatenation and multiple inherit.. - Wand - 1989
94 Units: Cool modules for HOT languages - Flatt, Felleisen - 1998
80 Programming in Ada (context) - Barnes - 1996
76 Modularity meets inheritance - Bracha, Lindstrom - 1992
74 equivalence (context) - Newman, with et al. - 1942
67 Mixin modules - Duggan, Sourelis - 1996
63 A lambda calculus of objects and method specialization - Fisher, Honsell et al. - 1994
62 Type-safe linking and modular assembly language - Glew, Morrisett
57 A record calculus based on symmetric concatenation - Harper, Pierce - 1991
57 Type inference for records in a natural extension of ML (context) - R'emy
51 Prentice Hall (context) - Harbison - 1991
48 Translucent Sums: A Foundation for Higher-Order Module Syste.. - Lillibridge - 1997
48 A primitive calculus for module systems - Ancona, Zucca - 1999
48 What is a recursive module - Crary, Harper et al. - 1999
47 Extensible records in a pure calculus of subtyping - Cardelli
38 Using parameterized signatures to express modular structure - Jones - 1996
34 Theoretical Aspects Of Object-Oriented Programming: Types (context) - Gunter, Mitchell - 1993
33 Subtyping constraints for incomplete objects (context) - Bono, Bugliesi et al.
32 A fragment calculus --- towards a model of separate compilat.. - Drossopoulou, Eisenbach et al. - 1999
29 A polymorphic type system for extensible records and variant.. - Gaster, Jones - 1996
26 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
24 th ACM Symp (context) - Rec - 1999
23 Typing record concatenation for free - R'emy
21 Lambda calculus with explicit recursion - Ariola, Klop - 1997
20 Cyclic lambda calculi - Ariola, Blom - 1997
17 Modular object-oriented programming with units and mixins (context) - Findler, Flatt - 1998
14 Theory and Practice of Object Systems (context) - Riecke, Stone et al.
14 Principles of Programming Languages (context) - Rec, Ann - 1994
12 Projective ML - R'emy - 1992
11 Explicit environments (context) - Sato, Burstall - 1998
11 The Programming Language Jigsaw: Mixins (context) - Bracha - 1992
10 An algebra of mixin modules - Ancona, Zucca - 1998
10 an and Constantinos Sourelis. Parameterized modules, recursi.. (context) - Dugg - 1998
9 A case study of typechecking with constrained types: Typing .. (context) - R'emy - 1995
8 From Hindley-Milner types to first-class structures (context) - Jones - 1995
6 A typed context calculus - Hashimoto, Ohori - 1997
4 and Rod Burstall (context) - Sato, Sakurai - 1999
4 Lambda calculi plus letrec (context) - Ariola, Blom - 1997
3 Types for Modules - Russo - 1998
3 Toward a formal theory of extensible software (context) - Krishnamurthi, Felleisen - 1998
2 Currently available at http://haskell (context) - non-strict, language et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cee.hw.ac.uk/~jbw/papers/): More
The Undecidability of Mitchell's Subtyping Relationship - Wells (1995) (Correct)
New Notions of Reduction and Non-Semantic Proofs of Strong.. - Kfoury, Wells (1995) (Correct)
Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (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