Sciweavers

462 search results - page 9 / 93
» Function Types in Complete Type Inference
Sort
View
JFP
2007
104views more  JFP 2007»
15 years 2 months ago
Understanding functional dependencies via constraint handling rules
Functional dependencies are a popular and useful extension to Haskell style type classes. We give a reformulation of functional dependencies in terms of Constraint Handling Rules ...
Martin Sulzmann, Gregory J. Duck, Simon L. Peyton ...
DLS
2008
149views Languages» more  DLS 2008»
15 years 4 months ago
Gradual typing with unification-based inference
Static and dynamic type systems have well-known strengths and weaknesses. Gradual typing provides the benefits of both in a single language by giving the programmer control over w...
Jeremy G. Siek, Manish Vachharajani
LICS
1994
IEEE
15 years 6 months ago
Efficient Inference of Object Types
Abadi and Cardelli have recently investigated a calculus of objects [2]. The calculus supports a key feature of object-oriented languages: an object can be emulated by another obj...
Jens Palsberg
COOPIS
2003
IEEE
15 years 7 months ago
Static Type-Inference for Trust in Distributed Information Systems
Abstract. Decision-makers in critical fields such as medicine and finance make use of a wide range of information available over the Internet. Mediation, a data integration techn...
Premkumar T. Devanbu, Michael Gertz, Brian Toone
POPL
1997
ACM
15 years 6 months ago
First-class Polymorphism with Type Inference
Languages like ML and Haskell encourage the view of values as first-class entities that can be passed as arguments or results of functions, or stored as components of data struct...
Mark P. Jones