On Properties Preserved by Contraction of Concurrent Systems. - John S. Gourlay; William C. Rounds; Richard Statman (Semantics of Concurrent Computation, 1979)

Intuitionistic Propositional Logic is Polynomial-Space Complete. - Richard Statman (Theor. Comput. Sci., 1979)

The Typed lambda-Calculus is not Elementary Recursive. - Richard Statman (Theor. Comput. Sci., 1979)

Solution to a problem of Chang and Lee. - Richard Statman (Notre Dame J. Formal Log., 1980)

Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. - Richard Statman (SIAM J. Comput., 1980)

Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) - Richard Statman (FOCS, 1981)

Reductions of the graph reconstruction conjecture. - Richard Statman (Discret. Math., 1981)

On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. - Richard Statman (Theor. Comput. Sci., 1981)

Unifiability is Complete for co-NLogSpace. - Harry R. Lewis; Richard Statman (Inf. Process. Lett., 1982)

Topological subgraphs of cubic graphs and a theorem of dirac. - Richard Statman (J. Graph Theory, 1982)

Completeness, Invariance and lambda-Definability. - Richard Statman (J. Symb. Log., 1982)

λ-definable functionals andβη conversion. - Richard Statman (Arch. Math. Log., 1983)

On the Structure of Armstrong Relations for Functional Dependencies. - Catriel Beeri; Martin Dowd; Ronald Fagin; Richard Statman (J. ACM, 1984)

Logical Relations and the Typed lambda-Calculus - Richard Statman (Inf. Control., 1985)

On Translating Lambda Terms into Combinators; The Basis Problem - Richard Statman (LICS, 1986)

Solving functional equations at higher types: some examples and some theorems. - Richard Statman (Notre Dame J. Formal Log., 1986)

Scott Induction and Closure under omega-Sups. - Ana Pasztor; Richard Statman (Theor. Comput. Sci., 1986)

Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. - Richard Statman (Theor. Comput. Sci., 1986)

Empty Types in Polymorphic Lambda Calculus. - Albert R. Meyer; John C. Mitchell; Eugenio Moggi; Richard Statman (POPL, 1987)

Inductive Inference: An Abstract Approach. - John C. Cherniavsky; Mahendran Velauthapillai; Richard Statman (COLT, 1988)

An intersection problem for finite automata. - Michael E. Saks; Rick Statman (Discret. Appl. Math., 1988)

Genus distributions for two classes of graphs. - Merrick L. Furst; Jonathan L. Gross; Richard Statman (J. Comb. Theory B, 1989)

The Word Problem for Smullyan's Lark Combinator is Decidable. - Richard Statman (J. Symb. Comput., 1989)

On Sets of Solutions to Combinator Equations. - Richard Statman (Theor. Comput. Sci., 1989)

Freyd's Hierarchy of Combinator Monoids - Richard Statman (LICS, 1991)

Retracts in simply typed lambda-beta-eta-calculus - Ugo de'Liguoro; Adolfo Piperno; Richard Statman (LICS, 1992)

On the Editing Distance Between Unordered Labeled Trees. - Kaizhong Zhang; Richard Statman; Dennis E. Shasha (Inf. Process. Lett., 1992)

Some Examples of Non-Existent Combinators. - Richard Statman (Theor. Comput. Sci., 1993)

Effective Reduction and Conversion Strategies for Combinators. - Richard Statman (RTA, 1997)

On the Unification Problem for Cartesian Closed Categories. - Paliath Narendran; Frank Pfenning; Richard Statman (J. Symb. Log., 1997)

Morphisms and Partitions of V-sets. - Richard Statman (CSL, 1998)

Consequences of Jacopini's Theorem: Consistent Equalities and Equations. - Richard Statman (TLCA, 1999)

Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. - Richard Statman; Henk Barendregt (J. Funct. Program., 1999)

On the existence of n but not n + 1 easy combinators. - Richard Statman (Math. Struct. Comput. Sci., 1999)

Church's Lambda Delta Calculus. - Richard Statman (LPAR, 2000)

On the Word Problem for Combinators. - Richard Statman (RTA, 2000)

Marginalia to a Theorem of Jacopini. - Richard Statman (Fundam. Informaticae, 2001)

On The Lambda Y Calculus. - Richard Statman (LICS, 2002)

The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. - Benedetto Intrigila; Richard Statman (LICS, 2004)

On the lambdaY calculus. - Richard Statman (Ann. Pure Appl. Log., 2004)

Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. - Richard Statman; Henk Barendregt (Processes, Terms and Cycles, 2005)

Two Variables Are Not Enough. - Richard Statman (ICTCS, 2005)

Some results on extensionality in lambda calculus. - Benedetto Intrigila; Richard Statman (Ann. Pure Appl. Log., 2005)

Solution of a Problem of Barendregt on Sensible lambda-Theories. - Benedetto Intrigila; Richard Statman (Log. Methods Comput. Sci., 2006)

The Omega Rule is P11-Complete in the lambdabeta -Calculus. - Benedetto Intrigila; Richard Statman (TLCA, 2007)

On the complexity of alpha conversion. - Rick Statman (J. Symb. Log., 2007)

The Omega Rule is Π11-Complete in the λβ-Calculus - Benedetto Intrigila; Richard Statman (Log. Methods Comput. Sci., 2009)

Cartesian Monoids. - Rick Statman (MFPS, 2010)

Solution to the Range Problem for Combinatory Logic. - Benedetto Intrigila; Richard Statman (Fundam. Informaticae, 2011)

Lambda Calculus with Types. - Hendrik Pieter Barendregt; Wil Dekkers; Richard Statman (Cambridge University Press, 2013)

A New Type Assignment for Strongly Normalizable Terms. - Rick Statman (CSL, 2013)

Near Semi-rings and Lambda Calculus. - Rick Statman (RTA-TLCA, 2014)

A Finite Model Property for Intersection Types. - Rick Statman (ITRS, 2014)

On polymorphic types of untyped terms. - Rick Statman (J. Comput. Syst. Sci., 2014)

Levy Labels and Recursive Types. - Rick Statman (LFCS, 2016)

On the Representation of Semigroups and Other Congruences in the Lambda Calculus. - Rick Statman (MFPS, 2016)

How to Think of Intersection Types as Cartesian Products. - Rick Statman (MFPS, 2016)

Lambda theories allowing terms with a finite number of fixed points. - Benedetto Intrigila; Richard Statman (Math. Struct. Comput. Sci., 2017)

Taming the wild ant-lion; a counterexample to a conjecture of Böhm. - Rick Statman (Math. Struct. Comput. Sci., 2017)

The Completeness of BCD for an Operational Semantics. - Rick Statman (LFCS, 2018)

On sets of terms with a given intersection type. - Richard Statman (CoRR, 2018)

Simple SubTypes of Intersection Types. - Rick Statman (Fundam. Informaticae, 2019)

Products in a Category with Only One Object. - Richard Statman (ACT, 2020)

Church's Semigroup Is Sq-Universal. - Rick Statman (FSCD, 2021)

Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic. - Rick Statman (LFCS, 2022)

On sets of terms having a given intersection type. - Andrew Polonsky; Richard Statman (Log. Methods Comput. Sci., 2022)

On Statman's Finite Completeness Theorem. - Richard Statman; Gilles Dowek (CoRR, 2023)