Sciweavers

237 search results - page 14 / 48
» Coercions in a polymorphic type system
Sort
View
CORR
2010
Springer
71views Education» more  CORR 2010»
13 years 5 months ago
Equality, Quasi-Implicit Products, and Large Eliminations
This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
Vilhelm Sjöberg, Aaron Stump
SE
2007
13 years 9 months ago
Rules for type-checking of parametric polymorphism in EMF generics
Abstract: The Eclipse infrastructure for modeling is based on EMF, an implementation of Essential MOF, the OMG standard for metamodeling. A recent addition to EMF has been parametr...
Miguel Garcia
APLAS
2008
ACM
13 years 9 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...
ESOP
2009
Springer
14 years 2 months ago
Practical Variable-Arity Polymorphism
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
T. Stephen Strickland, Sam Tobin-Hochstadt, Matthi...
ICFP
2008
ACM
14 years 7 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy