Sciweavers

Share
FLOPS
2010
Springer

Tag-Free Combinators for Binding-Time Polymorphic Program Generation

9 years 6 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 efficient program specialization in the context of a polymorphic language. Following the cogen-combinator approach, a set of combinators is defined in Haskell that enables the straightforward transcription of a bindingtime polymorphic annotated program into the corresponding program generator. The typing of the combinators mimics the constraints of the binding-time analysis. The resulting program generator is safe, tag-free, and it has no interpretive overhead.
Peter Thiemann, Martin Sulzmann
Added 09 Jul 2010
Updated 09 Jul 2010
Type Conference
Year 2010
Where FLOPS
Authors Peter Thiemann, Martin Sulzmann
Comments (0)
books