Richard Statman

Gilles Dowek

CoRR, 2023

2022

On sets of terms having a given intersection type.

[BibT_eX]

[DOI]

Andrew Polonsky

Log. Methods Comput. Sci., 2022

Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021

Church's Semigroup Is Sq-Universal.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020

Products in a Category with Only One Object.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

2019

Simple SubTypes of Intersection Types.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

2018

On sets of terms with a given intersection type.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Taming the wild ant-lion; a counterexample to a conjecture of Böhm.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Lambda theories allowing terms with a finite number of fixed points.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

2016

How to Think of Intersection Types as Cartesian Products.

[BibT_eX]

[DOI]

Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

On the Representation of Semigroups and Other Congruences in the Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

The Completeness of BCD for an Operational Semantics.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Levy Labels and Recursive Types.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2014

On polymorphic types of untyped terms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

A Finite Model Property for Intersection Types.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

Near Semi-rings and Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

A New Type Assignment for Strongly Normalizable Terms.

[BibT_eX]

[DOI]

Hendrik Pieter Barendregt

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Lambda Calculus with Types.

[BibT_eX]

[DOI]

Wil Dekkers

Perspectives in logic, Cambridge University Press, ISBN: 978-0-521-76614-2, 2013

2011

Solution to the Range Problem for Combinatory Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

2010

Cartesian Monoids.

[BibT_eX]

[DOI]

Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

2009

The Omega Rule is Π11-Complete in the λβ-Calculus

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2009

2007

On the complexity of alpha conversion.

[BibT_eX]

[DOI]

J. Symb. Log., 2007

The Omega Rule is P11-Complete in the lambdabeta -Calculus.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006

Solution of a Problem of Barendregt on Sensible lambda-Theories.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2006

2005

Some results on extensionality in lambda calculus.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2005

Two Variables Are Not Enough.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.

[BibT_eX]

[DOI]

Henk Barendregt

Proceedings of the Processes, 2005

2004

On the lambdaY calculus.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2004

The Omega Rule is II_2^0-Hard in the lambda beta -Calculus.

[BibT_eX]

[DOI]

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2002

On The Lambda Y Calculus.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001

Marginalia to a Theorem of Jacopini.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2001

2000

On the Word Problem for Combinators.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Church's Lambda Delta Calculus.

[BibT_eX]

[DOI]

Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999

On the existence of n but not n + 1 easy combinators.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1999

Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms.

[BibT_eX]

[DOI]

Henk Barendregt

J. Funct. Program., 1999

Consequences of Jacopini's Theorem: Consistent Equalities and Equations.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998

Morphisms and Partitions of V-sets.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

On the Unification Problem for Cartesian Closed Categories.

[BibT_eX]

[DOI]

Paliath Narendran

Frank Pfenning

J. Symb. Log., 1997

Effective Reduction and Conversion Strategies for Combinators.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1993

Some Examples of Non-Existent Combinators.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1992

On the Editing Distance Between Unordered Labeled Trees.

[BibT_eX]

[DOI]

Kaizhong Zhang

Dennis E. Shasha

Inf. Process. Lett., 1992

Retracts in simply typed lambda-beta-eta-calculus

[BibT_eX]

[DOI]

Ugo de'Liguoro

Adolfo Piperno

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

Freyd's Hierarchy of Combinator Monoids

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1989

On Sets of Solutions to Combinator Equations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

The Word Problem for Smullyan's Lark Combinator is Decidable.

[BibT_eX]

[DOI]

J. Symb. Comput., 1989

Genus distributions for two classes of graphs.

[BibT_eX]

[DOI]

Merrick L. Furst

Jonathan L. Gross

J. Comb. Theory, Ser. B, 1989

1988

An intersection problem for finite automata.

[BibT_eX]

[DOI]

Michael E. Saks

Discret. Appl. Math., 1988

Inductive Inference: An Abstract Approach.

[BibT_eX]

[DOI]

John C. Cherniavsky

Mahendran Velauthapillai

Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987

Empty Types in Polymorphic Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986

Every Countable Poset is Embeddable in the Poset of Unsolvable Terms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Scott Induction and Closure under omega-Sups.

[BibT_eX]

[DOI]

Ana Pasztor

Theor. Comput. Sci., 1986

Solving functional equations at higher types: some examples and some theorems.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1986

On Translating Lambda Terms into Combinators; The Basis Problem

[BibT_eX]

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985

Logical Relations and the Typed lambda-Calculus

[BibT_eX]

[DOI]

Inf. Control., 1985

1984

On the Structure of Armstrong Relations for Functional Dependencies.

[BibT_eX]

[DOI]

J. ACM, 1984

1983

λ-definable functionals andβη conversion.

[BibT_eX]

[DOI]

Arch. Math. Log., 1983

1982

Completeness, Invariance and lambda-Definability.

[BibT_eX]

[DOI]

J. Symb. Log., 1982

Topological subgraphs of cubic graphs and a theorem of dirac.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

Unifiability is Complete for co-NLogSpace.

[BibT_eX]

[DOI]

Harry R. Lewis

Inf. Process. Lett., 1982

1981

On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

Reductions of the graph reconstruction conjecture.

[BibT_eX]

[DOI]

Discret. Math., 1981

Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

Solution to a problem of Chang and Lee.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 1980

1979

The Typed lambda-Calculus is not Elementary Recursive.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

Intuitionistic Propositional Logic is Polynomial-Space Complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

On Properties Preserved by Contraction of Concurrent Systems.

[BibT_eX]

[DOI]

John S. Gourlay

William C. Rounds