- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| j24 |      | Benedetto Intrigila, Richard Statman: Solution to the Range Problem for Combinatory Logic. Fundam. Inform. 111(2): 203-222 (2011) |
| 2009 | ||
| j23 | | Benedetto Intrigila, Richard Statman: The Omega Rule is Π11-Complete in the λβ-Calculus. Logical Methods in Computer Science 5(2) (2009) |
| 2007 | ||
| c20 | | Benedetto Intrigila, Richard Statman: The Omega Rule is P11-Complete in the lambdabeta -Calculus. TLCA 2007: 178-193 |
| 2006 | ||
| j22 | | Benedetto Intrigila, Richard Statman: Solution of a Problem of Barendregt on Sensible lambda-Theories. Logical Methods in Computer Science 2(4) (2006) |
| i1 | | Benedetto Intrigila, Richard Statman: Solution of a Problem of Barendregt on Sensible lambda-Theories. CoRR abs/cs/0609080 (2006) |
| 2005 | ||
| j21 | | Benedetto Intrigila, Richard Statman: Some results on extensionality in lambda calculus. Ann. Pure Appl. Logic 132(2-3): 109-125 (2005) |
| c19 | | Richard Statman, Henk Barendregt: Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. Processes, Terms and Cycles 2005: 40-54 |
| c18 | | |
| 2004 | ||
| j20 | | |
| c17 | | Benedetto Intrigila, Richard Statman: The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. LICS 2004: 202-210 |
| 2002 | ||
| c16 | | |
| 2001 | ||
| j19 | | |
| 2000 | ||
| c15 | | |
| c14 | | |
| 1999 | ||
| j18 | | Richard Statman, Henk Barendregt: Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9(5): 565-575 (1999) |
| j17 | | Richard Statman: On the existence of n but not n + 1 easy combinators. Mathematical Structures in Computer Science 9(4): 361-365 (1999) |
| c13 | | Richard Statman: Consequences of Jacopini's Theorem: Consistent Equalities and Equations. TLCA 1999: 355-364 |
| 1998 | ||
| c12 | | |
| 1997 | ||
| j16 | | Paliath Narendran, Frank Pfenning, Richard Statman: On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62(2): 636-647 (1997) |
| c11 | | |
| 1996 | ||
| c10 | | |
| 1993 | ||
| j15 | | Richard Statman: Some Examples of Non-Existent Combinators. Theor. Comput. Sci. 121(1&2): 441-448 (1993) |
| c9 | | Paliath Narendran, Frank Pfenning, Richard Statman: On the Unification Problem for Cartesian Closed Categories. LICS 1993: 57-63 |
| 1992 | ||
| j14 | | Kaizhong Zhang, Richard Statman, Dennis Shasha: On the Editing Distance Between Unordered Labeled Trees. Inf. Process. Lett. 42(3): 133-139 (1992) |
| c8 | | Ugo de'Liguoro, Adolfo Piperno, Richard Statman: Retracts in simply typed lambda-beta-eta-calculus. LICS 1992: 461-469 |
| 1991 | ||
| c7 | | |
| 1989 | ||
| j13 | | Merrick L. Furst, Jonathan L. Gross, Richard Statman: Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46(1): 22-36 (1989) |
| j12 | | Richard Statman: The Word Problem for Smullyan's Lark Combinator is Decidable. J. Symb. Comput. 7(2): 103-112 (1989) |
| j11 | | Richard Statman: On Sets of Solutions to Combinator Equations. Theor. Comput. Sci. 66(1): 99-104 (1989) |
| 1988 | ||
| c6 | | John C. Cherniavsky, Mahendran Velauthapillai, Richard Statman: Inductive Inference: An Abstract Approach. COLT 1988: 251-266 |
| 1987 | ||
| c5 | | Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman: Empty Types in Polymorphic Lambda Calculus. POPL 1987: 253-262 |
| 1986 | ||
| j10 | | Ana Pasztor, Richard Statman: Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43: 251-263 (1986) |
| j9 | | Richard Statman: Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. Theor. Comput. Sci. 48(3): 95-100 (1986) |
| c4 |  | Richard Statman: On Translating Lambda Terms into Combinators; The Basis Problem. LICS 1986: 378-382 |
| 1985 | ||
| j8 | | Richard Statman: Logical Relations and the Typed lambda-Calculus. Information and Control 65(2/3): 85-97 (1985) |
| 1984 | ||
| j7 | | Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman: On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46 (1984) |
| 1982 | ||
| j6 | | Harry R. Lewis, Richard Statman: Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15(5): 220-222 (1982) |
| j5 | | Richard Statman: Completeness, Invariance and lambda-Definability. J. Symb. Log. 47(1): 17-26 (1982) |
| 1981 | ||
| j4 | | Richard Statman: On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. Theor. Comput. Sci. 15: 329-338 (1981) |
| c3 | | Richard Statman: Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract). FOCS 1981: 279-282 |
| 1980 | ||
| j3 | | Richard Statman: Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. SIAM J. Comput. 9(1): 104-110 (1980) |
| 1979 | ||
| j2 | | Richard Statman: Intuitionistic Propositional Logic is Polynomial-Space Complete. Theor. Comput. Sci. 9: 67-72 (1979) |
| j1 | | Richard Statman: The Typed lambda-Calculus is not Elementary Recursive. Theor. Comput. Sci. 9: 73-81 (1979) |
| c2 | | John S. Gourlay, William C. Rounds, Richard Statman: On Properties Preserved by Contraction of Concurrent Systems. Semantics of Concurrent Computation 1979: 51-65 |
| 1977 | ||
| c1 | | |
Colors in the list of coauthors
Last update Fri May 24 02:07:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page