2010

Maarten de Mol and Arend Rensink.
On A Graph Formalism with Ordered Edges.
Submitted to GT-VMT.
[pdf-to-appear] [preliminary-technical-report-pdf]

Peter Achten, Marko van Eekelen, Maarten de Mol and Rinus Plasmeijer.
A common arrow based semantics for GEC and iData applications.
Submitted to JFP.
[pdf-to-appear]

2008

Peter Achten, Marko van Eekelen, Maarten de Mol and Rinus Plasmeijer.
A common arrow based semantics for GEC and iData applications.
Technical report ICIS-R08023, December, Radboud University Nijmegen, 2008.
[pdf]

Maarten de Mol.
Reasoning about functional programs - Sparkle: a proof assistant for Clean.
PhD-thesis, Radboud University Nijmegen, The Netherlands, 2009. ISBN 978-90-9023885-2.
[pdf]

Maarten de Mol, Marko van Eekelen and Rinus Plasmeijer.
A single-step term-graph reduction system for proof assistants.
In Andy Schürr, Manfred Nagl, and Albert Zündorf, editors, Revised selected and invited papers from the 3rd international symposium on applications of graph transformations with industrial relevance, AGTIVE 2007, volume 5088 of LNCS, pages 184-200, Kassel, Germany, 2008. Springer.
[springer-link]

Maarten de Mol, Marko van Eekelen and Rinus Plasmeijer.
Proving properties of lazy functional programs with Sparkle.
In Zoltán Horváth, editor, 2nd Central-European functional programming school, CEFP 2007, volume 5161 of LNCS, pages 41-86, Cluj-Napoca, Romania, 2008. Springer.
[springer-link]

2007

Maarten de Mol, Marko van Eekelen and Rinus Plasmeijer.
The mathematical foundation of the proof assistant Sparkle.
Technical report ICIS-R07025, November, Radboud University Nijmegen, 2007.
[pdf]

Marko van Eekelen and Maarten de Mol.
Proving lazy folklore with mixed lazy/strict semantics.
In Erik Barendsen, Venanzio Capretta, Herman Geuvers, and Milad Niqui, editors, Reflections on type theory, λ-calculus and the mind. Essays dedicated to Henk Barendregt on the occasion of his 60th birthday, pages 87-101. Radboud University Nijmegen, The Netherlands, 2007.
[Radboud-Repository-link]

Maarten de Mol, Marko van Eekelen and Rinus Plasmeijer.
Confluent term-graph reduction for computer-aided formal reasoning.
Technical report ICIS-R07012, May, Radboud University Nijmegen, 2007.
[pdf]

2006

Marko van Eekelen and Maarten de Mol.
Proof tool support for explicit strictness.
In Andrew Butterfield, Clemens Grelck, and Frank Huch, editors, Selected papers from the 17th international workshop on the implementation of functional languages, IFL 2005, volume 4015 of LNCS, pages 37-54, Dublin, Ireland, 2006. Springer.
[springer-link]

2004

Ron van Kesteren, Marko van Eekelen and Maarten de Mol.
Proof support for general type classes.
In Hans-Wolfgang Loidl, editor, Selected papers from the 5th international symposium on trends in functional programming, TFP 2004, pages 1-16, München, Germany, 2004. Intellect.
[pdf]

Malcolm Dowse, Andrew Butterfield, Marko van Eekelen, Maarten de Mol and Rinus Plasmeijer.
Towards machine-verified proofs for I/O.
Technical report NIII-R0415, April, Radboud University Nijmegen, 2004.
[pdf]

Marko van Eekelen and Maarten de Mol.
Mixed lazy/strict natural semantics.
Technical report NIII-R0402, January, Radboud University Nijmegen, 2004.
[missing-pdf]

2002

Maarten de Mol, Marko van Eekelen and Rinus Plasmeijer.
Theorem proving for functional programmers - Sparkle: a functional theorem prover.
In Thomas Arts and Markus Mohnen, editors, Selected papers from the 13th international workshop on the implementation of functional languages, IFL 2001, volume 2312 of LNCS, pages 55-72, Stockholm, Sweden, 2002. Springer.
[springer-link]

1999

Maarten de Mol and Marko van Eekelen.
A proof tool dedicated to Clean: the first prototype.
In Manfred Nagl, Andy Schürr, and Manfred Münch, editors, Selected papers from the 1st international workshop on applications of graph transformations with industrial relevance, AGTIVE 1999, volume 1779 of LNCS, pages 271-278, Kerkrade, The Netherlands, 1999. Springer.
[springer-link]

Maarten de Mol and Marko van Eekelen.
A prototype dedicated theorem prover for Clean.
Technical report CSI-R9913, October, Radboud University Nijmegen, 1999.
[pdf]