| Publication | Date of Publication | Type |
|---|
| The completeness of BCD for an operational semantics | 2026-02-20 | Paper |
| Church's Semigroup Is Sq-Universal. | 2023-06-23 | Paper |
On sets of terms having a given intersection type
Logical Methods in Computer Science | 2022-10-06 | Paper |
| Finite generation and presentation problems for lambda calculus and combinatory logic | 2022-07-01 | Paper |
| Products in a category with only one object | 2022-01-10 | Paper |
Products in a category with only one object
(available as arXiv preprint) | 2022-01-10 | Paper |
| Uniqueness typing for intersection types | 2021-05-05 | Paper |
Simple subtypes of intersection types
Fundamenta Informaticae | 2020-01-24 | Paper |
| On the representation of semigroups and other congruences in the lambda calculus | 2018-04-23 | Paper |
| How to think of intersection types as Cartesian products | 2018-04-23 | Paper |
| The completeness of BCD for an operational semantics | 2018-04-06 | Paper |
Fixed points in lambda calculus. an eccentric survey of problems and solutions
Indagationes Mathematicae. New Series | 2018-01-12 | Paper |
Effective reduction and conversion strategies for combinators
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Levy labels and recursive types
Logical Foundations of Computer Science | 2017-07-21 | Paper |
Taming the wild ant-lion; a counterexample to a conjecture of Böhm
Mathematical Structures in Computer Science | 2017-06-14 | Paper |
Lambda theories allowing terms with a finite number of fixed points
Mathematical Structures in Computer Science | 2017-04-03 | Paper |
| A new type assignment for strongly normalizable terms | 2017-02-02 | Paper |
Cartesian monoids
Electronic Notes in Theoretical Computer Science | 2016-07-08 | Paper |
Reflections on a Theorem of Henkin
Studies in Universal Logic | 2015-11-27 | Paper |
Near Semi-rings and Lambda Calculus
Lecture Notes in Computer Science | 2014-07-24 | Paper |
On polymorphic types of untyped terms
Journal of Computer and System Sciences | 2014-06-10 | Paper |
Solution to the range problem for combinatory logic
Fundamenta Informaticae | 2012-05-04 | Paper |
On polymorphic types of untyped terms
Logic, Language, Information and Computation | 2011-05-27 | Paper |
| scientific article; zbMATH DE number 5852776 (Why is no real title available?) | 2011-02-18 | Paper |
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus
Logical Methods in Computer Science | 2009-06-30 | Paper |
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
Lecture Notes in Computer Science | 2009-03-10 | Paper |
On the complexity of alpha conversion
Journal of Symbolic Logic | 2008-02-25 | Paper |
Solution of a Problem of Barendregt on Sensible lambda-Theories
Logical Methods in Computer Science | 2007-10-11 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Some results on extensionality in lambda calculus
Annals of Pure and Applied Logic | 2005-02-23 | Paper |
On the \(\lambda Y\) calculus
Annals of Pure and Applied Logic | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 1696772 (Why is no real title available?) | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1615239 (Why is no real title available?) | 2001-07-08 | Paper |
Marginalia to a theorem of Jacopini
Fundamenta Informaticae | 2001-04-17 | Paper |
Applications of Plotkin-terms: partitions and morphisms for closed terms
Journal of Functional Programming | 2000-10-17 | Paper |
On the existence of n but not n + 1 easy combinators
Mathematical Structures in Computer Science | 2000-06-29 | Paper |
| scientific article; zbMATH DE number 1342290 (Why is no real title available?) | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1342220 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1086683 (Why is no real title available?) | 1998-03-12 | Paper |
On the unification problem for Cartesian closed categories
Journal of Symbolic Logic | 1997-01-01 | Paper |
Some examples of non-existent combinators
Theoretical Computer Science | 1994-09-01 | Paper |
On the editing distance between unordered labeled trees
Information Processing Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 65759 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4160688 (Why is no real title available?) | 1990-01-01 | Paper |
Genus distributions for two classes of graphs
Journal of Combinatorial Theory. Series B | 1989-01-01 | Paper |
On sets of solutions to combinator equations
Theoretical Computer Science | 1989-01-01 | Paper |
The word problem for Smullyan's lark combinator is decidable
Journal of Symbolic Computation | 1989-01-01 | Paper |
An intersection problem for finite automata
Discrete Applied Mathematics | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4061217 (Why is no real title available?) | 1987-01-01 | Paper |
Scott induction and closure under \(\omega\)-sups
Theoretical Computer Science | 1986-01-01 | Paper |
Solving functional equations at higher types; some examples and some theorems
Notre Dame Journal of Formal Logic | 1986-01-01 | Paper |
Every countable poset is embeddable in the poset of unsolvable terms
Theoretical Computer Science | 1986-01-01 | Paper |
Logical relations and the typed λ-calculus
Information and Control | 1985-01-01 | Paper |
On the Structure of Armstrong Relations for Functional Dependencies
Journal of the ACM | 1984-01-01 | Paper |
λ-definable functionals andβη conversion
Archiv für Mathematische Logik und Grundlagenforschung | 1983-01-01 | Paper |
Completeness, invariance and λ-definability
Journal of Symbolic Logic | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3841911 (Why is no real title available?) | 1982-01-01 | Paper |
Unifiability is complete for co-N Log Space
Information Processing Letters | 1982-01-01 | Paper |
Topological subgraphs of cubic graphs and a theorem of dirac
Journal of Graph Theory | 1982-01-01 | Paper |
On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
Theoretical Computer Science | 1981-01-01 | Paper |
| Speed-Up by Theories with Infinite Models | 1981-01-01 | Paper |
Reductions of the graph reconstruction conjecture
Discrete Mathematics | 1981-01-01 | Paper |
Solution to a problem of Chang and Lee
Notre Dame Journal of Formal Logic | 1980-01-01 | Paper |
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation
SIAM Journal on Computing | 1980-01-01 | Paper |
The typed lambda-calculus is not elementary recursive
Theoretical Computer Science | 1979-01-01 | Paper |
Lower Bounds on Herbrand's Theorem
Proceedings of the American Mathematical Society | 1979-01-01 | Paper |
Intuitionistic propositional logic is polynomial-space complete
Theoretical Computer Science | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3624775 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3643258 (Why is no real title available?) | 1979-01-01 | Paper |
Bounds for proof-search and speed-up in the predicate calculus
Annals of Mathematical Logic | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3687372 (Why is no real title available?) | 1977-01-01 | Paper |
