See this document in CiteSeerX!

A Computationally Sound Call-by-Value Module Calculus (2001)  (Make Corrections)  
Elena Machkasova, Franklyn A. Turbak



  Home/Search   Context   Related

 
View or download:
wellesley.edu/~fturbak/pub...modules.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wellesley.edu/~fturbak/pu...index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We present a call-by-value module calculus that serves as a framework for formal reasoning about simple module transformations. The calculus is stratified into three levels: a term calculus, a core module calculus, and a linking calculus. At each level, we define both a calculus reduction relation and a small-step operational semantics and relate them by a computational soundness property: if two terms are equivalent in the calculus, then they have the same observable outcome in the... (Update)

Active bibliography (related documents):   More   All
0.7:   A Calculus for Link-time Compilation - Machkasova, Turbak (2000)   (Correct)
0.7:   Compiling with Polymorphic and Polyvariant Flow Types - Turbak, Dimock, Muller, Wells (1997)   (Correct)
0.7:   Program Representation Size in an Intermediate.. - Dimock.. (2000)   (Correct)

Similar documents based on text:   More   All
0.5:   Cycle Therapy: - Prescription For Fold (2001)   (Correct)
0.2:   Diagrams for Meaning Preservation - Wells Detlef Plump (2003)   (Correct)
0.1:   A Module Calculus for Featherweight Java Towards Smart Java.. - Ancona, Zucca (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ machkasova-computationally,
  author = "Elena Machkasova and Franklyn A. Turbak",
  title = "A Computationally Sound Call-by-Value Module Calculus",
  url = "citeseer.ist.psu.edu/machkasova01computationally.html" }
Citations (may not include all citations):
906   A structural approach to operational semantics - Plotkin - 1981
729   The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
259   Combinatory Logic (context) - Curry, Feys - 1958
233   Natural semantics (context) - Kahn - 1987
218   The mechanical evaluation of expressions (context) - Landin - 1964
215   A type-theoretic approach to higher-order modules with shari.. - Harper, Lillibridge
179   The lazy lambda calculus - Abramsky - 1990
169   The call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
169   The call-by-need lambda calculus - Ariola, Felleisen - 1997
138   Typed closure conversion - Minamide, Morrisett et al.
138   The revised report on the syntactic theories of sequential c.. - Felleisen, Hieb - 1992
128   and separate compilation (context) - Leroy, modules
122   and modularization (context) - Cardelli, linking
118   What are principal typings and what are they good - Jim
94   Units: Cool modules for HOT languages - Flatt, Felleisen - 1998
87   call-by-value and the lambda calculus (context) - Plotkin - 1975
76   Control operators (context) - Felleisen, Friedman - 1986
67   Mixin modules - Duggan, Sourelis - 1996
67   Componential set-based analysis - Flanagan, Felleisen
62   Type-safe linking and modular assembly language - Glew, Morrisett
59   Smartest recompilation - Shao, Appel - 1993
49   and type-based closure analysis (context) - Banerjee, modular
48   Operationally-based theories of program equivalence - Pitts - 1997
48   A primitive calculus for module systems - Ancona, Zucca
48   What is a recursive module - Crary, Harper et al. - 1999
47   Principality and decidable type inference for finite-rank in.. - Kfoury, Wells
45   A modular module system - Leroy - 1996
42   Operational reasoning for functions with local state - Pitts, Stark - 1998
35   An abstract standardisation theorem - Gonthier, Levy et al. - 1992
35   Typed cross-module compilation - Shao - 1998
32   A fragment calculus --- towards a model of separate compilat.. - Drossopoulou, Eisenbach et al. - 1999
27   Lambda-splitting: A higher order approach to cross-module op.. - Blume, Appel
25   A calculus for link-time compilation - Machkasova, Turbak
24   Constraint systems for useless variable elimination - Wand, Siveroni
24   th ACM Symp (context) - Rec - 1997
24   th ACM Symp (context) - Rec - 1999
23   Type systems for closure conversion - Hannan - 1995
23   Computations in orthogonal rewriting systems (context) - Huet, Levy - 1991
22   Transparent modules with fully syntactic signatures - Shao - 1999
21   Lambda calculus with explicit recursion - Ariola, Klop - 1997
20   better late than never (context) - Plezbert, Cytron et al.
20   Cyclic lambda calculi - Ariola, Blom - 1997
18   Safe and flexible dynamic linking of native code - Hicks, Weirich et al.
18   A calculus for compiling and linking classes - Fisher, Reppy et al.
17   Confluent equational reasoning for linking with first-class .. - Wells, Vestergaard - 1999
16   Sharing in typed module assembly language - Duggan
15   ective link-time optimization of Modula-3 programs (context) - Fernandez - 1995
14   rd ACM Symp (context) - Conf, POPL - 1996
13   th European Symp (context) - Languages - 2000
10   Higher-order uncurrying (context) - Hannan, Hicks - 1998
10   an and C. Sourelis. Parameterized modules, recursive modules.. (context) - Dugg - 1998
8   Lightweight closure conversion - Steckler, Wand - 1997
7   Flow-directed lightweight closure conversion - Siskind - 1999
6   Functioning without closure: Type-safe customized function r.. - Dimock, Westmacott et al. - 2001
6   ACM Symp (context) - Conf, st - 1994
3   Standardization and evaluation in Combinatory Reduction Syst.. - Wells, Muller - 2000
2   Denotational semantics using an operationally-based term mod.. - Wand, Sullivan
2   Non-dependent types for Standard ML modules - Russo
1   on Principles and Practice of Declarative Programming (context) - Nadathur, Proc - 1999
1   Proceedings of the Third Workshop on Types in Compilation (context) - of, Workshop et al. - 2001

Documents on the same site (http://cs.wellesley.edu/~fturbak/pubs/index.html):   More
Relating Typability and Expressiveness in Finite-Rank.. - Kfoury, Mairson (1999)   (Correct)
Robotic Design Studio: Exploring the Big Ideas of Engineering.. - Turbak, Berg   (Correct)
Program Representation Size in an Intermediate.. - Dimock.. (2001)   (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