 | 2003 |
| 9 |  | Sven-Olof Nyström:
A soft-typing system for Erlang.
Erlang Workshop 2003: 56-71 |
| 8 |  | Johan Runeson,
Sven-Olof Nyström:
Retargetable Graph-Coloring Register Allocation for Irregular Architectures.
SCOPES 2003: 240-254 |
| 2000 |
| 7 |  | Erik Johansson,
Sven-Olof Nyström:
Profile-guided optimization across process boundaries.
Dynamo 2000: 23-31 |
| 6 |  | Johan Runeson,
Sven-Olof Nyström,
Jan Sjödin:
Optimizing Code Size through Procedural Abstraction.
LCTES 2000: 204-205 |
| 1998 |
| 5 |  | Sven-Olof Nyström,
Bengt Jonsson:
A Fully Abstract Semantics for Concurrent Constraint Programming.
Inf. Comput. 146(2): 138-180 (1998) |
| 1996 |
| 4 |  | Sven-Olof Nyström:
There is no Fully Abstract Fixpoint Semantics for Non-Deterministic Languages with Infinite Computations.
Inf. Process. Lett. 60(6): 289-293 (1996) |
| 1993 |
| 3 |  | Sven-Olof Nyström,
Bengt Jonsson:
Indeterminate Concurrent Constraint Programming: A Fixpoint Semantics for Non-Terminating Computations.
ILPS 1993: 335-352 |
| 1989 |
| 2 |  | Sven-Olof Nyström:
Variable-Free Execution of Concurrent Logic Languages.
NACLP 1989: 536-552 |
| 1988 |
| 1 |  | Sven-Olof Nyström:
Control Structures for Guarded Horn Clauses.
ICLP/SLP 1988: 1351-1370 |