Sciweavers

19 search results - page 3 / 4
» Relationally-parametric polymorphic contracts
Sort
View
SAS
1991
Springer
13 years 11 months ago
Polymorphic Time Systems for Estimating Program Complexity
We present a new approach to static program analysis that permits each expression in a program to be assigned an execution time estimate. Our approach uses a time system in conjun...
Vincent Dornic, Pierre Jouvelot, David K. Gifford
TOOLS
2010
IEEE
13 years 5 months ago
Understanding the Impact of Collection Contracts on Design
Abstract. Java provides a specification for a user-defined general purpose equivalence operator for objects, but collections such as Set have more stringent requirements. This in...
Stephen Nelson, David J. Pearce, James Noble
TLCA
2009
Springer
14 years 1 months ago
Parametricity for Haskell with Imprecise Error Semantics
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...
Florian Stenger, Janis Voigtländer
OOPSLA
1995
Springer
13 years 11 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....
SAIG
2001
Springer
13 years 11 months ago
Short Cut Fusion: Proved and Improved
Abstract. Short cut fusion is a particular program transformation technique which uses a single, local transformation — called the foldr-build rule — to remove certain intermed...
Patricia Johann