Sound and Complete Type Inference for a Systems Programming Language

Authors:
Swaroop Sridhar;Jonathan S. Shapiro;Scott F. Smith
Affiliations:
Department of Computer Science, The Johns Hopkins University,;Department of Computer Science, The Johns Hopkins University,;Department of Computer Science, The Johns Hopkins University,
Venue:
APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Year:
2008

Citing 17
Cited 0

Imperative functional programming

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Qualified types: theory and practice

Qualified types: theory and practice
Simple imperative polymorphism

Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
TIL: a type-directed optimizing compiler for ML

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
A sound polymorphic type system for a dialect of C

Science of Computer Programming - Special issue on the 6th European symposium on programming
EROS: a fast capability system

Proceedings of the seventeenth ACM symposium on Operating systems principles
The Definition of Standard ML

The Definition of Standard ML
A Network Protocol Stack in Standard ML

Higher-Order and Symbolic Computation
Unboxed Values as First Class Citizens in a Non-Strict Functional Language

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Cyclone: A Safe Dialect of C

ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Global variables in Haskell

Journal of Functional Programming
Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))

Java(TM) Language Specification, The (3rd Edition) (Java (Addison-Wesley))
High-level views on low-level representations

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Javari: adding reference immutability to Java

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Quantified types in an imperative language

ACM Transactions on Programming Languages and Systems (TOPLAS)
Flow-insensitive type qualifiers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference for unboxed types and first class mutability

Proceedings of the 3rd workshop on Programming languages and operating systems: linguistic support for modern operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new type system designed for safe systems programming. The type system features a new mutability model that combines unboxed types with a consistent typing of mutability. The type system is provably sound, supports polymorphism, and eliminates the need for alias analysis to determine the immutability of a location. A sound and complete type inference algorithm for this system is presented.