Results 11 - 20
of
577
The Glasgow Haskell Compiler The Architecture of Open Source Applications, Volume 2 ∗ DRAFT chapter
, 2012
"... The Glasgow Haskell Compiler (GHC) started as part of an academic research project funded by the UK government at the beginning of the 1990’s, with several goals in mind: • To make freely available a robust and portable compiler for Haskell that ..."
Abstract
- Add to MetaCart
The Glasgow Haskell Compiler (GHC) started as part of an academic research project funded by the UK government at the beginning of the 1990’s, with several goals in mind: • To make freely available a robust and portable compiler for Haskell that
Template Meta-programming for Haskell
- In Proceedings of the ACM SIGPLAN Workshop on Haskell
, 2002
"... We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic construction of programs at compile-time. The ability to generate code at compile time allows the programmer to implem ..."
Abstract
-
Cited by 250 (8 self)
- Add to MetaCart
to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and the generation of supporting data structures and functions from existing data structures and functions. Our design is being implemented in the Glasgow Haskell Compiler, ghc. 1
Theory and practice of demand analysis in haskell
, 2012
"... Abstract This paper presents the fruits of a decade-long experience with strictness analysis, in the context of the Glasgow Haskell Compiler, an optimising compiler for Haskell. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract This paper presents the fruits of a decade-long experience with strictness analysis, in the context of the Glasgow Haskell Compiler, an optimising compiler for Haskell.
A Short Cut to Deforestation
, 1993
"... Lists are often used as "glue" to connect separate parts of a program together. We propose an automatic technique for improving the efficiency of such programs, by removing many of these intermediate lists, based on a single, simple, local transformation. We have implemented the method in ..."
A transformation-based optimiser for Haskell
, 1998
"... Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilation by transformation" as its war-cry, trying to express as much as possible of the compilat ..."
Abstract
-
Cited by 89 (12 self)
- Add to MetaCart
Many compilers do some of their work by means of correctness-preserving, and hopefully performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) takes this idea of "compilation by transformation" as its war-cry, trying to express as much as possible
Compiling Haskell to Java
, 1996
"... Two things have been accomplished in this work: the rst is an implementation of a Haskell to Java compiler. The Glasgow Haskell compiler is used as a front end and outputs an intermediate language called the Spineless Tagless G-Machine language which is then parsed and then translated to Java sou ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Two things have been accomplished in this work: the rst is an implementation of a Haskell to Java compiler. The Glasgow Haskell compiler is used as a front end and outputs an intermediate language called the Spineless Tagless G-Machine language which is then parsed and then translated to Java
Compiling Haskell to Java
, 1996
"... Two things have been accomplished in this work: the rst is an implementation of a Haskell to Java compiler. The Glasgow Haskell compiler is used as a front end and outputs an intermediate language called the Spineless Tagless G-Machine language which is then parsed and then translated to Java sou ..."
Abstract
- Add to MetaCart
Two things have been accomplished in this work: the rst is an implementation of a Haskell to Java compiler. The Glasgow Haskell compiler is used as a front end and outputs an intermediate language called the Spineless Tagless G-Machine language which is then parsed and then translated to Java
Data Parallel Haskell: a status report
, 2007
"... We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original programmingmodel and its implementation, both of which were first popularised by the NESL language, in terms of expressiv ..."
Abstract
-
Cited by 104 (17 self)
- Add to MetaCart
We describe the design and current status of our effort to implement the programming model of nested data parallelism into the Glasgow Haskell Compiler. We extended the original programmingmodel and its implementation, both of which were first popularised by the NESL language, in terms
Template Meta-programming for Haskell
"... Abstract We propose a new extension to the purely functional programminglanguage Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithmic constructionof programs at compile-time. The ability to generate code at compile time allows the program-mer t ..."
Abstract
- Add to MetaCart
-mer to implement such features as polytypic programs, macro-like expansion, user directed optimization (such as inlining), and thegeneration of supporting data structures and functions from existing data structures and functions. Our design is being implemented in the Glasgow Haskell Compiler, ghc.
Plugging Haskell In
- In Proceedings of the ACM SIGPLAN Workshop on Haskell
, 2004
"... Extension languages enable users to expand the functionality of an application without touching its source code. Commonly, these languages are dynamically typed languages, such as Lisp, Python, or domain-specific languages, which support runtime plugins via dynamic loading of components. We show tha ..."
Abstract
-
Cited by 21 (4 self)
- Add to MetaCart
explain how to realise type-safe plugins using dynamic types, runtime compilation, and dynamic linking, exploiting infrastructure provided by the Glasgow Haskell Compiler. We demonstrate the practicability of our approach with several applications that serve as running examples.
Results 11 - 20
of
577