894 search results - page 33 / 179 » Typed Contracts for Functional Programming |
ICFP
2008
ACM
14 years 8 months ago
2008
ACM
Reasoning about imperative programs requires the ability to track aliasing and ownership properties. We present a type system that provides this ability, by using regions, capabil...
ESOP
2009
Springer
14 years 3 months ago
2009
Springer
Just as some functions have uniform behavior over distinct types, other functions have uniform behavior over distinct arities. These variable-arity functions are widely used in scr...
ENTCS
2000
13 years 8 months ago
2000
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
PLPV
2010
ACM
14 years 5 months ago
2010
ACM
Reasoning about object-oriented programs is difficult since such programs usually involve aliasing, and it is not easy to identify the ways objects can relate to each other and t...
FPCA
1989
14 years 21 days ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...