M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In 2nd Static Analysis Symposium, Lecture Notes on Computer Science, pages 366--381, Glasgow, Scotland, September 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the performance of Erlang implementations by comparing HiPE (version 0.92) and the JAM system upon which this HiPE version is based (version 47.4.1) against high performance implementations of other functional languages. Systems used in this comparison are: The Bigloo version 2. 1c Scheme compiler [26] (compiling to native code via gcc 03; the Bigloo optinfization op tion fstack was also used) SML NJ release 110 with the CML extensions [25] and CLEAN version 1.3.2 [6] Like Erlang, Scheme is a strict, dynanfically typed language. CML is concurrent, statically typed, and strict. CLEAN is ....

Serrano M., Weis P.: Bigloo: a portable and optimizing com- piler for strict functional languages. In: Mycroft A., (ed.): Proc. 2nd Static Analysis Symposium. LNCS 983. Berlin, Heidelberg, New York: Springer-Verlag, 1995, pp. 366-381

....using the JVM argument passing system, at least up to four arguments. When the number of arguments to a procedure exceeds four, the extra arguments are passed as a list and destructured in the apply method of the closure class. This is similar to the argument passing mechanism used in Bigloo [14], where the number of argument dispatching resides in the virtual table lookup of the JVM. Variable number of argument procedures are implemented as an apply routine accepting up to four xed arguments and a list of remaining arguments. The closure class of an vararg procedure includes apply ....

....c to the Scheme language. Our next comparison compiler is the DrScheme system [5] from the PLT group at Rice. We consider both their byte compiled and native compiled (via C) performance. Finally, to estimate our performance relative to an optimizing, native code compiler, we selected the Bigloo [14] compiler from INRIA. More detailed information on each compiler is provided below: JVM SINTL Benchmark results were producing using Sun Microsystems Java 1.2.2 distribution for Linux with native green threads using the Inprise just in time compiler from Borland. The Java heap was set to an ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In SAS 95, pages 366-381, 1995.

....provides operations on translation environments for modification, enrichment, restriction, and matching. 10.2 Intermediate Language Optimisation The Kit has an optimiser that transforms a Lambda program into another Lambda program by applying a series of optimisations inspired by [App92, SW95] but extended to apply to the typed setting of the Lambda language (see [TMC 96, Tar96] and implemented using the techniques described in [AJ97] The optimisations include specialisation of recursive functions, function in lining, constant propagation, dead code elimination, minimisation of ....

Manuel Serrano and Pierre Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In Second International Symposium on Static Analysis, pages 366--381, September 1995.

....out if the program contains any instructions to flush the i cache. This has not been implemented yet. Finally, signal handling and volatile variables may pose correctness problems. This was brought home to us while experimenting with Scheme programs compiled with the Bigloo v1.8 Scheme compiler [34], whose runtime system used version 4.7 of the Boehm Demers Weiser conservative garbage collector [4] The garbage collector contained code of the following form: file: os dep.c] GC find limit( static volatile char result; GC setup temporary fault handler( for( if ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages" Proc. Static Analysis Symposium (SAS '95), 1995, pp. 366--381.

....and Semantics Based Program Manipulation (PEPM 97) This work was supported in part by the National Science Foundation under grant CCR 9502826. 1 The numbers are based on a Scheme program that represents a vector as a list, specialized using Similix [6] and compiled using Bigloo version 1. 8 [30], with gcc version 2.7.2 as the back end compiler, and run on a 25 MHz SPARC IPC with 64 Kbytes of cache and 32 Mbytes of main memory. See Section 5 for further details. 1 0.9 0.95 1 1.05 1.1 1.15 1.2 1.25 1.3 0 2000 4000 6000 8000 10000 Speedup input size Figure 1: Relative ....

....y0) conv0 x y 0) Our aim was to specialize the function conv(x, y) to the first argument, x, and measure the speedups obtained for different lengths of x. We used Similix [6] running on the scm Scheme interpreter for the specialization, and the Bigloo Scheme to C translator (version 1. 8) [30] invoked as bigloo1.8 O4 unsafe farithmetic, with gcc version 2.7.2 as the back end compiler, to produce executables. It turned out that the memory requirements of Similix and Bigloo were higher than we could afford: the scm interpreter running Similix ran out of memory for an input length of ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages" Proc. Static Analysis Symposium (SAS '95), 1995, pp. 366--381.

....end and implemented by any of the available code generators. So pressing is this need that it has become common to use C as a portable assembly language (Atkinson et al. 1989; Bartlett 1989b; Peyton Jones 1992; Tarditi, Acharya, and Lee 1992; Henderson, Conway, and Somogyi 1995; Pettersson 1995; Serrano and Weis 1995). Unfortunately, C was never intended for this purpose it is a programming language, not an assembly language. C locks the implementation into a particular calling convention, makes it impossible to compute targets of jumps, provides no support for garbage collection, and provides very little ....

Serrano, Manuel and Pierre Weis. 1995 (September). Bigloo: a portable and optimizing compiler for strict functional languages. In 2nd Static Analysis Symposium, Lecture Notes in Computer Science, pages 366--381, Glasgow, Scotland.

....ML Core language by first elaborating and translating programs into an intermediate typed lambda language. At this point, polymorphic equality is eliminated. Then, a simple optimiser performs various optimisations inspired by [1] and small recursive functions are specialised as suggested in [17]. The remaining phases of the compiler are based on region inference [24] Each value generated by the program resides in a region and region inference is the task of determining when to allocate and deallocate regions. Various analyses determine how to represent different regions at runtime [3] ....

Manuel Serrano and Pierre Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In Second International Symposium on Static Analysis, pages 366--381, September 1995.

....called a Tube Site (see figure 6) These sites listen on sockets for the arrival of objects. An object is transmitted as a marshalled Scheme expression. When an object arrives, it becomes active . Our prototype implementation of Tube Sites is based around the Bigloo Scheme compiler interpreter [15]. Additional functionality that has been added and compiled in is described below. ffl Low level communication facilities Unix sockets, files, redirection of input and output are accessible from scripts. A generic addressing scheme is provided; addresses are typed and contact and resolution ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In Second International Static Analysis Symposium (SAS95), 1995.

....agents inside World Wide Web pages. The core state saving functionality of the Tube is itself written entirely in Scheme. It is portable between Scheme interpreters and compilers, and thus also between operating systems. The current implementation of the Tube is Unixbased. It uses the Bigloo [11] Scheme compiler interpreter, with patches to make it thread safe. Versions of the Tube are running on DEC Alphas under Digital Unix, Sun SPARCs under Solaris, Intel Pentiums under Linux and HP9000s under HP UX. HALLS AND ROONEY: CONTROLLING THE TEMPEST 9 C. Interfacing the Tempest with the ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages," in Second Static Analysis Symposium, Glasgow, Scotland, Sept. 1995, Lecture Notes in Computer Science, pp. 366--381.

....that represent program state into expressions that contain no closures at all. It is then a simple matter to marshal these closureless expressions into byte sequences for sending over a network. The interpreter is fully portable between different Scheme implementations. The Tube uses Bigloo [Serrano95] to compile the interpreter to native code, so leaving a single layer of interpretation for Scheme programs. Another compilation of the interpreter has been made, using the Java based Scheme compiler Kawa [Bothner97] to compile it into Java bytecodes. Compiling the bytecodes using a Just In Time ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In Second Static Analysis Symposium, Lecture Notes in Computer Science, pages 366--381, Glasgow, Scotland, September 1995. (p. 3)

....performance than either collector time or allocation time. 1 Overview For almost any language, there are a handful of compilers that generate C [1] as a target language. For instance, Javato C compilers include Toba [20] Vortex [11] and Harissa [18] and ML to C compilers include Bigloo [22], SML2C [27] and TIL C [28] 1 . The developers of these compilers chose C as a target language to leverage the optimizations of existing C compilers and to obtain a relatively portable, easy to build back end. However, Java, ML, and many other languages require garbage collection which C does ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. Lecture Notes in Computer Science, 983:366--81, 1995.

....for each set using a greedy algorithm to construct chains of basic blocks, and concatenate the three resulting layouts to obtain the overall program layout. 7 Experimental Results 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 ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages " Proc. Static Analysis Symposium (SAS '95), 1995, pp. 366--381.

....for each set using a greedy algorithm to construct chains of basic blocks, and concatenate the three resulting layouts to obtain the overall program layout. 7 Experimental Results 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 ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages" Proc. Static Analysis Symposium (SAS '95), 1995, pp. 366-- 381.

....performance than either collector time, or allocation code. 1 Overview For almost any language, there are a handful of compilers that generate C [1] as a target language. For instance, Javato C compilers include Toba [20] Vortex [11] and Harissa [18] and ML to C compilers include Bigloo [22], SML2C [27] and TIL C [28] The developers of these compilers chose C as a target language to leverage the optimizations of existing C compilers and to obtain a relatively portable, easy to build back end. However, Java, ML, and many other languages require garbage collection which C does not ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. Lecture Notes in Computer Science, 983:366--81, 1995.

....using OM yields an average improvement of about 13 ; by contrast, link time optimization using alto produces an average improvement of just under 20 . 6.2 Scheme Programs To evaluate alto on Scheme programs, we used two different optimizing Scheme compilers: Bigloo version 1. 8, by Serrano [31], and Gambit C version 3.0 by Feeley [15] Our experiments were run using nine commonly used Scheme benchmarks, whose characteristics are reported in Appendix B.2. We considered only compiled systems, and restricted ourselves to compilers that translated Scheme programs to C code, because alto ....

M. Serrano and P. Weis, "Bigloo: a portable and optimizing compiler for strict functional languages" Proc. Static Analysis Symposium (SAS '95), 1995, pp. 366--381.

....always retaining a pointer to the beginning of an object that is in use, and only using the collector s allocation routines. Indeed, conservative collectors are so practical that a variety of compilers for GC friendly languages, including TIL C [29, 20, 28, 30] Toba [22] Harissa [21] Bigloo [24] and Vortex [15] have chosen to use a conservative collector and to compile to C rather than use an accurate collector and generate assembly code. The implementors of these systems have decided that the portability of C, and the optimizations afforded by pre existing C compilers outweigh the ....

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. Lecture Notes in Computer Science, 983:366--81, 1995.

....work should be done by a computer. 4.3 The value of compilation Our extension to Scheme, called Envision, uses a compiler to transform user level Scheme code into efficient C code. Considerable research has been done on compilation of high level languages and the newest Scheme to C compilers [9, 15, 16] perform quite well. However, these techniques have never been applied to generating computer vision code, partly due to lack of communication between programming language research and computer vision and partly due to the significant initial investment of time required to write or adapt a ....

....of any internal variable. Furthermore, such functions cannot allocate or dellocate non stack space, nor can they call graphical display functions. Variables are restricted to points, booleans, sheets, and samples. Only points can be 1 They would run faster if compiled into C, e.g. using Bigloo [15, 16], but not fast enough. missing. Only basic control constructs are allowed. These restrictions were inspired, in part, by those of Prescheme [9] Previous optimizing Lisp and Scheme compilers, such as Bigloo or Franz Common Lisp, regard the input code as fixed and take as their goal optimizing it ....

[Article contains additional citation context not shown here]

Serrano, M. and Weis, P. (1995) "Bigloo: a portable and optimizing compiler for strict functional languages," SAS 95, pp. 366--381.

No context found.

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In 2nd Static Analysis Symposium, Lecture Notes on Computer Science, pages 366--381, Glasgow, Scotland, September 1995.

No context found.

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In 2nd Static Analysis Symposium, Lecture Notes on Computer Science, pages 366--381, Glasgow, Scotland, September 1995.

....the source line corresponding to the clicked activation record. More Bdb commands will be presented in Section 6. 3 The C code production The purpose of this paper is not to present the compilation techniques used to get ecient C code production. They have already been presented in previous work (Serrano Weis, 1995). But, we must present the framework we use to compile Scheme programs into C programs because this has a tremendous impact on the design and implementation of all the tools that are included in the programming environment. Bee 15 Fig. 5. A debugging session 3.1 What kind of C code to generate ....

....(for instance C values stored into the stack) Furthermore, garbage collection must deal with ambiguous roots. On the other hand, the compilation of our generated C code is better, resulting in good, homogeneous performance that is not tied to some particular machine architecture. A previous study (Serrano Weis, 1995) has reported that this technique, in general, delivers better performance than the virtual assembly one. As an added bene t of this standard C code generation, we can run the C programming environment tools on the generated C code: symbolic debuggers, code analyzers (such as purify) and pro ....

Serrano, M., & Weis, P. 1995 (Sept.). Bigloo: a portable and optimizing compiler for strict functional languages. Pages 366-381 of: 2nd static analysis symposium. Lecture Notes on Computer Science.

No context found.

Manuel Serrano and Pierre Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In Alan Mycroft, editor, Proceedings of the 2nd Static Analysis Symposium, number 983 in LNCS, pages 366--381, September 1995.

No context found.

M. Serrano and P. Weis, "Bigloo : a portable and optimizing compiler for strict functional languages," in 2nd, (Glasgow, Scotland), pp. 366--381, Sept. 1995.

No context found.

M. Serrano and P. Weis. Bigloo: a portable and optimizing compiler for strict functional languages. In A. Mycroft, editor, Proceedings of the Second Static Analysis Symposium, number 983 in LNCS, pages 366--381. Springer, Sept. 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC