. We present Bigloo, a highly portable and optimizing compiler. Bigloo is the first compiler for strict functional languages that can efficiently compile several languages: Bigloo is the first compiler for full Scheme and full ML, and for these two languages, Bigloo is one of the most efficient compiler now available (Bigloo is available by anonymous ftp on ftp.inria.fr [192.93.2.54]). This high level of performance is achieved by numerous high-level optimizations. Some of those are classical optimizations adapted to higherorder functional languages (e.g. inlining), other optimization schemes are specific to Bigloo (e.g. a new refined closure analysis, an original optimization of imperative variables, and intensive use of higher-order control flow analysis). All these optimizations share the same design guideline: the reduction of heap allocation. 1 Introduction Strict functional programming languages have many different variations, but they all belong to the same family, the so-calle...

One glaring weakness of Java for numerical programming is its lack of support for complex numbers. Simply creating a Complex number class leads to poor performance relative to Fortran. We show in this paper, however, that the combination of such a Complex class and a compiler that understands its semantics does indeed lead to Fortran-like performance. This performance gain is achieved while leaving the Java language completely unchanged and maintaining full compatibility with existing Java Virtual Machines. We quantify the effectiveness of our approach through experiments with linear algebra, electromagnetics, and computational fluid-dynamics kernels. 1 Introduction The Java Grande Forum has identified several critical issues related to the role of Java (TM)1 in numerical computing [14]. One of the key requirements is that Java must support efficient operations on complex numbers. Complex arithmetic and access to elements of complex arrays must be as efficient as the manipulation o...

Over 25 implementations of different functional languages are benchmarked using the same program, a floatingpoint intensive application taken from molecular biology. The principal aspects studied are compile time and 1 Dept. of Computer Systems, Univ. of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands, e-mail: pieter@fwi.uva.nl 2 D'epart. d'informatique et r.o., Univ. de Montr'eal, succursale centre-ville, Montr'eal H3C 3J7, Canada, e-mail: feeley@iro.umontreal.ca 3 Informatik, Universitat des Saarlandes, 66041 Saarbrucken 11, Germany, e-mail: alt@cs.uni-sb.de 4 Dept. of Computer Systems, Chalmers Univ. of Technology, 412 96 Goteborg, Sweden, e-mail: augustss@cs.chalmers.se 5 Dept. of Computer Science, Univ. of Zurich, Winterthurerstr. 190, 8057 Zurich, Switzerland, e-mail: baumann@ifi.unizh.ch 6 Dept. of Computer Systems, Univ. of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands, e-mail: beemster@fwi.uva.nl 7 LIENS, URA 1327 du CNRS, ' Ecole Normale Sup'erieur...

xiii I. INTRODUCTION 1 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Outline of This Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Summary of the Research . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 II. REVIEW OF RELEVANT RESEARCH 5 2.1 Syntactic Ambiguity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 The Parser . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.2.1 Bottom Up and Top Down Parsers. . . . . . . . . . . . . . . . . . . . 7 2.2.2 Ellipsis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.3 Syntactic Error Recovery. . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2.4 Chart Parser. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2....