A pattern for almost homomorphic functions

Frisby, Nicolas; Gill, Andy; Alexander, Perry

doi:10.1145/2364394.2364396

Cited by 3 publications

(2 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ideally, the user would be able to take a hybrid approach of mechanically deriving the systematic cases, while manually overwriting the non-systematic cases. Investigating support for this sort of partial derivation is ongoing work (Frisby et al, 2012).…”

Section: Walking the Treementioning

confidence: 99%

The Kansas University rewrite engine

Sculthorpe¹,

Frisby²,

Gill³

2014

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

When writing transformation systems, a significant amount of engineering effort goes into setting up the infrastructure needed to direct individual transformations to specific targets in the data being transformed. Strategic programming languages provide general-purpose infrastructure for this task, which the author of a transformation system can use for any algebraic data structure.The Kansas University Rewrite Engine (KURE) is a typed strategic programming language, implemented as a Haskell-embedded domain-specific language. KURE is designed to support typed transformations over typed data, and the main challenge is how to make such transformations compatible with generic traversal strategies that should operate over any type.Strategic programming in a typed setting has much in common with datatype-generic programming. Compared to other approaches to datatype-generic programming, the distinguishing feature of KURE's solution is that the user can configure the behaviour of traversals based on the location of each datum in the tree, beyond their behaviour being determined by the type of each datum.This article describes KURE's approach to assigning types to generic traversals, and the implementation of that approach. We also compare KURE, its design choices, and their consequences, with other approaches to strategic and datatype-generic programming.

show abstract

Section: Walking the Treementioning

confidence: 99%

The Kansas University rewrite engine

Sculthorpe¹,

Frisby²,

Gill³

2014

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Yoko [10] is a Haskell module for writing functions that transform an input type to a similar output type that requires only the interesting cases be specified, similar to how the nanopass framework operates over languages. The module builds on generic programming techniques to provide the hcompos function.…”

Section: Related Workmentioning

confidence: 99%

A nanopass framework for commercial compiler development

Keep

Dybvig

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

Contemporary compilers must typically handle sophisticated highlevel source languages, generate efficient code for multiple hardware architectures and operating systems, and support source-level debugging, profiling, and other program development tools. As a result, compilers tend to be among the most complex of software systems. Nanopass frameworks are designed to help manage this complexity. A nanopass compiler is comprised of many singletask passes with formally defined intermediate languages. The perceived downside of a nanopass compiler is that the extra passes will lead to substantially longer compilation times. To determine whether this is the case, we have created a plug replacement for the commercial Chez Scheme compiler, implemented using an updated nanopass framework, and we have compared the speed of the new compiler and the code it generates against the original compiler for a large set of benchmark programs. This paper describes the updated nanopass framework, the new compiler, and the results of our experiments. The compiler produces faster code than the original, averaging 15-27% depending on architecture and optimization level, due to a more sophisticated but slower register allocator and improvements to several optimizations. Compilation times average well within a factor of two of the original compiler, despite the slower register allocator and the replacement of five passes of the original 10 with over 50 nanopasses.

show abstract

A nanopass framework for commercial compiler development

Keep

Dybvig

2013

SIGPLAN Not.

View full text Add to dashboard Cite

Contemporary compilers must typically handle sophisticated high-level source languages, generate efficient code for multiple hardware architectures and operating systems, and support source-level debugging, profiling, and other program development tools. As a result, compilers tend to be among the most complex of software systems. Nanopass frameworks are designed to help manage this complexity. A nanopass compiler is comprised of many single-task passes with formally defined intermediate languages. The perceived downside of a nanopass compiler is that the extra passes will lead to substantially longer compilation times. To determine whether this is the case, we have created a plug replacement for the commercial Chez Scheme compiler, implemented using an updated nanopass framework, and we have compared the speed of the new compiler and the code it generates against the original compiler for a large set of benchmark programs. This paper describes the updated nanopass framework, the new compiler, and the results of our experiments. The compiler produces faster code than the original, averaging 15-27% depending on architecture and optimization level, due to a more sophisticated but slower register allocator and improvements to several optimizations. Compilation times average well within a factor of two of the original compiler, despite the slower register allocator and the replacement of five passes of the original 10 with over 50 nanopasses.

show abstract

A pattern for almost homomorphic functions

Cited by 3 publications

References 26 publications

The Kansas University rewrite engine

The Kansas University rewrite engine

A nanopass framework for commercial compiler development

A nanopass framework for commercial compiler development

Contact Info

Product

Resources

About