(Enter summary)
Abstract: To separately compile a program module in traditional
statically-typed languages, one has to manually write down
an import interface which explicitly specifies all the external
symbols referenced in the module. Whenever the definitions
of these external symbols are changed, the module has to be
recompiled. In this paper, we present an algorithm which
can automatically infer the "minimum" import interface for
any module in languages based on the Damas-Milner type
discipline (e.g., ML). By... (Update)
Cited by: More
Flexible Dynamic Linking for .NET - Anders Aaltonen Alex
(Correct)
Flexible Dynamic Linking - Buckley, Drossopoulou (2004)
(Correct)
Flexible Bytecode for Linking in .NET - Buckley, Murray, Eisenbach.. (2005)
(Correct)
Similar documents (at the sentence level):
69.6%: Smartest Recompilation - Shao, Appel (1993)
(Correct)
Active bibliography (related documents): More All
0.6: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.4: Compiling Standard ML For Efficient Execution On Modern Machines - Shao (1994)
(Correct)
0.2: A Type-Based Compiler for Standard ML - Zhong Shao (1994)
(Correct)
Similar documents based on text: More All
0.1: A Compilation Manager for Standard ML of New Jersey - Harper, Pfenning, Lee, Rollins (1994)
(Correct)
0.1: Callee-save Registers in Continuation-passing Style - Appel, Shao (1992)
(Correct)
0.1: An Empirical and Analytic Study of Stack vs. Heap Cost for.. - Appel, Shao (1993)
(Correct)
Related documents from co-citation: More All
23: and modularization (context) - Cardelli, linking - 1997
15: ACM Transactions on Programming Languages and Systems (context) - Harper, Mitchell et al. - 1992
14: What are principal typings and what are they good
- Jim - 1996
BibTeX entry: (Update)
Zhong Shao and Andrew Appel. Smartest recompilation. In Twentieth ACM Symposium on Principles of Programming Languages, pages 439--450, Charleston, SC, January 1993. http://citeseer.ist.psu.edu/article/shao93smartest.html More
@inproceedings{ shao93smartest,
author = "Zhong Shao and Andrew W. Appel",
title = "Smartest Recompilation",
booktitle = "Conference Record of the Twentieth Annual {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles of Programming Languages",
address = "Charleston, South Carolina",
pages = "439--450",
year = "1993",
url = "citeseer.ist.psu.edu/article/shao93smartest.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - Milner, Tofte et al. - 1990 ACM
634
A machine-oriented logic based on the resolution principle (context) - Robinson - 1965 ACM DBLP
343
Principal type-schemes for functional programs (context) - Damas, Milner - 1982 DBLP
202
Make -- a program for maintaining computer programs
- Feldman - 1979
191
Polymorphic type inference (context) - Leivant - 1983 ACM DBLP
183
Report on the programming language Haskell a non-strict (context) - Hudak, Jones et al. - 1992
178
Standard ML of New Jersey
- Appel, MacQueen - 1991 DBLP
163
Commentary on Standard ML (context) - Milner, Tofte - 1991 ACM
162
Unboxed objects and polymorphic typing
- Leroy - 1992 ACM DBLP
101
ACM Transactions on Programming Languages and Systems (context) - Schwanke, Kaiser - 1988
89
Systems programming with Modula (context) - Nelson - 1991
88
Typechecking records and variants in a natural extension of .. (context) - Remy - 1989 DBLP
87
Operational Semantics and Polymorphic Type Inference (context) - Tofte - 1987
58
Type inference in the presence of overloading (context) - Kaes - 1992
55
A compilation method for ML-style polymorphic record calculi
- Ohori - 1992 ACM DBLP
49
A theory of qualified types
- Jones - 1992 ACM DBLP
29
ACM Transactions on Programming Languages and Systems (context) - Tichy - 1986
27
Type Assignment in Programming Languages (context) - Damas - 1985
16
Abstract value constructors (context) - Aitken, Reppy - 1992
14
Xerox Palo Alto Research Center (context) - Mitchell, Maybury et al. - 1979
14
Incremental polymorphism
- Aditya, Nikhil - 1991 ACM DBLP
8
Principal signatures for high-order ML functors (context) - Tofte - 1992
6
SRC Modula-3 version (context) - Kalsow, Muller - 1991
6
Laboratory for Computer Science (context) - Gifford, reference et al. - 1987
5
Implementing Russell (context) - Boehm, Demers - 1986 ACM DBLP
5
Technical Report CS-TR (context) - Shao, Appel - 1992
3
separate compilation and reusability (context) - Levy - 1984
3
with Standard ML of New Jersey releases (context) - Rothwell, Tofte et al.
2
SourceGroup: A selective recompilation system for SML (context) - Rollins - 1991
2
personal communication (context) - Gansner, Labs - 1992
2
Technical Report TR-CSG-Memo (context) - Nikhil, reference - 1990
2
Pratical use of a polymorphic applicative language (context) - Lampson, Schmidt - 1983
2
Typage d'un systeme de modules parametriques avec partage: u.. (context) - Aponte - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.yale.edu/HTML/YALE/CS/HyPlans/shao-zhong/papers.html): More
Unrolling Lists - Zhong Shao (1994)
(Correct)
Type-Directed Continuation Allocation - Shao, Trifonov (1998)
(Correct)
Inferring Type Maps during Garbage Collection - Boehm, Shao (1993)
(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