Sciweavers

117 search results - page 1 / 24
» Automatic type inference via partial evaluation
Sort
View
PPDP
2005
Springer
13 years 10 months ago
Automatic type inference via partial evaluation
Type checking and type inference are fundamentally similar problems. However, the algorithms for performing the two operations, on the same type system, often differ significant...
Aaron Tomb, Cormac Flanagan
TACAS
2007
Springer
108views Algorithms» more  TACAS 2007»
13 years 11 months ago
State of the Union: Type Inference Via Craig Interpolation
The ad-hoc use of unions to encode disjoint sum types in C programs and the inability of C’s type system to check the safe use of these unions is a long standing source of subtle...
Ranjit Jhala, Rupak Majumdar, Ru-Gang Xu
WFLP
2000
Springer
124views Algorithms» more  WFLP 2000»
13 years 8 months ago
A Formal Approach to Reasoning about the Effectiveness of Partial Evaluation
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
Elvira Albert, Sergio Antoy, Germán Vidal
APLAS
2010
ACM
13 years 5 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
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...
Jan Hoffmann 0002, Martin Hofmann
LOPSTR
2007
Springer
13 years 11 months ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...