Richard Statman

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