A Type Specialisation Tutorial

Hughes, John

doi:10.1007/3-540-47018-2_12

Cited by 8 publications

(9 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the recursive schemes in SYB introduce new challenges for staging. Applying a generic scheme such as listify may involve traversing a number of mutually-recursive types, and so specialising a generic scheme involves generating a set of mutually-recursive functions (an instance of so-called polyvariant specialization [Hughes 1999;Launchbury 1991]).…”

Section: Staged Traversal Schemesmentioning

confidence: 99%

Staged generic programming

Yallop

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Generic programming libraries such as Scrap Your Boilerplate eliminate the need to write repetitive code, but typically introduce significant performance overheads. This leaves programmers with the regrettable choice between writing succinct but slow programs and writing tedious but efficient programs.Applying structured multi-stage programming techniques transforms Scrap Your Boilerplate from an inefficient library into a typed optimising code generator, bringing its performance in line with hand-written code, and so combining high-level programming with uncompromised performance.

show abstract

Section: Staged Traversal Schemesmentioning

confidence: 99%

Staged generic programming

Yallop

2017

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…They give a framework for a first-order functional language parametrized on algebras. Another related functional programming technique is type specialization [Hughes 1999]. It already uses a domain based upon types, richer than the PD-domain.…”

Section: Michael Leuschelmentioning

confidence: 99%

A framework for the integration of partial evaluation and abstract interpretation of logic programs

Leuschel

2004

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Recently the relationship between abstract interpretation and program specialization has received a lot of scrutiny, and the need has been identified to extend program specialization techniques so to make use of more refined abstract domains and operators. This paper clarifies this relationship in the context of logic programming, by expressing program specialization in terms of abstract interpretation. Based on this, a novel specialization framework, along with generic correctness results for computed answers and finite failure under SLD-resolution, is developed.This framework can be used to extend existing logic program specialization methods, such as partial deduction and conjunctive partial deduction, to make use of more refined abstract domains. It is also shown how this opens up the way for new optimizations. Finally, as shown in the paper, the framework also enables one to prove correctness of new or existing specialization techniques in a simpler manner.The framework has already been applied in the literature to develop and prove correct specialization algorithms using regular types, which in turn have been applied to the verification of infinite state process algebras.

show abstract

“…Obtaining Jones optimality has proven a source of inspiration for a number of new forays into partial evaluation, e.g., handwritten generators of program generators [19,1], constructor specialization [10,33], type specialization [11,21,20,22,23,29], coercions [8], and more recently tag elimination [30,37,38] and staged tagless interpreters [34]. Furthermore, the term "identical modulo renaming" in the definition of Jones optimality has evolved into "at least as efficient" [17,25].…”

Section: Introductionmentioning

confidence: 99%

Tagging, Encoding, and Jones Optimality

Danvy

López

2003

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract.A partial evaluator is said to be Jones-optimal if the result of specializing a self-interpreter with respect to a source program is textually identical to the source program, modulo renaming. Jones optimality has already been obtained if the self-interpreter is untyped. If the selfinterpreter is typed, however, residual programs are cluttered with type tags. To obtain the original source program, these tags must be removed.A number of sophisticated solutions have already been proposed. We observe, however, that with a simple representation shift, ordinary partial evaluation is already Jones-optimal, modulo an encoding. The representation shift amounts to reading the type tags as constructors for higherorder abstract syntax. We substantiate our observation by considering a typed self-interpreter whose input syntax is higher-order. Specializing this interpreter with respect to a source program yields a residual program that is textually identical to the source program, modulo renaming.

show abstract

A Type Specialisation Tutorial

Cited by 8 publications

References 4 publications

Staged generic programming

Staged generic programming

A framework for the integration of partial evaluation and abstract interpretation of logic programs

Tagging, Encoding, and Jones Optimality

Contact Info

Product

Resources

About