Sciweavers

429 search results - page 48 / 86
» Parameter-free polymorphic types
Sort
View
JFP
2008
125views more  JFP 2008»
14 years 11 months ago
Types and trace effects of higher order programs
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...
Christian Skalka, Scott F. Smith, David Van Horn
JFP
2008
97views more  JFP 2008»
14 years 10 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
SAC
2009
ACM
15 years 6 months ago
Matching ThisType to subtyping
The notion of ThisType has been proposed to promote typesafe reuse of binary methods and recently extended to mutually recursive definitions. It is well-known, however, that This...
Chieri Saito, Atsushi Igarashi
PLDI
2005
ACM
15 years 5 months ago
Permission-based ownership: encapsulating state in higher-order typed languages
Today’s module systems do not effectively support information hiding in the presence of shared mutable objects, causing serious problems in the development and evolution of larg...
Neelakantan R. Krishnaswami, Jonathan Aldrich
OOPSLA
2010
Springer
14 years 10 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...