| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Benedetto Intrigila, Richard Statman |
Solution to the Range Problem for Combinatory Logic.  |
Fundam. Inform.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
The Omega Rule is Π11-Complete in the λβ-Calculus |
Logical Methods in Computer Science |
2009 |
DBLP BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
The Omega Rule is P11-Complete in the lambdabeta -Calculus. |
TLCA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
Solution of a Problem of Barendregt on Sensible lambda-Theories. |
Logical Methods in Computer Science |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
Solution of a Problem of Barendregt on Sensible lambda-Theories |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
Some results on extensionality in lambda calculus. |
Ann. Pure Appl. Logic |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Two Variables Are Not Enough. |
ICTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman, Henk Barendregt |
Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. |
Processes, Terms and Cycles |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On the lambdaY calculus. |
Ann. Pure Appl. Logic |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Benedetto Intrigila, Richard Statman |
The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On The Lambda Y Calculus. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Marginalia to a Theorem of Jacopini. |
Fundam. Inform. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
Church's Lambda Delta Calculus. |
LPAR |
2000 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
On the Word Problem for Combinators. |
RTA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On the existence of n but not n + 1 easy combinators. |
Mathematical Structures in Computer Science |
1999 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman, Henk Barendregt |
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. |
J. Funct. Program. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
Consequences of Jacopini's Theorem: Consistent Equalities and Equations. |
TLCA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Morphisms and Partitions of V-sets. |
CSL |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Paliath Narendran, Frank Pfenning, Richard Statman |
On the Unification Problem for Cartesian Closed Categories. |
J. Symb. Log. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
Effective Reduction and Conversion Strategies for Combinators. |
RTA |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On Cartesian Monoids. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Some Examples of Non-Existent Combinators. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Paliath Narendran, Frank Pfenning, Richard Statman |
On the Unification Problem for Cartesian Closed Categories |
LICS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaizhong Zhang, Richard Statman, Dennis Shasha |
On the Editing Distance Between Unordered Labeled Trees. |
Inf. Process. Lett. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Ugo de'Liguoro, Adolfo Piperno, Richard Statman |
Retracts in simply typed lambda-beta-eta-calculus |
LICS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Freyd's Hierarchy of Combinator Monoids |
LICS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Merrick L. Furst, Jonathan L. Gross, Richard Statman |
Genus distributions for two classes of graphs. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On Sets of Solutions to Combinator Equations. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
The Word Problem for Smullyan's Lark Combinator is Decidable. |
J. Symb. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | John C. Cherniavsky, Mahendran Velauthapillai, Richard Statman |
Inductive Inference: An Abstract Approach. |
COLT |
1988 |
DBLP BibTeX RDF |
|
| 1 | Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman |
Empty Types in Polymorphic Lambda Calculus. |
POPL |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ana Pasztor, Richard Statman |
Scott Induction and Closure under omega-Sups. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
On Translating Lambda Terms into Combinators; The Basis Problem |
LICS |
1986 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
Logical Relations and the Typed lambda-Calculus |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman |
On the Structure of Armstrong Relations for Functional Dependencies. |
J. ACM |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry R. Lewis, Richard Statman |
Unifiability is Complete for co-NLogSpace. |
Inf. Process. Lett. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Completeness, Invariance and lambda-Definability. |
J. Symb. Log. |
1982 |
DBLP BibTeX RDF |
|
| 1 | Richard Statman |
On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. |
Theor. Comput. Sci. |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) |
FOCS |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. |
SIAM J. Comput. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
Intuitionistic Propositional Logic is Polynomial-Space Complete. |
Theor. Comput. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
The Typed lambda-Calculus is not Elementary Recursive. |
Theor. Comput. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | John S. Gourlay, William C. Rounds, Richard Statman |
On Properties Preserved by Contraction of Concurrent Systems. |
Semantics of Concurrent Computation |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Statman |
The Typed lambda-Calculus Is not Elementary Recursive |
FOCS |
1977 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")