| 1998 |
|---|
| 13 | | Thomas Johnsson:
Efficient Graph Algorithms Using Lazy Monolithic Arrays.
J. Funct. Program. 8(4): 323-333 (1998) |
| 1996 |
|---|
| 12 | | Urban Boquist,
Thomas Johnsson:
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages.
Implementation of Functional Languages 1996: 58-84 |
| 11 | | Thomas Johnsson,
Ewert Bengtsson:
Data Parallel Supervised Classification Algorithms on Multispectral Images.
IJPRAI 10(7): 751-767 (1996) |
| 1995 |
|---|
| 10 | EE | Thomas Johnsson:
Graph reduction, and how to avoid it.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1992 |
|---|
| 9 | | Paul Hudak,
Simon L. Peyton Jones,
Philip Wadler,
Brian Boutel,
Jon Fairbairn,
Joseph H. Fasel,
María M. Guzmán,
Kevin Hammond,
John Hughes,
Thomas Johnsson,
Richard B. Kieburtz,
Rishiyur S. Nikhil,
Will Partain,
John Peterson:
Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.
SIGPLAN Notices 27(5): R1-R164 (1992) |
| 1991 |
|---|
| 8 | | Thomas Johnsson:
Parallel Evaluation of Functional Programs: The (v, G)-Machine Approach.
PARLE (1) 1991: 1-5 |
| 1989 |
|---|
| 7 | EE | Lennart Augustsson,
Thomas Johnsson:
Parallel Graph Reduction with the <nu, G>-Machine.
FPCA 1989: 202-213 |
| 6 | | Lennart Augustsson,
Thomas Johnsson:
The Chalmers Lazy-ML Compiler.
Comput. J. 32(2): 127-141 (1989) |
| 1987 |
|---|
| 5 | | Thomas Johnsson:
Attribute grammars as a functional programming paradigm.
FPCA 1987: 154-173 |
| 1986 |
|---|
| 4 | | Thomas Johnsson:
Target code generation from G-machine code.
Graph Reduction 1986: 119-159 |
| 1985 |
|---|
| 3 | | Thomas Johnsson:
Lambda Lifting: Treansforming Programs to Recursive Equations.
FPCA 1985: 190-203 |
| 1984 |
|---|
| 2 | EE | Thomas Johnsson:
Efficient compilation of lazy evaluation (with retrospective)
Best of PLDI 1984: 125-138 |
| 1 | EE | Thomas Johnsson:
Efficient compilation of lazy evaluation.
SIGPLAN Symposium on Compiler Construction 1984: 58-69 |
