Richard Statman

Publication Activity (10 Years)

Years Active: 1977-2023
Publications (10 Years): 7

Top Topics

Operational Semantics

Top Venues

Math. Struct. Comput. Sci.

Log. Methods Comput. Sci.

Publications

Richard Statman, Gilles Dowek
On Statman's Finite Completeness Theorem. CoRR (2023)
Andrew Polonsky, Richard Statman
On sets of terms having a given intersection type. Log. Methods Comput. Sci. 18 (3) (2022)
Richard Statman, Andrew Polonsky
Uniqueness typing for intersection types. CoRR (2021)
Richard Statman
Products in a Category with Only One Object. ACT (2020)
Richard Statman
On sets of terms with a given intersection type. CoRR (2018)
Benedetto Intrigila, Richard Statman
Lambda theories allowing terms with a finite number of fixed points. Math. Struct. Comput. Sci. 27 (3) (2017)
Richard Statman
The Completeness of BCD for an Operational Semantics. TYPES (2016)
Benedetto Intrigila, Richard Statman
Solution to the Range Problem for Combinatory Logic. Fundam. Informaticae 111 (2) (2011)
Benedetto Intrigila, Richard Statman
-Complete in the λβ-Calculus Log. Methods Comput. Sci. 5 (2) (2009)
Benedetto Intrigila, Richard Statman
-Calculus. TLCA (2007)
Benedetto Intrigila, Richard Statman
Solution of a Problem of Barendregt on Sensible lambda-Theories. Log. Methods Comput. Sci. 2 (4) (2006)
Benedetto Intrigila, Richard Statman
Solution of a Problem of Barendregt on Sensible lambda-Theories CoRR (2006)
Richard Statman, Henk Barendregt
Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. Processes, Terms and Cycles (2005)
Benedetto Intrigila, Richard Statman
Some results on extensionality in lambda calculus. Ann. Pure Appl. Log. 132 (2-3) (2005)
Richard Statman
Two Variables Are Not Enough. ICTCS (2005)
Benedetto Intrigila, Richard Statman
The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. LICS (2004)
Richard Statman
calculus. Ann. Pure Appl. Log. 130 (1-3) (2004)
Richard Statman
On The Lambda Y Calculus. LICS (2002)
Richard Statman
Marginalia to a Theorem of Jacopini. Fundam. Informaticae 45 (1-2) (2001)
Richard Statman
On the Word Problem for Combinators. RTA (2000)
Richard Statman
Church's Lambda Delta Calculus. LPAR (2000)
Richard Statman, Henk Barendregt
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9 (5) (1999)
Richard Statman
On the existence of n but not n + 1 easy combinators. Math. Struct. Comput. Sci. 9 (4) (1999)
Richard Statman
Consequences of Jacopini's Theorem: Consistent Equalities and Equations. TLCA (1999)
Richard Statman
Morphisms and Partitions of V-sets. CSL (1998)
Paliath Narendran, Frank Pfenning, Richard Statman
On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62 (2) (1997)
Richard Statman
Effective Reduction and Conversion Strategies for Combinators. RTA (1997)
Richard Statman
On Cartesian Monoids. CSL (1996)
Richard Statman
Some Examples of Non-Existent Combinators. Theor. Comput. Sci. 121 (1&2) (1993)
Paliath Narendran, Frank Pfenning, Richard Statman
On the Unification Problem for Cartesian Closed Categories LICS (1993)
Ugo de'Liguoro, Adolfo Piperno, Richard Statman
Retracts in simply typed lambda-beta-eta-calculus LICS (1992)
Kaizhong Zhang, Richard Statman, Dennis E. Shasha
On the Editing Distance Between Unordered Labeled Trees. Inf. Process. Lett. 42 (3) (1992)
Richard Statman
Freyd's Hierarchy of Combinator Monoids LICS (1991)
Merrick L. Furst, Jonathan L. Gross, Richard Statman
Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46 (1) (1989)
Richard Statman
The Word Problem for Smullyan's Lark Combinator is Decidable. J. Symb. Comput. 7 (2) (1989)
Richard Statman
On Sets of Solutions to Combinator Equations. Theor. Comput. Sci. 66 (1) (1989)
John C. Cherniavsky, Mahendran Velauthapillai, Richard Statman
Inductive Inference: An Abstract Approach. COLT (1988)
Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman
Empty Types in Polymorphic Lambda Calculus. POPL (1987)
Richard Statman
Solving functional equations at higher types: some examples and some theorems. Notre Dame J. Formal Log. 27 (1) (1986)
Richard Statman
On Translating Lambda Terms into Combinators; The Basis Problem LICS (1986)
Richard Statman
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. Theor. Comput. Sci. 48 (3) (1986)
Ana Pasztor, Richard Statman
Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43 (1986)
Richard Statman
Logical Relations and the Typed lambda-Calculus Inf. Control. 65 (2/3) (1985)
Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman
On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31 (1) (1984)
Richard Statman
conversion. Arch. Math. Log. 23 (1) (1983)
Richard Statman
Topological subgraphs of cubic graphs and a theorem of dirac. J. Graph Theory 6 (4) (1982)
Richard Statman
Completeness, Invariance and lambda-Definability. J. Symb. Log. 47 (1) (1982)
Harry R. Lewis, Richard Statman
Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15 (5) (1982)
Richard Statman
On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. Theor. Comput. Sci. 15 (1981)
Richard Statman
Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) FOCS (1981)
Richard Statman
Reductions of the graph reconstruction conjecture. Discret. Math. 36 (1) (1981)
Richard Statman
Solution to a problem of Chang and Lee. Notre Dame J. Formal Log. 21 (3) (1980)
Richard Statman
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. SIAM J. Comput. 9 (1) (1980)
Richard Statman
Intuitionistic Propositional Logic is Polynomial-Space Complete. Theor. Comput. Sci. 9 (1979)
Richard Statman
The Typed lambda-Calculus is not Elementary Recursive. Theor. Comput. Sci. 9 (1979)
John S. Gourlay, William C. Rounds, Richard Statman
On Properties Preserved by Contraction of Concurrent Systems. Semantics of Concurrent Computation (1979)
Richard Statman
The Typed lambda-Calculus Is not Elementary Recursive FOCS (1977)