Sciweavers

479 search results - page 1 / 96
» Sound and Complete Type Inference for a Systems Programming ...
Sort
View
APLAS
2008
ACM
13 years 6 months ago
Sound and Complete Type Inference for a Systems Programming Language
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 ...
Swaroop Sridhar, Jonathan S. Shapiro, Scott F. Smi...
ICFP
1999
ACM
13 years 8 months ago
Type Inference with Rank 1 Polymorphism for Type-Directed Compilation of ML
This paper defines an extended polymorphic type system for an ML-style programming language, and develops a sound and complete type inference algorithm. Different from the conve...
Atsushi Ohori, Nobuaki Yoshida
MSCS
2008
87views more  MSCS 2008»
13 years 4 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
APLAS
2000
ACM
13 years 9 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
SCP
2010
155views more  SCP 2010»
13 years 2 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay