Thomas Johnsson

15 papers A 2Journal 4Unranked 9
YearRankTypeTitle / Venue / Authors
1998 J jnl
Efficient Graph Algorithms Using Lazy Monolithic Arrays.
J. Funct. Program.
Thomas Johnsson
1996 J jnl
Data Parallel Supervised Classification Algorithms on Multispectral Images.
Int. J. Pattern Recognit. Artif. Intell.
Thomas Johnsson, Ewert Bengtsson
1996 — conf
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages.
Implementation of Functional Languages
Urban Boquist, Thomas Johnsson
1995 — conf
Graph reduction, and how to avoid it.
SEGRAGRA
Thomas Johnsson
1994 A conf
Fold-Unfold Transformations on State Monadic Interpreters.
Functional Programming
Thomas Johnsson
1992 J jnl
Report on the Programming Language Haskell, A Non-strict, Purely Functional Language.
ACM SIGPLAN Notices
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
1991 — conf
Parallel Evaluation of Functional Programs: The (v, G)-Machine Approach.
PARLE (1)
Thomas Johnsson
1990 A conf
Analysing Heap Contents in a Graph Reduction Intermediate Language.
Functional Programming
Thomas Johnsson
1989 — conf
Parallel Graph Reduction with the <nu, G>-Machine.
FPCA
Lennart Augustsson, Thomas Johnsson
1989 J jnl
The Chalmers Lazy-ML Compiler.
Comput. J.
Lennart Augustsson, Thomas Johnsson
1987 — conf
Attribute grammars as a functional programming paradigm.
FPCA
Thomas Johnsson
1986 — conf
Target code generation from G-machine code.
Graph Reduction
Thomas Johnsson
1985 — conf
Lambda Lifting: Treansforming Programs to Recursive Equations.
FPCA
Thomas Johnsson
1984 — conf
Efficient compilation of lazy evaluation (with retrospective)
Best of PLDI
Thomas Johnsson
1984 — conf
Efficient compilation of lazy evaluation.
SIGPLAN Symposium on Compiler Construction
Thomas Johnsson