| Many-valued logics inside λ-calculus: Church's rescue of Russell with B{\"}ohm trees. | 0 | 0.34 | 2018 |
| The infinitary lambda calculus of the infinite eta Böhm trees. | 0 | 0.34 | 2017 |
| On Undefined and Meaningless in Lambda Definability. | 0 | 0.34 | 2016 |
| Approximation of Nested Fixpoints - A Coalgebraic View of Parametric Dataypes. | 0 | 0.34 | 2015 |
| NOMINAL COALGEBRAIC DATA TYPES WITH APPLICATIONS TO LAMBDA CALCULUS | 9 | 0.62 | 2013 |
| Completeness of Conversion between Reactive Programs for Ultrametric Models. | 0 | 0.34 | 2013 |
| An Alpha-Corecursion Principle for the Infinitary Lambda Calculus. | 3 | 0.38 | 2012 |
| Meaningless Sets in Infinitary Combinatory Logic. | 1 | 0.35 | 2012 |
| Weakening the Axiom of Overlap in Infinitary Lambda Calculus | 6 | 0.51 | 2011 |
| Decomposing the lattice of meaningless sets in the infinitary lambda calculus | 1 | 0.35 | 2011 |
| Infinitary rewriting: from syntax to semantics | 5 | 0.56 | 2005 |
| Order structures on böhm-like models | 3 | 0.40 | 2005 |
| Continuity and discontinuity in lambda calculus | 6 | 0.60 | 2005 |
| Infinitary lambda calculus and discrimination of Berarducci trees | 8 | 0.56 | 2003 |
| Intersection types for lambda-trees | 0 | 0.34 | 2002 |
| Böhm's theorem for Berarducci trees. | 1 | 0.36 | 2000 |
| Meaningless Terms in Rewriting | 30 | 1.36 | 1999 |
| Types for trees | 3 | 0.42 | 1998 |
| Comparing curried and uncurried rewriting | 26 | 1.45 | 1996 |
| Infinitary Lambda Calculi and Böhm Models | 11 | 0.69 | 1995 |
| Transfinite reductions in orthogonal term rewriting systems | 90 | 5.89 | 1995 |
| Reasoning about update logic | 4 | 1.01 | 1995 |
| Syntactic Definitions of Undefined: On Defining the Undefined | 12 | 1.03 | 1994 |
| Dynamic Interpretation and Hoare Deduction | 13 | 1.71 | 1992 |
| Transfinite reductions in orthogonal term rewriting systems (extended abstract) | 12 | 1.04 | 1991 |
| A functional program for the fast Fourier transform | 0 | 0.34 | 1988 |
