| Cons-free Programs and Complexity Classes between LOGSPACE and PTIME. | 0 | 0.34 | 2020 |
| On Modeling and Programming. | 0 | 0.34 | 2018 |
| Compiling untyped lambda calculus to lower-level code by game semantics and partial evaluation (invited paper). | 2 | 0.47 | 2017 |
| Asymptotic Speedups, Bisimulation And Distillation (Work In Progress) | 0 | 0.34 | 2014 |
| A Swiss Pocket Knife For Computability | 0 | 0.34 | 2013 |
| Distillation with labelled transition systems | 8 | 0.54 | 2012 |
| Obfuscation by partial evaluation of distorted interpreters | 15 | 0.65 | 2012 |
| Preface to a special section on verification, model checking, and abstract interpretation | 0 | 0.34 | 2011 |
| Proving the correctness of unfold/fold program transformations using bisimulation | 2 | 0.39 | 2011 |
| Programming In Biomolecular Computation: Programs, Self-Interpretation And Visualisation | 3 | 0.40 | 2011 |
| Computational biology: a programming perspective | 1 | 0.48 | 2011 |
| Size-change termination and transition invariants | 17 | 0.85 | 2010 |
| Programming in Biomolecular Computation | 2 | 0.49 | 2010 |
| Verification, Model Checking, and Abstract Interpretation, 10th International Conference, VMCAI 2009, Savannah, GA, USA, January 18-20, 2009. Proceedings | 20 | 1.86 | 2009 |
| A flow calculus of mwp-bounds for complexity analysis | 10 | 0.60 | 2009 |
| Call-by-value Termination in the Untyped Lambda-calculus | 8 | 0.57 | 2008 |
| CTL as an Intermediate Language | 0 | 0.34 | 2008 |
| Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time | 15 | 0.69 | 2008 |
| Flow analysis of lazy higher-order functional programs | 41 | 3.15 | 2007 |
| The semantics of "semantic patches" in Coccinelle: program transformation for the working programmer | 1 | 0.41 | 2007 |
| Redundant Call Elimination via Tupling | 7 | 0.64 | 2006 |
| The flow of data and the complexity of algorithms | 15 | 0.80 | 2005 |
| Termination analysis of higher-order functional programs | 26 | 0.93 | 2005 |
| Termination analysis and specialization-point insertion in offline partial evaluation | 18 | 0.81 | 2005 |
| Termination Analysis of the Untyped lamba-Calculus | 7 | 0.52 | 2004 |
| Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, Venice, Italy, January 14-16, 2004 | 1 | 0.41 | 2004 |
| Transformation by interpreter specialisation | 12 | 0.64 | 2004 |
| Compiler Optimization Correctness by Temporal Logic | 20 | 0.86 | 2004 |
| Program generation, termination, and binding-time analysis | 16 | 0.80 | 2002 |
| Abstract and conclusions of PLI invited paper: program generation, termination, and binding-time analysis | 1 | 2.25 | 2002 |
| Program Termination Analysis by Size-Change Graphs (Abstract) | 0 | 0.34 | 2001 |
| The expressive power of higher-order types or, life without CONS | 37 | 2.51 | 2001 |
| Computational complexity via programming languages: constant factors do matter | 7 | 0.68 | 2000 |
| LOGSPACE and PTIME characterized by programming languages | 40 | 2.24 | 1999 |
| EAPLS: the European Association for Programming Languages and Systems | 0 | 0.34 | 1999 |
| A precise version of a time hierarchy theorem | 6 | 0.59 | 1999 |
| Partial Evaluation for the Lambda Calculus | 0 | 0.34 | 1998 |
| Higher-Order Minimal Functional Graphs | 6 | 0.60 | 1997 |
| Combining Abstract Interpretation and Partial Evaluation (Brief Overview) | 21 | 0.80 | 1997 |
| An introduction to partial evaluation | 142 | 6.05 | 1996 |
| A Positive Supercompiler | 79 | 2.22 | 1996 |
| What Not to Do When Writing an Interpreter for Specialisation | 24 | 1.54 | 1996 |
| BTA Algorithms to Ensure Termination of Off-Line Partial Evaluation | 20 | 0.92 | 1996 |
| Special Address: MIX ten years after | 1 | 0.42 | 1995 |
| Complexity and computability from a programming language perspective | 0 | 0.34 | 1995 |
| Generalizing Cook's Transformation to Imperative Stack Programs | 9 | 0.95 | 1994 |
| Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC | 34 | 1.94 | 1994 |
| Abstraction interpretation and partial evaluation in functional and logic programming | 4 | 0.50 | 1994 |
| Logic, Language, and Computation: Festschrift in Honor of Satoru Takasu | 15 | 2.28 | 1994 |
| The Essence of Program Transformation by Partial Evaluation and Driving | 30 | 1.33 | 1994 |
