The SCEAS System
Navigation Menu

Search the dblp DataBase


Sjaak Smetsers: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Steffen van Bakel, Sjaak Smetsers, Simon Brock
    Partial Type Assignment in Left Linear Apllicative Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CAAP, 1992, pp:300-321 [Conf]
  2. Marko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer
    Graph Rewriting Semantics for Functional Programming Languages. [Citation Graph (0, 0)][DBLP]
    CSL, 1996, pp:106-128 [Conf]
  3. Erik Barendsen, Sjaak Smetsers
    Extending Graph Rewriting with Copying. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:51-70 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:358-379 [Conf]
  5. Erik Barendsen, Sjaak Smetsers
    Uniqueness Typing in Natural Deduction Style. [Citation Graph (0, 0)][DBLP]
    Functional Programming, 1995, pp:1- [Conf]
  6. Sjaak Smetsers, Eric Nöcker, John H. G. van Groningen, Marinus J. Plasmeijer
    Generating Efficient Code for Lazy Functional Languages. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:592-617 [Conf]
  7. Erik Barendsen, Sjaak Smetsers
    Conventional and Uniqueness Typing in Graph Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:41-51 [Conf]
  8. Diederik van Arkel, John H. G. van Groningen, Sjaak Smetsers
    Fusion in Practice. [Citation Graph (0, 0)][DBLP]
    IFL, 2002, pp:51-67 [Conf]
  9. Arjen van Weelden, Sjaak Smetsers, Rinus Plasmeijer
    Polytypic Syntax Tree Operations. [Citation Graph (0, 0)][DBLP]
    IFL, 2005, pp:142-159 [Conf]
  10. Artem Alimarine, Sjaak Smetsers
    Optimizing Generic Functions. [Citation Graph (0, 0)][DBLP]
    MPC, 2004, pp:16-31 [Conf]
  11. Artem Alimarine, Sjaak Smetsers
    Improved Fusion for Optimizing Generics. [Citation Graph (0, 0)][DBLP]
    PADL, 2005, pp:203-218 [Conf]
  12. Erik Barendsen, Sjaak Smetsers
    Uniqueness Type Inference [Citation Graph (0, 0)][DBLP]
    PLILP, 1995, pp:189-206 [Conf]
  13. Erik Barendsen, Sjaak Smetsers
    A derivation system for uniqueness typing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:2, n:, pp:- [Journal]
  14. Eric Nöcker, Sjaak Smetsers
    Partially Strict Non-Recursive Data Types. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1993, v:3, n:2, pp:191-215 [Journal]
  15. Erik Barendsen, Sjaak Smetsers
    Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1996, v:6, n:6, pp:579-612 [Journal]
  16. Artem Alimarine, Sjaak Smetsers, Arjen van Weelden, Marko C. J. D. van Eekelen, Rinus Plasmeijer
    There and back again: arrows for invertible programming. [Citation Graph (0, 0)][DBLP]
    Haskell, 2005, pp:86-97 [Conf]
  17. Bart Jacobs, Sjaak Smetsers, Ronny Wichers Schreur
    Code-carrying theories. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2007, v:19, n:2, pp:191-203 [Journal]

  18. Machine Checked Formal Proof of a Scheduling Protocol for Smartcard Personalization. [Citation Graph (, )][DBLP]

  19. Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving. [Citation Graph (, )][DBLP]

  20. Preemption Abstraction. [Citation Graph (, )][DBLP]

  21. Efficient and Type-Safe Generic Data Storage. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002