Searching for authors named "Thomas Johnsson" – sorted by Relevance.
-
Compiling Lazy Functional Languages: An introduction
- Compiling Lazy Functional Languages: An introduction Thomas Johnsson Functional programming
- Add To MetaCart
-
Graph Reduction, and how to avoid it (extended abstract of talk)
- to avoid it (extended abstract of talk) Thomas Johnsson Department of Computer Science Chalmers
- Add To MetaCart
-
Attribute Grammars as a Functional Programming Paradigm
- Attribute Grammars as a Functional Programming Paradigm Thomas Johnsson Department of Computer
- Cited by 67 (2 self) – Add To MetaCart
-
Efficient Graph Algorithms Using Lazy Monolithic Arrays
- Efficient Graph Algorithms Using Lazy Monolithic Arrays Thomas Johnsson Department of Computing
- Cited by 2 (0 self) – Add To MetaCart
-
Fold-Unfold Transformations On State Monadic Interpreters
- FOLD-UNFOLD TRANSFORMATIONS ON STATE MONADIC INTERPRETERS Thomas Johnsson Abstract. In this paper
- Cited by 4 (1 self) – Add To MetaCart
-
Target code generation from G-machine code
- Target code generation from G-machine code Thomas Johnsson Abstract The G-machine is a stack
- Cited by 3 (1 self) – Add To MetaCart
-
Efficient Compilation of Lazy Evaluation
- Efficient Compilation of Lazy Evaluation Thomas Johnsson Abstract This paper describes
- Cited by 111 (9 self) – Add To MetaCart
-
Lambda Lifting: Transforming Programs to Recursive Equations
- Lambda Lifting: Transforming Programs to Recursive Equations Thomas Johnsson September 1985
- Cited by 145 (5 self) – Add To MetaCart
-
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages
- and Thomas Johnsson Department of Computing Science Chalmers University of Technology G#teborg, Sweden E
- Cited by 7 (0 self) – Add To MetaCart
-
Parallel Graph Reduction with the -machine
- Parallel Graph Reduction with the h; Gi-machine Lennart Augustsson and Thomas Johnsson Department
- Cited by 10 (1 self) – Add To MetaCart

