Polymorphic Typing of Variables and References

Abstract

In this article we consider the polymorphic type checking of an imperative language. Our language contains variables, first-class references (pointers), and first-class functions. Variables, as in traditional imperative languages, are implicitly dereferenced, and their addresses (L-values) are not first-class values. Variables are easier to type check than references and, in many cases, lead to more general polymorphic types. We present a polymorphic type system for our language and prove that it is sound. Programs that use variables sometimes require weak types, as in Tofte's type system for Standard ML, but such weak types arise far less frequently with variables than with references.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1996
Accession Number
ADA495097

Entities

People

  • Dennis Volpano
  • Geoffrey B. Smith

Organizations

  • Florida International University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Computer Programming
  • Computer Science
  • Computers
  • Information Operations
  • Language
  • New Jersey
  • Programming Languages
  • Schools
  • Semantics
  • Standards
  • Test And Evaluation
  • Universities

Readers

  • Computational Linguistics