Sciweavers

429 search results - page 22 / 86
» Polymorphic typed defunctionalization
Sort
View
JFP
2008
97views more  JFP 2008»
13 years 6 months ago
HM(X) type inference is CLP(X) solving
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
Martin Sulzmann, Peter J. Stuckey
OOPSLA
2010
Springer
13 years 6 months ago
Type classes as objects and implicits
Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important ch...
Bruno C. d. S. Oliveira, Adriaan Moors, Martin Ode...
OOPSLA
2010
Springer
13 years 6 months ago
Task types for pervasive atomicity
Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the nu...
Aditya Kulkarni, Yu David Liu, Scott F. Smith
PLDI
2012
ACM
11 years 10 months ago
Fast and precise hybrid type inference for JavaScript
JavaScript performance is often bound by its dynamically typed nature. Compilers do not have access to static type information, making generation of efficient, type-specialized m...
Brian Hackett, Shu-yu Guo
LISP
2002
107views more  LISP 2002»
13 years 7 months ago
Dependent Types for Program Termination Verification
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is sti...
Hongwei Xi