An Incremental Type Inference System for the Programming Language Id

Abstract

Modern computing environments strive to be robust and reliable, and at the same time, aim at providing enough flexibility to an interactive user to edit, debug, and test programs easily and efficiently. Strongly typed languages satisfactorily meet the former goal by guaranteeing that type-consistent programs will not incur run-time type-errors. But most programming environments for such languages have to sacrifice the flexibility of interactive and incremental program development in order to achieve this consistency over the whole program. The problem is further complicated by the presence of polymorphism in many of these languages, where the definition of type- consistency is one of inclusion, rather than equality. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1990
Accession Number
ADA230085

Entities

People

  • Shail A. Gupta

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • C4I
  • Engineered Resilient Systems

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Application Software
  • Classification
  • Compilers
  • Computational Complexity
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Debugging
  • Department Of Defense
  • Language
  • Notation
  • Programming Languages
  • Reliability
  • Resilience

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms
  • AI & ML - Machine Translation