default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Johnsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1998
[j4]Thomas Johnsson:
Efficient Graph Algorithms Using Lazy Monolithic Arrays. J. Funct. Program. 8(4): 323-333 (1998)- 1996
- [j3]Thomas Johnsson, Ewert Bengtsson:
Data Parallel Supervised Classification Algorithms on Multispectral Images. Int. J. Pattern Recognit. Artif. Intell. 10(7): 751-767 (1996) - [c11]Urban Boquist, Thomas Johnsson:
The GRIN Project: A Highly Optimising Back End for Lazy Functional Languages. Implementation of Functional Languages 1996: 58-84 - 1995
- [c10]Thomas Johnsson:
Graph reduction, and how to avoid it. SEGRAGRA 1995: 139-152 - 1994
- [c9]Thomas Johnsson:
Fold-Unfold Transformations on State Monadic Interpreters. Functional Programming 1994: 127-140 - 1992
- [j2]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. ACM SIGPLAN Notices 27(5): 1- (1992) - 1991
- [c8]Thomas Johnsson:
Parallel Evaluation of Functional Programs: The (v, G)-Machine Approach. PARLE (1) 1991: 1-5 - 1990
- [c7]Thomas Johnsson:
Analysing Heap Contents in a Graph Reduction Intermediate Language. Functional Programming 1990: 146-171
1980 – 1989
- 1989
- [j1]Lennart Augustsson, Thomas Johnsson:
The Chalmers Lazy-ML Compiler. Comput. J. 32(2): 127-141 (1989) - [c6]Lennart Augustsson, Thomas Johnsson:
Parallel Graph Reduction with the <nu, G>-Machine. FPCA 1989: 202-213 - 1987
- [c5]Thomas Johnsson:
Attribute grammars as a functional programming paradigm. FPCA 1987: 154-173 - 1986
- [c4]Thomas Johnsson:
Target code generation from G-machine code. Graph Reduction 1986: 119-159 - 1985
- [c3]Thomas Johnsson:
Lambda Lifting: Treansforming Programs to Recursive Equations. FPCA 1985: 190-203 - 1984
- [c2]Thomas Johnsson:
Efficient compilation of lazy evaluation (with retrospective). Best of PLDI 1984: 125-138 - [c1]Thomas Johnsson:
Efficient compilation of lazy evaluation. SIGPLAN Symposium on Compiler Construction 1984: 58-69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
