Sciweavers

98 search results - page 1 / 20
» Binding-Time Analysis for Polymorphic Types
Sort
View
FLOPS
2010
Springer
15 years 4 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
70
Voted
ERSHOV
2001
Springer
15 years 3 months ago
Binding-Time Analysis for Polymorphic Types
Rogardt Heldal, John Hughes
67
Voted
ESOP
1994
Springer
15 years 3 months ago
Polymorphic Binding-Time Analysis
Fritz Henglein, Christian Mossin
PEPM
1993
ACM
15 years 3 months ago
Polyvariant Binding-Time Analysis For Applicative Languages
Binding-time analysis is a crucial component of an ofine partial evaluator. The accuracy of the binding-time information that it produces determines the degree of specialization o...
Charles Consel
LOPSTR
2004
Springer
15 years 4 months ago
Fully Automatic Binding-Time Analysis for Prolog
Offline partial evaluation techniques rely on an annotated version of the source program to control the specialisation process. These annotations guide the specialisation and have ...
Stephen-John Craig, John P. Gallagher, Michael Leu...