Sciweavers

27 search results - page 2 / 6
» Type classes with more higher-order polymorphism
Sort
View
DLS
2005
176views Languages» more  DLS 2005»
13 years 6 months ago
Dynamic data polyvariance using source-tagged classes
The DDP (Demand-driven/Pruning) analysis algorithm allows us to perform data-flow analyses of programming languages that are dynamically typed and have higher-order control flow...
S. Alexander Spoon, Olin Shivers
ICFP
2000
ACM
13 years 9 months ago
Functional programming in C++
This paper describes FC++: a rich library supporting functional programming in C++. Prior approaches to encoding higher order functions in C++ have suffered with respect to polymo...
Brian McNamara, Yannis Smaragdakis
SAS
1994
Springer
136views Formal Methods» more  SAS 1994»
13 years 8 months ago
Constraint-Based Type Inference and Parametric Polymorphism
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...
Ole Agesen
ESOP
2006
Springer
13 years 8 months ago
Polymorphic Type Inference for the JNI
We present a multi-lingual type inference system for checking type safety of programs that use the Java Native Interface (JNI). The JNI uses specially-formatted strings to represe...
Michael Furr, Jeffrey S. Foster
OOPSLA
2010
Springer
13 years 3 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...