Simon L. Peyton Jones, John Launchbury  Home/Search
Context Related
| dcs.gla.ac.uk/pub/...nboxedvalues.ps.Z microsoft.com/~sim...nboxedvalues.ps.Z microsoft.com/User...nboxedvalues.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ogi.edu/PacSoft/pub...bibliograph (more) From: microsoft.com/~simonpj/P...papers Homepages: S.Jones |
Rate this article:      (best)Comment on this article |
Abstract: The code compiled from a non-strict functional program usually manipulates heapallocated boxed numbers. Compilers for such languages often go to considerable trouble to optimise operations on boxed numbers into simpler operations on their unboxed forms. These optimisations are usually handled in an ad hoc manner in the code generator, because earlier phases of the compiler have no way to talk about unboxed values. We present a new approach, which makes unboxed values into (nearly) first-class... (Update)
Cited by: More
From Sequential Programs to Multi-Tier Applications by.. - Neubauer, Thiemann (2005) (Correct)
Optimising the Memory Management of Higher-Order Functional.. - Mohnen (1997) (Correct)
Thunk Lifting: reducing the Heap Usage in an Implementation.. - Haydarlou, Hartel (1995) (Correct)
Active bibliography (related documents): More All
0.3: Implementing lazy functional languages on stock hardware: the.. - Jones (1992) (Correct)
0.2: Dual-Mode Garbage Collection - Sansom (1991) (Correct)
0.2: Compilation of Functional Languages Using Flow Graph Analysis - Hartel, Glaser, Wild (1994) (Correct)
Similar documents based on text: More All
0.8: Unboxing using Specialisation - Hall, Jones, Sansom (1994) (Correct)
0.6: Representation Analysis for Coercion Placement - Faxen (1999) (Correct)
0.6: Unboxed Values and Polymorphic Typing Revisited - Thiemann (1995) (Correct)
Related documents from co-citation: More All
25: Unboxed objects and polymorphic typing - Leroy - 1992
22: Compiling with Continuations (context) - Appel - 1992
16: Implementing lazy functional languages on stock hardware: the Spineless Tagless .. - Jones - 1992
BibTeX entry: (Update)
Peyton Jones, S.L. and J. Launchbury. 1991. Unboxed values as first class citizens in a non-strict functional language. In Proc. of Conference on Functional Programming Languages and Computer Architecture (FPCA 91), Sept. 1991, Cambridge, LNCS 523. http://citeseer.ist.psu.edu/jones91unboxed.html More
@inproceedings{ jones91unboxed,
author = "Simon L. {Peyton Jones} and J. Launchbury",
title = "Unboxed Values as First Class Citizens in a Non-strict Functional Language",
booktitle = "Proceedings of the Conference on Functional Programming and Computer Architecture",
month = "26--28 August",
publisher = "Springer-Verlag {LNCS}523",
address = "Cambridge, Massachussets, USA",
editor = "J. Hughes",
pages = "636--666",
year = "1991",
url = "citeseer.ist.psu.edu/jones91unboxed.html" }
Citations (may not include all citations):359 The implementation of functional programming languages (context) - Jones - 1987
343 Principal type schemes for functional programs (context) - Damas, Milner - 1982
324 Deforestation: transforming programs to eliminate trees - Wadler - 1990
291 Computational lambda calculus and monads - Moggi - 1989
221 Denotational semantics: a methodology for language developme.. (context) - Schmidt - 1986
150 The category-theoretic solution of recursive domain equation.. (context) - Smyth, Plotkin - 1982
116 Rabbit: a compiler for Scheme (context) - Steele - 1978
44 Clean - a language for functional graph rewriting (context) - Brus, van Eckelen et al. - 1987
39 The Spineless Tagless G-machine (context) - Jones, Salkild - 1989
39 Compilation of functional languages by program transformatio.. (context) - Fradet, Le Metayer - 1990
23 Runtime tags aren't necessary - Appel - 1988
19 ORBIT - an optimising compiler for Scheme (context) - Kranz - 1988
15 Compilation by program transformation (context) - Kelsey - 1989
13 Untagged data in tagged environments: choosing optimal repre.. (context) - Peterson - 1989
10 Efficient data representations in polymorphic languages (context) - Leroy - 1991
6 Continuation-passing, closure-passing style - Appel, Jim - 1989
4 The Spineless Tagless G-machine: a second attempt (context) - Jones - 1991
1 Report on the functional programming language Haskell (context) - Horwood, -- et al. - 1990
1 Coercive type equivalence (context) - Thatte - 1990
1 Compilation of lambda-calculus into functional machine code (context) - Fradet, Le Metayer - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.ogi.edu/PacSoft/publications/bibliograph.html): More
Revisiting Catamorphisms over Datatypes with Embedded.. - Fegaras, Sheard (1996) (Correct)
A Short Cut to Deforestation - Gill, Launchbury, Jones (1993) (Correct)
Monads, Indexes and Transformations - Bellegarde, Hook (1994) (Correct)
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