Academic Journal
Tag-free combinators for binding-time polymorphic program generation
| Title: | Tag-free combinators for binding-time polymorphic program generation |
|---|---|
| Authors: | Peter Thiemann, Martin Sulzmann |
| Contributors: | The Pennsylvania State University CiteSeerX Archives |
| Superior Title: | http://proglang.informatik.uni-freiburg.de/projects/polyspec/polyspec.pdf. |
| Publication Year: | 2010 |
| Collection: | CiteSeerX |
| Description: | Binding-time polymorphism enables a highly flexible binding-time 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 binding-time 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. 1 |
| Document Type: | text |
| File Description: | application/pdf |
| Language: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.542.4644; http://proglang.informatik.uni-freiburg.de/projects/polyspec/polyspec.pdf |
| Availability: | http://proglang.informatik.uni-freiburg.de/projects/polyspec/polyspec.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Accession Number: | edsbas.B6CD8962 |
| Database: | BASE |
| Description not available. |