Entry Shao:1995:TBC 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{Shao:1995:TBC,
  author =       "Zhong Shao and Andrew W. Appel",
  title =        "A type-based compiler for {Standard ML}",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "6",
  pages =        "116--129",
  month =        jun,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:06 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/207110/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/207110/p116-shao/",
  abstract =     "Compile-time type information should be valuable in
                 efficient compilation of statically typed functional
                 languages such as Standard ML. But how should
                 type-directed compilation work in real compilers, and
                 how much performance gain will type-based optimizations
                 yield? In order to support more efficient data
                 representations and gain more experience about
                 type-directed compilation, we have implemented a new
                 type-based middle end and back end for the Standard ML
                 of New Jersey compiler. We describe the basic design of
                 the new compiler, identify a number of practical
                 issues, and then compare the performance of our new
                 compiler with the old non-type-based compiler. Our
                 measurement shows that a combination of several simple
                 type-based optimizations reduces heap allocation by
                 36\%, and improves the already-efficient code generated
                 by the old non-type-based compiler by about 19\% on a
                 DECstation 5000.",
  acknowledgement = ack-nhfb,
  affiliation =  "Yale Univ., New Haven, CT, USA",
  annote =       "Published as part of the Proceedings of PLDI'95.",
  classification = "C6120 (File organisation); C6140D (High level
                 languages); C6150C (Compilers, interpreters and other
                 processors)",
  generalterms = "algorithms; languages; performance",
  keywords =     "Compile-time type information; Data representations;
                 DECstation 5000; Efficient code generation; Heap
                 allocation; Performance gain; Standard ML; Standard ML
                 of New Jersey compiler; Statically typed functional
                 languages; Type-based back end; Type-based compiler;
                 Type-based middle end; Type-directed compilation",
  subject =      "{\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Standard ML. {\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. {\bf D.3.3} Software, PROGRAMMING LANGUAGES,
                 Language Constructs and Features, Data types and
                 structures. {\bf D.3.3} Software, PROGRAMMING
                 LANGUAGES, Language Constructs and Features,
                 Procedures, functions, and subroutines. {\bf F.3.3}
                 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS,
                 Studies of Program Constructs, Functional constructs.",
  thesaurus =    "Data structures; Functional languages; Optimising
                 compilers",
}

Related entries