Marko C. J. D. van Eekelen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Alejandro Tamalet

> Home > Persons > Marko C. J. D. van Eekelen

Publications

2013
[c46]
- view
  authority control:
- export record
  dblp key:
  - conf/fopara/ShkaravskaET13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fopara/ShkaravskaET13
Olha Shkaravska, Marko C. J. D. van Eekelen, Alejandro Tamalet:
Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists. FOPARA 2013: 143-159
2009
[c32]
- view
  authority control:
- export record
  dblp key:
  - conf/fmics/SchierboomTTES09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fmics/SchierboomTTES09
Erik Schierboom, Alejandro Tamalet, Hendrik Tews, Marko C. J. D. van Eekelen, Sjaak Smetsers:
Preemption Abstraction. FMICS 2009: 149-164
2008
[c30]
- view
  authority control:
- export record
  dblp key:
  - conf/ifl/ShkaravskaET08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifl/ShkaravskaET08
Olha Shkaravska, Marko C. J. D. van Eekelen, Alejandro Tamalet:
Collected Size Semantics for Functional Programs over Lists. IFL 2008: 118-137
[c29]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/sfp/TamaletSE08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sfp/TamaletSE08
Alejandro Tamalet, Olha Shkaravska, Marko C. J. D. van Eekelen:
Size Analysis of Algebraic Data Type. Trends in Functional Programming 2008: 33-48

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.