16 search results - page 2 / 4 » Tunable Static Inference for Generic Universe Types |
ESOP
2010
Springer
14 years 2 months ago
2010
Springer
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource consumption of (first-order) functional programs. ...
IFL
2001
Springer
13 years 9 months ago
2001
Springer
In order to achieve a high level of abstraction, array-oriented languages provide language constructs for defining array operations in a shape-invariant way. However, when trying ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...
TPHOL
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...