J. B. Wells, René Vestergaard  Home/Search
Context Related
| cee.hw.ac.uk/~jbw/...es:ESOP2000.ps.gz macs.hw.ac.uk/~jbw...es:ESOP2000.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) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Modules and linking are usually formalized by encodings which use the -calculus, records (possibly dependent), and possibly some construct for recursion. In contrast, we introduce the m-calculus, a calculus where the primitive constructs are modules, linking, and the selection and hiding of module components. The m-calculus supports smooth encodings of software structuring tools such as functions (- calculus), records, objects (&-calculus), and mutually recursive definitions. The... (Update)
Context of citations to this paper: More
.... Odersky and Wadler [7] and a formal semantics was given by Bruce [8] Recursive modules have also been a focus of research [16, 18, 11, 2, 3, 37]. All of this work has been based on allowing mutually recursive definitions (sometimes including type definitions) to be...
Cited by: More
Toward a General Theory of Names, Binding and Scope - James Cheney University (Correct)
Call-by-Value Mixin Modules - Reduction Semantics, Side.. - Hirschowitz, Leroy.. (2004) (Correct)
Abstractions for Component-Based Programming with Dynamic.. - Dominic Duggan Dept (2001) (Correct)
Similar documents (at the sentence level):
38.4%: Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (Correct)
Active bibliography (related documents): More All
0.5: A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
0.5: Type Reconstruction for Variable-Arity Procedures - Dzeng, Haynes (1994) (Correct)
0.3: Programming Languages for Reusable Software Components - Flatt (1999) (Correct)
Similar documents based on text: More All
0.4: Typability and Type Checking in System F Are Equivalent and.. - Wells (1998) (Correct)
0.3: The Essence of Principal Typings - Wells (2002) (Correct)
0.3: M-Calculus: A Higher-Order Distributed Process Calculus - Schmitt, Stefani (2001) (Correct)
Related documents from co-citation: More All
6: Units: Cool modules for HOT languages - Flatt, Felleisen - 1998
6: Mixin modules - Duggan, Sourelis - 1996
6: A type theoretic approach to higher-order modules with sharing - Harper, Lillibridge - 1994
BibTeX entry: (Update)
Joe Wells and Rene Vestergaard. Equational reasoning for linking with first-class primitive modules. In NN, editor, Proceedings of ESOP'00. To appear, 2000. 14 http://citeseer.ist.psu.edu/wells00equational.html More
@article{ wells00equational,
author = "J. B. Wells and Ren{\'e} Vestergaard",
title = "Equational Reasoning for Linking with First-Class Primitive Modules",
journal = "Lecture Notes in Computer Science",
volume = "1782",
pages = "412--??",
year = "2000",
url = "citeseer.ist.psu.edu/wells00equational.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
862 The Java Language Specification - Gosling, Joy et al. - 1996
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
215 A type-theoretic approach to higher-order modules with shari.. - Harper, Lillibridge
174 Springer-Verlag (context) - Abadi, Cardelli et al. - 1996
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 - 1997
80 Programming in Ada (context) - Barnes - 1996
76 Modularity meets inheritance - Bracha, Lindstrom - 1992
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
60 Modular object-oriented programming with units and mixins - Findler, Flatt - 1998
57 A record calculus based on symmetric concatenation - Harper, Pierce - 1991
51 Prentice Hall (context) - Harbison - 1991
48 What is a recursive module - Crary, Harper et al. - 1997
48 Translucent Sums: A Foundation for Higher-Order Module Syste.. - Lillibridge - 1997
48 A primitive calculus for module systems - Ancona, Zucca - 1999
38 Using parameterized signatures to express modular structure - Jones - 1996
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
25 A calculus for link-time compilation - Machkasova, Turbak - 2000
24 th ACM Symp (context) - Rec - 1999
21 Lambda calculus with explicit recursion - Ariola, Klop - 1997
20 Cyclic lambda calculi - Ariola, Blom - 1997
17 Confluent equational reasoning for linking with first-class .. - Wells, Vestergaard - 1999
14 Theory and Practice of Object Systems (context) - Riecke, Stone et al.
14 Principles of Programming Languages (context) - Rec, Ann - 1994
11 Extending the scope of syntactic abstraction - Waddell, Dybvig
11 The Programming Language Jigsaw: Mixins (context) - Bracha - 1992
10 An algebra of mixin modules - Ancona, Zucca - 1998
10 an and C. Sourelis. Parameterized modules, recursive modules.. (context) - Dugg - 1998
8 From Hindley-Milner types to first-class structures (context) - Jones - 1995
5 Toward a formal theory of extensible software - Krishnamurthi, Felleisen - 1998
4 Lambda calculi plus letrec (context) - Ariola, Blom - 1997
3 Types for Modules - Russo - 1998
2 Projective ML (context) - R'emy - 1992
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