Sciweavers

5 search results - page 1 / 1
» Principal Type Schemes for Gradual Programs
Sort
View
76
Voted
ESOP
2007
Springer
15 years 4 months ago
Principal Type Schemes for Modular Programs
Abstract. Two of the most prominent features of ML are its expressive module system and its support for Damas-Milner type inference. However, while the foundations of both these fe...
Derek Dreyer, Matthias Blume
155
Voted
POPL
2006
ACM
15 years 10 months ago
A polymorphic modal type system for lisp-like multi-staged languages
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno
116
Voted
FP
1995
156views Formal Methods» more  FP 1995»
15 years 2 months ago
Type Reconstruction for SCI
We present a type reconstruction algorithm for SCIR 10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cau...
Howard Huang, Uday S. Reddy
OOPSLA
1989
Springer
15 years 2 months ago
Static Type Inference for Parametric Classes
Method inheritance and data abstraction are central features of objectoriented programming that are attained through a hierarchical organization of classes. Recent studies have sh...
Atsushi Ohori, Peter Buneman
POPL
1992
ACM
15 years 2 months ago
A Compilation Method for ML-Style Polymorphic Record Calculi
Polymorphic record calculi have recently attracted much attention as a typed foundation for objectoriented programming. This is based on the fact that a function that selects a fi...
Atsushi Ohori