Staged generic programming

Yallop, Jeremy

doi:10.1145/3110273

Cited by 23 publications

(16 citation statements)

References 38 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In terms of overall strategy, the inlining method could not be used on the Scrap Your Boilerplate (SYB) generics library by Lämmel and Peyton Jones [2003], because SYB relies on runtime casts [Lämmel and Peyton Jones 2004] (although they are type safe). More recently, Yallop [2017] showed how this could be avoided in a version of SYB in OCaml where type equality tests are witnessed by GADTs. From there, the features of MetaOCaml [Kiselyov 2014] are used for staging.…”

Section: Related Workmentioning

confidence: 99%

Staged sums of products

Pickering

Löh²,

2020

Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell

View full text Add to dashboard Cite

Generic programming libraries have historically traded efficiency in return for convenience, and the generics-sop library is no exception. It offers a simple, uniform, representation of all datatypes precisely as a sum of products, making it easy to write generic functions. We show how to finally make generics-sop fast through the use of staging with Typed Template Haskell. CCS Concepts: • Software and its engineering → Functional languages.

show abstract

Section: Related Workmentioning

confidence: 99%

Staged sums of products

Pickering

Löh²,

2020

Proceedings of the 13th ACM SIGPLAN International Symposium on Haskell

View full text Add to dashboard Cite

show abstract

“…Ofenbeck et al [2017] and Amin and Rompf [2018] discussed staging for generic programming as well as stage polymorphism in LMS. Multi-stage programming has been widely used to improve the performance in many other domains, such as optimizing compilers or domain-specific languages [Carette et al 2009;Sujeeth et al , 2013, numerical computation [Aktemur et al 2013;Kiselyov 2018], generic programming [Ofenbeck et al 2017;Yallop 2017], data processing [Jonnalagedda et al 2014;Kiselyov et al 2017], query compilation in databases , etc.…”

Section: Related Workmentioning

confidence: 99%

Staged abstract interpreters: fast and modular whole-program analysis via meta-programming

Wei

Chen

Rompf

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

It is well known that a staged interpreter is a compiler: specializing an interpreter to a given program produces an equivalent executable that runs faster. This connection is known as the first Futamura projection. It is even more widely known that an abstract interpreter is a program analyzer: tweaking an interpreter to run on abstract domains produces a sound static analysis. What happens when we combine these two ideas, and apply specialization to an abstract interpreter? In this paper, we present a unifying framework that naturally extends the first Futamura projection from concrete interpreters to abstract interpreters. Our approach derives a sound staged abstract interpreter based on a generic interpreter with type-level binding-time abstractions and monadic abstractions. By using different instantiations of these abstractions, the generic interpreter can flexibly behave in one of four modes: as an unstaged concrete interpreter, a staged concrete interpreter, an unstaged abstract interpreter, or a staged abstract interpreter. As an example of abstraction without regret, the overhead of these abstraction layers is eliminated in the generated code after staging. We show that staging abstract interpreters is practical and useful to optimize static analysis, all while requiring less engineering effort and without compromising soundness. We conduct three case studies, including a comparison with Boucher and Feeley's abstract compilation, applications to various control-flow analyses, and a demonstration for modular analysis. We also empirically evaluate the effect of staging on the execution time. The experiment shows an order of magnitude speedup with staging for control-flow analyses. CCS Concepts: • Software and its engineering → Automated static analysis; Functional languages; Interpreters.

show abstract

“…It is more desirable to have the flexibility we provide in order to specify precisely at use-sites the mode of inspection. Yallop [2017] discusses how structured multi-staged programming techniques can be used to improve SYB. The work observes the benefits which can be gained from a simple binding time analysis.…”

Section: Related Workmentioning

confidence: 99%

“…We are not the first to optimise SYB, and like our predecessors [Adams et al 2015;Yallop 2017], we make use of the fact that much of the information required for traversals is statically known, thereby avoiding dynamic checks at run-time. Our innovation is to work with types and use these to infer generated code generically in a suitable form for an automatic evaluator to optimise effectively.…”

Section: Introductionmentioning

confidence: 99%

Generic deriving of generic traversals

Kiss

Pickering

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Functional programmers have an established tradition of using traversals as a design pattern to work with recursive data structures. The technique is so prolific that a whole host of libraries have been designed to help in the task of automatically providing traversals by analysing the generic structure of data types. More recently, lenses have entered the functional scene and have proved themselves to be a simple and versatile mechanism for working with product types. They make it easy to focus on the salient parts of a data structure in a composable and reusable manner.In this paper, we use the combination of lenses and traversals to give rise to an expressive and flexible library for querying and modifying complex data structures. Furthermore, since our lenses and traversals are based on the generic shape of data, we are able to use this information to produce code that is as efficient as hand-written versions. The technique leverages the structure of data to produce generic abstractions that are then eliminated by the standard workhorses of modern functional compilers: inlining and specialisation.

show abstract

Staged generic programming

Cited by 23 publications

References 38 publications

Staged sums of products

Staged sums of products

Staged abstract interpreters: fast and modular whole-program analysis via meta-programming

Generic deriving of generic traversals

Contact Info

Product

Resources

About