Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

APLAS
2008
ACM

favoriteEmaildiscussreport

98views Programming Languages» more APLAS 2008»

Sound and Complete Type Inference for a Systems Programming Language

14 years 26 days ago

Sound and Complete Type Inference for a Systems Programming Language

Download www.cs.jhu.edu

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.

Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smi

Real-time Traffic

APLAS 2008 | Mutability | Programming Languages | Type Inference Algorithm | Type System |

claim paper

Related Content

» Type Inference with Rank 1 Polymorphism for TypeDirected Compilation of ML

» Coercions in a polymorphic type system

» A Generalization of Hybrid LetPolymorphic Type Inference Algorithms

» Type inference and strong static type checking for Promela

» Type Systems for Distributed Data Structures

» Gradual typing with unificationbased inference

» Type classes with more higherorder polymorphism

» Principal Type Schemes for Modular Programs

» Polymorphic Type Inference and Assignment

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	APLAS
Authors	Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smith

Comments (0)