98 search results - page 8 / 20 » Binding-Time Analysis for Polymorphic Types |
APLAS
2010
ACM
13 years 8 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
SAS
1991
Springer
13 years 12 months ago
1991
Springer
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...
ICLP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
BMCBI
2004
13 years 8 months ago
2004
Background: We have compared 38 isolates of the SARS-CoV complete genome. The main goal was twofold: first, to analyze and compare nucleotide sequences and to identify positions o...
POPL
1998
ACM
14 years 19 days ago
1998
ACM
constraint solver. The other infers annotations on bound variables in function abstractions by propagating type constraints downward from enclosing application nodes. We motivate o...