J. E. W. Smetsers
List of publications from the
| 2007 |
| 20 | EE | Leonard Lensink,
Sjaak Smetsers,
Marko C. J. D. van Eekelen:
Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization.
FMICS 2007: 115-132 |
| 19 | EE | Bart Jacobs,
Sjaak Smetsers,
Ronny Wichers Schreur:
Code-carrying theories.
Formal Asp. Comput. 19(2): 191-203 (2007) |
| 2005 |
| 18 | EE | Artem Alimarine,
Sjaak Smetsers,
Arjen van Weelden,
Marko C. J. D. van Eekelen,
Rinus Plasmeijer:
There and back again: arrows for invertible programming.
Haskell 2005: 86-97 |
| 17 | EE | Arjen van Weelden,
Sjaak Smetsers,
Rinus Plasmeijer:
Polytypic Syntax Tree Operations.
IFL 2005: 142-159 |
| 16 | EE | Artem Alimarine,
Sjaak Smetsers:
Improved Fusion for Optimizing Generics.
PADL 2005: 203-218 |
| 2004 |
| 15 | EE | Artem Alimarine,
Sjaak Smetsers:
Optimizing Generic Functions.
MPC 2004: 16-31 |
| 2002 |
| 14 | EE | Diederik van Arkel,
John H. G. van Groningen,
Sjaak Smetsers:
Fusion in Practice.
IFL 2002: 51-67 |
| 1996 |
| 13 | | Marko C. J. D. van Eekelen,
Sjaak Smetsers,
Marinus J. Plasmeijer:
Graph Rewriting Semantics for Functional Programming Languages.
CSL 1996: 106-128 |
| 12 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Typing for Functional Languages with Graph Rewriting Semantics.
Mathematical Structures in Computer Science 6(6): 579-612 (1996) |
| 1995 |
| 11 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Typing in Natural Deduction Style.
Functional Programming 1995: 1 |
| 10 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Type Inference
PLILP 1995: 189-206 |
| 9 | EE | Erik Barendsen,
Sjaak Smetsers:
A derivation system for uniqueness typing.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1993 |
| 8 | | Sjaak Smetsers,
Erik Barendsen,
Marko C. J. D. van Eekelen,
Marinus J. Plasmeijer:
Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 358-379 |
| 7 | | Erik Barendsen,
Sjaak Smetsers:
Extending Graph Rewriting with Copying.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 51-70 |
| 6 | | Erik Barendsen,
Sjaak Smetsers:
Conventional and Uniqueness Typing in Graph Rewrite Systems.
FSTTCS 1993: 41-51 |
| 5 | | Eric Nöcker,
Sjaak Smetsers:
Partially Strict Non-Recursive Data Types.
J. Funct. Program. 3(2): 191-215 (1993) |
| 1992 |
| 4 | | Steffen van Bakel,
Sjaak Smetsers,
Simon Brock:
Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems.
CAAP 1992: 300-321 |
| 1991 |
| 3 | | Sjaak Smetsers,
Eric Nöcker,
John H. G. van Groningen,
Marinus J. Plasmeijer:
Generating Efficient Code for Lazy Functional Languages.
FPCA 1991: 592-617 |
| 2 | | E. G. J. M. H. Nöcker,
J. E. W. Smetsers,
Marko C. J. D. van Eekelen,
Marinus J. Plasmeijer:
Concurrent Clean.
PARLE (2) 1991: 202-219 |
| 1990 |
| 1 | | Marko C. J. D. van Eekelen,
Marinus J. Plasmeijer,
J. E. W. Smetsers:
Parallel Graph Rewriting on Loosely Coupled Machine Architectures.
CTRS 1990: 354-369 |