| 2012 | ||
|---|---|---|
| c8 | Ilona Wilmont, Erik Barendsen, Stijn Hoppenbrouwers, Sytse Hengeveld: Abstract Reasoning in Collaborative Modeling. HICSS 2012: 170-179 | |
| c7 | Ilona Wilmont, Erik Barendsen, Stijn Hoppenbrouwers: Determining the Role of Abstraction and Executive Control in Process Modeling. PoEM (Short Papers) 2012 | |
| 2009 | ||
| c6 | 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 | ||
| j6 | Henk Barendregt, Erik Barendsen: Autarkic Computations in Formal Proofs. J. Autom. Reasoning 28(3): 321-336 (2002) | |
| 1999 | ||
| j5 | 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 | ||
| j4 | 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) | |
| j3 | Erik Barendsen, Sjaak Smetsers: Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Mathematical Structures in Computer Science 6(6): 579-612 (1996) | |
| 1995 | ||
| j2 | Erik Barendsen, Sjaak Smetsers: A derivation system for uniqueness typing. Electr. Notes Theor. Comput. Sci. 2: 11-18 (1995) | |
| c5 | Erik Barendsen, Sjaak Smetsers: Uniqueness Typing in Natural Deduction Style. Functional Programming 1995: 1 | |
| c4 | ||
| 1993 | ||
| c3 | Erik Barendsen, Sjaak Smetsers: Extending Graph Rewriting with Copying. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 51-70 | |
| c2 | 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 | |
| c1 | Erik Barendsen, Sjaak Smetsers: Conventional and Uniqueness Typing in Graph Rewrite Systems. FSTTCS 1993: 41-51 | |
| 1991 | ||
| j1 | Erik Barendsen: An Unsolvable Numeral System in lambda Calculus. J. Funct. Program. 1(3): 367-372 (1991) | |
| 1 | Hendrik Pieter Barendregt (Henk Barendregt) | |
| 2 | Marc Bezem | |
| 3 | Marko C. J. D. van Eekelen | |
| 4 | Herman Geuvers | |
| 5 | Sytse Hengeveld | |
| 6 | Stijn Hoppenbrouwers | |
| 7 | Benedict Oyo | |
| 8 | Marinus J. Plasmeijer (Rinus Plasmeijer) | |
| 9 | Sjaak Smetsers (J. E. W. Smetsers) | |
| 10 | Ddembe Williams | |
| 11 | Ilona Wilmont |
Colors in the list of coauthors
Last update Sat May 25 01:19:26 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page