| 2009 |
|---|
| 12 | EE | Benedict Oyo,
Ddembe Williams,
Erik Barendsen:
Integrating Action Research and System Dynamics: Towards a Generic Process Design for Participative Modelling.
HICSS 2009: 1-11 |
| 2002 |
|---|
| 11 | | Henk Barendregt,
Erik Barendsen:
Autarkic Computations in Formal Proofs.
J. Autom. Reasoning 28(3): 321-336 (2002) |
| 1999 |
|---|
| 10 | | Herman Geuvers,
Erik Barendsen:
Some logical and syntactical observations concerning the first-order dependent type system lambda-P.
Mathematical Structures in Computer Science 9(4): 335-359 (1999) |
| 1996 |
|---|
| 9 | | Erik Barendsen,
Marc Bezem:
Polymorphic Extensions of Simple Type Structures - With an Application to Bar Recursive Minimization.
Ann. Pure Appl. Logic 79(3): 221-280 (1996) |
| 8 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Typing for Functional Languages with Graph Rewriting Semantics.
Mathematical Structures in Computer Science 6(6): 579-612 (1996) |
| 1995 |
|---|
| 7 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Typing in Natural Deduction Style.
Functional Programming 1995: 1 |
| 6 | | Erik Barendsen,
Sjaak Smetsers:
Uniqueness Type Inference
PLILP 1995: 189-206 |
| 5 | EE | Erik Barendsen,
Sjaak Smetsers:
A derivation system for uniqueness typing.
Electr. Notes Theor. Comput. Sci. 2: (1995) |
| 1993 |
|---|
| 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.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 358-379 |
| 3 | | Erik Barendsen,
Sjaak Smetsers:
Extending Graph Rewriting with Copying.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 51-70 |
| 2 | | Erik Barendsen,
Sjaak Smetsers:
Conventional and Uniqueness Typing in Graph Rewrite Systems.
FSTTCS 1993: 41-51 |
| 1991 |
|---|
| 1 | | Erik Barendsen:
An Unsolvable Numeral System in lambda Calculus.
J. Funct. Program. 1(3): 367-372 (1991) |
