Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Thomas Johnsson"'
Autor:
Thomas Johnsson
Publikováno v:
SIGPLAN Symposium on Compiler Construction
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules i
Autor:
Liam Good, Tomas Hökfelt, Henrik Oerum, Alexei A. Koshkin, Frank Porreca, Jesper Wengel, Kunkun Ren, Thomas Johnsson, Michael H. Ossipov, Nana Jakobsen, Josephine Lai, Claes Wahlestedt, Johanna Kela, Christian Broberger, Mogens Havsteen Jacobsen, Peter Salmi, Jan Skouv
Publikováno v:
Proceedings of the National Academy of Sciences. 97:5633-5638
Insufficient efficacy and/or specificity of antisense oligonucleotides limit their in vivo usefulness. We demonstrate here that a high-affinity DNA analog, locked nucleic acid (LNA), confers several desired properties to antisense agents. Unlike DNA,
Autor:
Thomas Johnsson
Publikováno v:
Journal of Functional Programming. 8:323-333
Many, perhaps even most, algorithms that involve data structures are traditionally expressed by incremental updates of the data structures. In functional languages, however, incremental updates are usually both clumsy and inefficient, especially when
Autor:
Pontus Larsson, Thomas Johnsson, Tove Hammarberg, Hans-Erik Claesson, Jan Åke Lindgren, Olof Rådmark
Publikováno v:
Biochemical Pharmacology. 55:863-871
5-Lipoxygenase (EC 1.13.11.34) is the key enzyme in the regulation of leukotriene synthesis. Here, the effects of various substituted nitrobenzene compounds on 5-lipoxygenase activity and the formation of leukotriene B 4 (LTB 4 ) were studied in poly
Autor:
Thomas Johnsson
Publikováno v:
Electronic Notes in Theoretical Computer Science. 2:139-152
In the first part of this talk, I will review the thought that led to the G-machine. In the second part, I will describe some recent work on formalising the 'avoiding graph reduction' bit, by doing fold/unfold transformation on a basic inefficient gr
Autor:
Kevin Hammond, Dick Kieburtz, Rishiyur S. Nikhil, Joseph Fasel, Will Partain, John Peterson, John Hughes, Philip Wadler, Brian Boutel, Paul Hudak, Thomas Johnsson, Simon Jones, María M. Guzmán, Jon Fairbairn
Publikováno v:
ACM SIGPLAN Notices. 27:1-164
"Some half dozen persons have written technically on combinatory logic, and most of these, including ourselves, have published something erroneous. Since some of our fellow sinners are among the most careful and competent logicians on the contemporar
Publikováno v:
Biomaterials. 18(9)
The purpose of this investigation was to examine the effect of the surface macrostructure of a dimpled commercially pure titanium (cp Ti) implant on bone ingrowth in vivo by means of histological examination and a push-out test. Cylindrical implants
Autor:
Urban Boquist, Thomas Johnsson
Publikováno v:
Implementation of Functional Languages ISBN: 9783540632375
Implementation of Functional Languages
Implementation of Functional Languages
Low level optimisations from conventional compiler technology often give very poor results when applied to code from lazy functional languages, mainly because of the completely different structure of the code, unknown control flow, etc. A novel appro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f29e494e64b45964bc651296ef40920
https://doi.org/10.1007/3-540-63237-9_19
https://doi.org/10.1007/3-540-63237-9_19
Autor:
Thomas Johnsson
Publikováno v:
Functional Programming, Glasgow 1994 ISBN: 9783540199144
Functional Programming
Functional Programming
In this paper we advocate the use of fold-unfold transformations for mastering the complexity of abstract machines intended for real implementations. The idea is to express the abstract machine as an interpreter in a purely functional language. The i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb587089afac50eaf19af3621c0b2a65
https://doi.org/10.1007/978-1-4471-3573-9_9
https://doi.org/10.1007/978-1-4471-3573-9_9
Autor:
Thomas Johnsson
Publikováno v:
Workshops in Computing ISBN: 9783540196679
Functional Programming
Functional Programming
We present an algorithm to analyse graph reduction intermediate code, which gives a safe approximation to what kind of nodes (i.e. which constructors and/or unevaluated function applications) pointers might point to at different points in the program
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22afd0ca2831194f551d231e89863e73
https://doi.org/10.1007/978-1-4471-3810-5_13
https://doi.org/10.1007/978-1-4471-3810-5_13