Optimizing closures in O(0) time

Keep, Andrew W.; Hearn, Alex; Dybvig, R. Kent

doi:10.1145/2661103.2661106

Cited by 7 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our implementation ideas were based on flat-closure conversion approach [Dybvig, 1987, Section 4.4] in combination with assignment conversion [Dybvig, 1987, Section 4.5]. A later work [Keep, Hearn, and Dybvig, 2012] discusses the kinds of optimizations that implementors of nested functions should perform. But the basic implementation ideas inspired the language side of the Gforth extension, and eventually the present paper, and there such optimizations are unnecessary (or left to the programmer).…”

Section: Related Workmentioning

confidence: 99%

Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung

2021

Kiel Computer Science Series, KCSS

View full text Add to dashboard Cite

The Kiel Computer Science Series (KCSS) covers dissertations, habilitation theses, lecture notes, textbooks, surveys, collections, handbooks, etc. written at the Department of Computer Science at Kiel University. It was initiated in 2011 to support authors in the dissemination of their work in electronic and printed form, without restricting their rights to their work. The series provides a uniﬁed appearance and aims at high-quality typography. The KCSS is an open access series; all series titles are electronically available free of charge at the department’s website. In addition, authors are encouraged to make printed copies available at a reasonable price, typically with a print-on-demand service.

show abstract

Section: Related Workmentioning

confidence: 99%

Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung

2021

Kiel Computer Science Series, KCSS

View full text Add to dashboard Cite

show abstract

“…The representation of closure environments is crucial to the design of a closure conversion algorithm. Several closure representations have been proposed, each of them trying to optimize metrics such as space consumption, number of accesses to the environment, and closure creation time [Keep et al 2012;Appel 1994, 2000]. However, the choice of representation may affect the space-safety of a program.…”

Section: Closure Representationmentioning

confidence: 99%

Closure conversion is safe for space

Paraskevopoulou

Appel

2019

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We formally prove that closure conversion with flat environments for CPS lambda calculus is correct (preserves semantics) and safe for time and space, meaning that produced code preserves the time and space required for the execution of the source program. We give a cost model to pre-and post-closure-conversion code by formalizing profiling semantics that keep track of the time and space resources needed for the execution of a program, taking garbage collection into account. To show preservation of time and space we set up a general, łgarbage-collection compatiblež, binary logical relation that establishes invariants on resource consumption of the related programs, along with functional correctness. Using this framework, we show semantics preservation and space and time safety for terminating source programs, and divergence preservation and space safety for diverging source programs. This is the first formal proof of space-safety of a closure-conversion transformation. The transformation and the proof are parts of the CertiCoq compiler pipeline from Coq (Gallina) through CompCert Clight to assembly language. Our results are mechanized in the Coq proof assistant. CCS Concepts: • Software and its engineering → General programming languages.

show abstract

“…These passes implement most of the optimizations from the original compiler and improve on some, including support for implicit cross-library optimization, improvements to closure optimization [15], and improved handling of procedures that return multiple values.…”

Section: Workings Of the New Compilermentioning

confidence: 99%

A nanopass framework for commercial compiler development

Keep

Dybvig

2013

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

Self Cite

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

Optimizing closures in O(0) time

Cited by 7 publications

References 11 publications

Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung

Tagungsband zum 21. Kolloquium Programmiersprachen und Grundlagen der Programmierung

Closure conversion is safe for space

A nanopass framework for commercial compiler development

Contact Info

Product

Resources

About