Bigloo: a portable and optimizing compiler for strict functional languages

Serrano, Manuel; Weis, Pierre

doi:10.1007/3-540-60360-3_50

Cited by 28 publications

(19 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We evaluated our link-time optimizer using two optimizing Scheme compilers: Bigloo version 1.8, by M. Serrano [14], and Gambit-C version 3.0 by Marc Feeley. Our experiments were run using nine commonly used Scheme benchmarks: boyer, a term-rewriting theorem prover; conform is a type checker, written by J. Miller; dynamic is an implementation of a tagging optimization algorithm for Scheme [9], applied to itself; earley is an implementation of Earley's parsing algorithm, by Marc Feeley; graphs, a program that counts the number of directed graphs with a distinguished root and k vertices each having out-degree at most 2; lattice enumerates the lattice of maps between two lattices; matrix tests whether a given random matrix is maximal among all matrices of the same dimension obtainable via a set of simple transformations of the original matrix; nucleic is a floating-point intensive program to determine nucleic acid structure; and scheme is a Scheme interpreter by Marc Feeley.…”

Section: Resultsmentioning

confidence: 99%

Link-Time Improvement of Scheme Programs

Debray

Muth

Watterson

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Optimizing compilers typically limit the scope of their analyses and optimizations to individual modules. This has two drawbacks: first, library code cannot be optimized together with their callers, which implies that reusing code through libraries incurs a penalty; and second, the results of analysis and optimization cannot be propagated from an application module written in one language to a module written in another. A possible solution is to carry out (additional) program optimization at link time. This paper describes our experiences with such optimization using two different optimizing Scheme compilers, and several benchmark programs, via alto, a link-time optimizer we have developed for the DEC Alpha architecture. Experiments indicate that significant performance improvements are possible via link-time optimization even when the input programs have already been subjected to high levels of compile-time optimization.

show abstract

Section: Resultsmentioning

confidence: 99%

Link-Time Improvement of Scheme Programs

Debray

Muth

Watterson

1999

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Bigloo [23] is a Scheme compiler which generates C code. Pre-Scheme [11] is a statically typed Scheme subset for the Scheme48 [10] virtual machine implementation.…”

Section: Code Generationmentioning

confidence: 99%

Safe Low-level Code Generation in Coq Using Monomorphization and Monadification

Tanaka

Affeldt

Garrigue

2018

Journal of Information Processing

View full text Add to dashboard Cite

Our goal is the production of formally-verified pieces of low-level code. Low-level code is typically written in C, so as to enable efficient manipulation of data at the bit-level and easy access to built-in features of CPUs. Proof-assistants arguably provide the most rigorous approach to formal verification of computer programs. Unfortunately, they only allow for extraction of runnable code in high-level languages such as ML. Of course it is possible to embed C snippets into ML programs, but this results in a complicated extraction process and the performance of the output program becomes difficult to anticipate. In this paper, we propose a new code generation scheme for the Coq proof-assistant that directly generates provably-safe C code. It is implemented in the form of plugins. The generation of C source code is done by a plugin performing beforehand monomorphization of Coq programs. The correctness of monomorphization can be proved within Coq. Code generation allows for user-guided changes of data structures. It is therefore possible to do formal verification using proof-friendly data structures, while enjoying optimized C representations in the output code. In order to ensure the safety of this transformation, we propose a new customizable monadification algorithm in the form of another plugin. Using monadification, one can ensure by the insertion of the right monads the preservation of critical invariants, such as the absence of overflows or complexity properties. We provide several examples to illustrate our approach, including a realistic use-case: the rank algorithm from succinct data structures.

show abstract

“…• Not using the natural style [19] of a platform. That is, not using C code that looks like hand-written C code, not using JVM bytecode that looks like bytecode produce by a Java compiler, or not using .NET bytecode that resembles bytecode produced by a C# compiler jeopardizes performance because platforms are always optimized for the code they are expected to run.…”

Section: Continuationsmentioning

confidence: 99%

Bigloo.NET: compiling Scheme to .NET CLR.

Bres¹,

Serpette²,

Serrano³

2004

JOT

Self Cite

View full text Add to dashboard Cite

This paper presents the compilation of the Scheme programming language to .NET. This platform provides a virtual machine, the Common Language Runtime (CLR), that executes bytecode, the Common Intermediate Language (CIL). Since CIL was designed with language agnosticism in mind, it provides a rich set of language constructs and functionalities. As such, the CLR is the first execution environment that offers type safety, managed memory, tail recursion support and several flavors of pointers to functions. Therefore, the CLR presents an interesting ground for functional language implementations. We discuss how to map Scheme constructs to CIL. We present performance analyses on a large set of real-life and standard Scheme benchmarks. In particular, we compare the speed of these programs when compiled to C, JVM and .NET. We show that in term of speed performance of the Mono implementation of .NET, the best implementing running on both Windows and Linux, still lags behind C and fast JVMs such as the Sun's implementations.

show abstract

Bigloo: a portable and optimizing compiler for strict functional languages

Cited by 28 publications

References 5 publications

Link-Time Improvement of Scheme Programs

Link-Time Improvement of Scheme Programs

Safe Low-level Code Generation in Coq Using Monomorphization and Monadification

Bigloo.NET: compiling Scheme to .NET CLR.

Contact Info

Product

Resources

About