Sciweavers

29 search results - page 1 / 6
» Type Inference for First-Class Messages with Feature Constra...
Sort
View
ASIAN
1998
Springer
133views Algorithms» more  ASIAN 1998»
13 years 8 months ago
Type Inference for First-Class Messages with Feature Constraints
Abstract. We present a constraint system OF of feature trees that is appropriate to specify and implement type inference for first-class messages. OF extends traditional systems of...
Martin Müller, Susumu Nishimura
ASPLOS
2006
ACM
13 years 10 months ago
Type inference for unboxed types and first class mutability
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hardware specification, and temporal predictability. T...
Swaroop Sridhar, Jonathan S. Shapiro
ECOOP
1993
Springer
13 years 8 months ago
Type Inference of SELF
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
Ole Agesen, Jens Palsberg, Michael I. Schwartzbach
ICFP
2008
ACM
14 years 4 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
POPL
2011
ACM
12 years 7 months ago
Dynamic inference of static types for ruby
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...