| General Recursion on Second Order Term Algebras | 1 | 0.38 | 2001 |
| Fixed point equations inside the algebra of normal forms | 1 | 0.36 | 1999 |
| Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper) | 0 | 0.34 | 1997 |
| Lambda-Definition of Function(al)s by Normal Forms | 8 | 0.52 | 1994 |
| The ant-lion paradigm for strong normalization | 7 | 0.56 | 1994 |
| A Self-Interpreter of Lambda Calculus Having a Normal Form | 11 | 0.81 | 1992 |
| About systems of equations, X-separability, and left-invertibility in the &lgr;-calculus | 2 | 0.60 | 1991 |
| Subduing Self-Application | 1 | 0.58 | 1989 |
| Functional Programming and Combinatory Algebras | 4 | 0.62 | 1988 |
| Characterizing X-Separability and One-Side Invertibility in lambda-beta-Omega-Calculus | 0 | 0.34 | 1988 |
| Surjectivity for Finite Sets of Combinators by Weak Reduction | 0 | 0.34 | 1987 |
| X-Separability and Left-Invertibility in lambda-calculus | 0 | 0.34 | 1987 |
| Automatic Synthesis of Typed Lambda-Programs on Term Algebras | 33 | 5.81 | 1985 |
| Combinatory foundation of functional programming | 5 | 0.82 | 1982 |
| CAAP '81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings | 25 | 7.93 | 1981 |
| Complexity bounds for equivalence and isomorphism of latin squares | 0 | 0.34 | 1980 |
| A Discrimination Algorithm Inside lambda-beta-Calculus | 8 | 0.52 | 1979 |
| Automata, Languages and Programming, Fifth Colloquium, Udine, Italy, July 17-21, 1978, Proceedings | 35 | 152.79 | 1978 |
| Termination Tests inside lambda-Calculus | 0 | 0.34 | 1977 |
| Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, March 25-27, 1975 | 22 | 28.99 | 1975 |
| Lambda-terms as total or partial functions on normal forms | 3 | 3.87 | 1975 |
| Combinatorial Problems, Combinator Equations and Normal Forms | 10 | 5.53 | 1974 |
| Listing of information structures defined by fixed-point operators | 0 | 0.34 | 1974 |
| Notes on “A CUCH-machine: The automatic treatment of bound variables” | 0 | 0.34 | 1973 |
| Can Syntax Be Ignored during Translation? | 0 | 0.34 | 1972 |
| A CUCH-machine: The automatic treatment of bound variables | 5 | 3.29 | 1972 |
| Flow diagrams, turing machines and languages with only two formation rules | 306 | 196.41 | 1966 |
