Sciweavers

743 search results - page 98 / 149
» A Calculus of Gamma Programs
Sort
View
ECOOP
2007
Springer
14 years 1 months ago
Gradual Typing for Objects
Static and dynamic type systems have well-known strengths and weaknesses. In previous work we developed a gradual type system for a functional calculus named λ? →. Gradual typin...
Jeremy G. Siek, Walid Taha
ESOP
2006
Springer
13 years 11 months ago
Haskell Is Not Not ML
We present a typed calculus IL ("intermediate language") which supports the embedding of ML-like (strict, eager) and Haskell-like (non-strict, lazy) languages, without fa...
Ben Rudiak-Gould, Alan Mycroft, Simon L. Peyton Jo...
POPL
2010
ACM
14 years 5 months ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
27
Voted
JFP
2008
72views more  JFP 2008»
13 years 7 months ago
Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...
Peter Sewell, Gareth Stoyle, Michael Hicks, Gavin ...
ICFP
2005
ACM
14 years 7 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells