Entry Appel:1994:SCS from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Appel:1994:SCS,
  author =       "Andrew W. Appel and David B. MacQueen",
  title =        "Separate Compilation for {Standard ML}",
  journal =      j-SIGPLAN,
  volume =       "29",
  number =       "6",
  pages =        "13--23",
  month =        jun,
  year =         "1994",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/178243.178245",
  ISBN =         "0-89791-598-4",
  ISBN-13 =      "978-0-89791-598-4",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Wed Jun 18 16:26:55 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p13-appel/",
  abstract =     "Languages that support abstraction and modular
                 structure, such as Standard ML, Modula, Ada, and (more
                 or less) C++, may have deeply nested dependency
                 hierarchies among source files. In ML the problem is
                 particularly severe because ML's powerful parameterized
                 module (functor) facility entails dependencies among
                 implementation modules, not just among interfaces. To
                 efficiently compile individual modules in such
                 languages, it is useful (in ML, necessary) to infer,
                 digest, and cache the static environment resulting from
                 the compilation of each module. Our system provides a
                 simple model of compilation and linkage that supports
                 incremental recompilation (a restricted form of
                 separate compilation) with type-safe linkage. This
                 model is made available to user programs in the form of
                 a set of internal compiler modules, a feature that we
                 call the ``visible compiler''. The chief client of this
                 interface is the IRM incremental recompilation manager
                 from CMU.",
  acknowledgement = ack-nhfb,
  annote =       "Published as part of the Proceedings of PLDI'94.",
  classification = "C6110 (Systems analysis and programming); C6140D
                 (High level languages); C6150C (Compilers, interpreters
                 and other processors)",
  conflocation = "Orlando, FL, USA; 20-24 June 1994",
  conftitle =    "ACM SIGPLAN '94 Conference on Programming Language
                 Design and Implementation (PLDI)",
  corpsource =   "Princeton Univ., NJ, USA",
  keywords =     "abstraction; Ada; algorithms; C++; cache; CMU;
                 compilation; compile; deeply nested dependency
                 hierarchies; design; environment; high level languages;
                 incremental recompilation; incremental recompilation
                 manager; internal compiler modules; IRM; languages;
                 Modula; modular structure; parameterized module;
                 program compilers; programming; source files; Standard
                 ML; static environment; type-safe linkage; user
                 programs; visible compiler",
  sponsororg =   "ACM",
  subject =      "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, ML. {\bf D.3.3} Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features, Modules,
                 packages. {\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Compilers. {\bf F.3.3} Theory of
                 Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies
                 of Program Constructs, Type structure.",
  treatment =    "P Practical",
}

Related entries