rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Types in Compilation
    sub title: Third International Workshop, TIC 2000, Montreal, Canada, September 21, 2000. Revised Selected Papers
  name:
    name part: Harper, Robert.
    role:
      role term: editor.
    role:
      role term: edt
    role:
      role term: http://id.loc.gov/vocabulary/relators/edt
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2001
    edition: 1st ed. 2001.
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 214 p. online resource.
  abstract: The importance of typed languages for building robust software systems is, by now, an undisputed fact. Years of research have led to languages with richly expressive, yet easy to use, type systems for high-level programming languages. Types provide not only a conceptual framework for language designers, but also a ord positive bene ts to the programmer, principally the ability to express and enforce levels of abstraction within a program. Early compilers for typed languages followed closely the methods used for their untyped counterparts. The role of types was limited to the earliest s- ges of compilation, and they were thereafter ignored during the remainder of the translation process. More recently, however, implementors have come to - cognize the importance of types during compilation and even for object code. Several advantages of types in compilation have been noted to date: { They support self-checking by the compiler. By tracking types during c- pilation it is possible for an internal type checker to detect translation errors at an early stage, greatly facilitating compiler development. { They support certi cation of object code. By extending types to the ge- rated object code, it becomes possible for a code user to ensure the basic integrity of that code by checking its type consistency before execution. { They support optimized data representations and calling conventions, even in the presence of modularity. By passing types at compile-, link-, and even run-time, it is possible to avoid compromises of data representation imposed by untyped compilation techniques.
  table of contents: Types in Compilation -- Sound and Complete Elimination of Singleton Kinds -- Program Representation Size in an Intermediate Language with Intersection and Union Types -- An Abstract Model of Java Dynamic Linking and Loading -- Sharing in Typed Module Assembly Language -- Scalable Certification for Typed Assembly Language -- Safe and Flexible Dynamic Linking of Native Code -- Alias Types for Recursive Data Structures.
  note: edited by Robert Harper.
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: QA76.7-76.73
  classification: QA76.76.C65
  classification: 005.13
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 2071
  identifier: 9783540453321
  identifier: https://doi.org/10.1007/3-540-45332-6
  record info:
    record creation date: 121227
    record change date: 20191025092421.0
    record identifier: 978-3-540-45332-1