3 search results - page 1 / 1 » Inferring Cost Equations for Recursive, Polymorphic and High... |
IFL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
POPL
2010
ACM
15 years 7 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...
94
Voted
FPCA
1989
15 years 2 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...