The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marko C. J. D. van Eekelen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Achten, Marko C. J. D. van Eekelen, Rinus Plasmeijer, Arjen van Weelden
    GEC: A Toolkit for Generic Rapid Prototyping of Type Safe Interactive Applications. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 2004, pp:210-244 [Conf]
  2. Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Constructing Medium Sized Efficient Functional Programs in Clean. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1995, pp:183-227 [Conf]
  3. Marinus J. Plasmeijer, Marko C. J. D. van Eekelen
    Term Graph Rewriting and Mobile Expressions in Functional Languages. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 1999, pp:1-13 [Conf]
  4. Maarten de Mol, Marko C. J. D. van Eekelen
    A Proof Tool Dedicated to Clean - The First Prototype. [Citation Graph (0, 0)][DBLP]
    AGTIVE, 1999, pp:271-278 [Conf]
  5. Peter Achten, Marko C. J. D. van Eekelen, Rinus Plasmeijer, Arjen van Weelden
    Automatic Generation of Editors for Higher-Order Data Structures. [Citation Graph (0, 0)][DBLP]
    APLAS, 2004, pp:262-279 [Conf]
  6. 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]
  7. Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, J. E. W. Smetsers
    Parallel Graph Rewriting on Loosely Coupled Machine Architectures. [Citation Graph (0, 0)][DBLP]
    CTRS, 1990, pp:354-369 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Graph Transformations in Computer Science, 1993, pp:358-379 [Conf]
  9. T. H. Brus, Marko C. J. D. van Eekelen, M. O. van Leer, Marinus J. Plasmeijer
    CLEAN: A language for functional graph writing. [Citation Graph (0, 0)][DBLP]
    FPCA, 1987, pp:364-384 [Conf]
  10. Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Specification of reduction strategies in term rewriting systems. [Citation Graph (0, 0)][DBLP]
    Graph Reduction, 1986, pp:215-239 [Conf]
  11. Marko C. J. D. van Eekelen, Maarten de Mol
    Proof Tool Support for Explicit Strictness. [Citation Graph (0, 0)][DBLP]
    IFL, 2005, pp:37-54 [Conf]
  12. Peter Achten, Marko C. J. D. van Eekelen, Rinus Plasmeijer
    Generic Graphical User Interfaces. [Citation Graph (0, 0)][DBLP]
    IFL, 2003, pp:152-167 [Conf]
  13. Maarten de Mol, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Theorem Proving for Functional Programmers. [Citation Graph (0, 0)][DBLP]
    IFL, 2001, pp:55-71 [Conf]
  14. Malcolm Dowse, Andrew Butterfield, Marko C. J. D. van Eekelen
    Reasoning About Deterministic Concurrent Functional I/O. [Citation Graph (0, 0)][DBLP]
    IFL, 2004, pp:177-194 [Conf]
  15. Thorsten H.-G. Zörner, Pieter W. M. Koopman, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Polygonizing Implicit Surfaces in a Purely Functional Way. [Citation Graph (0, 0)][DBLP]
    IFL, 2000, pp:158-175 [Conf]
  16. Peter Achten, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Compositional Model-Views with Generic Graphical User Interfaces. [Citation Graph (0, 0)][DBLP]
    PADL, 2004, pp:39-55 [Conf]
  17. Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep
    Term Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:141-158 [Conf]
  18. Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, John R. W. Glauert, Richard Kennaway, Marinus J. Plasmeijer, M. Ronan Sleep
    Towards an Intermediate Language based on Graph Rewriting. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1987, pp:159-175 [Conf]
  19. E. G. J. M. H. Nöcker, J. E. W. Smetsers, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Concurrent Clean. [Citation Graph (0, 0)][DBLP]
    PARLE (2), 1991, pp:202-219 [Conf]
  20. Walter A. C. A. J. de Hoon, Luc M. W. J. Rutten, Marko C. J. D. van Eekelen
    Implementing a Functional Spreadsheet in Clean. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1995, v:5, n:3, pp:383-414 [Journal]
  21. Hendrik Pieter Barendregt, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer, John R. W. Glauert, Richard Kennaway, M. Ronan Sleep
    LEAN: an intermediate language based on graph rewriting. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1989, v:9, n:2, pp:163-177 [Journal]
  22. Marinus J. Plasmeijer, Marko C. J. D. van Eekelen
    Keep it Clean: A Unique Approach to Functional Programming. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1999, v:34, n:6, pp:23-31 [Journal]
  23. Pieter W. M. Koopman, Marko C. J. D. van Eekelen, Marinus J. Plasmeijer
    Operational Machine Specification in a Functional Programming Language. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1995, v:25, n:5, pp:463-499 [Journal]
  24. Ron van Kesteren, Marko C. J. D. van Eekelen, Maarten de Mol
    Proof support for generic type classes. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2004, pp:1-16 [Conf]
  25. Olha Shkaravska, Ron van Kesteren, Marko C. J. D. van Eekelen
    Polynomial Size Analysis of First-Order Functions. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:351-365 [Conf]
  26. 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]

  27. A Single-Step Term-Graph Reduction System for Proof Assistants. [Citation Graph (, )][DBLP]


  28. Proving Properties of Lazy Functional Programs with Sparkle. [Citation Graph (, )][DBLP]


  29. Analysis of a Session-Layer Protocol in mCRL2. [Citation Graph (, )][DBLP]


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


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


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


  33. Polynomial Size Analysis of First-Order Shapely Functions [Citation Graph (, )][DBLP]


  34. Inferring Static Non-monotone Size-aware Types Through Testing. [Citation Graph (, )][DBLP]


Search in 0.019secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002