dblp.uni-trier.dewww.uni-trier.de

Richard Statman Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
44EEBenedetto Intrigila, Richard Statman: The Omega Rule is \mathbf{\Pi_{1}^{1}}-Complete in the \lambda\beta-Calculus Logical Methods in Computer Science 5(2): (2009)
2007
43EEBenedetto Intrigila, Richard Statman: The Omega Rule is P11-Complete in the lambdabeta -Calculus. TLCA 2007: 178-193
2006
42EEBenedetto Intrigila, Richard Statman: Solution of a Problem of Barendregt on Sensible lambda-Theories CoRR abs/cs/0609080: (2006)
41EEBenedetto Intrigila, Richard Statman: Solution of a Problem of Barendregt on Sensible lambda-Theories. Logical Methods in Computer Science 2(4): (2006)
2005
40EERichard Statman: Two Variables Are Not Enough. ICTCS 2005: 406-409
39EERichard Statman, Henk Barendregt: Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms. Processes, Terms and Cycles 2005: 40-54
38EEBenedetto Intrigila, Richard Statman: Some results on extensionality in lambda calculus. Ann. Pure Appl. Logic 132(2-3): 109-125 (2005)
2004
37EEBenedetto Intrigila, Richard Statman: The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. LICS 2004: 202-210
36EERichard Statman: On the lambdaY calculus. Ann. Pure Appl. Logic 130(1-3): 325-337 (2004)
2002
35EERichard Statman: On The Lambda Y Calculus. LICS 2002: 159-166
2001
34 Richard Statman: Marginalia to a Theorem of Jacopini. Fundam. Inform. 45(1-2): 117-121 (2001)
2000
33EERichard Statman: Church's Lambda Delta Calculus. LPAR 2000: 293-307
32EERichard Statman: On the Word Problem for Combinators. RTA 2000: 203-213
1999
31EERichard Statman: Consequences of Jacopini's Theorem: Consistent Equalities and Equations. TLCA 1999: 355-364
30 Richard Statman, Henk Barendregt: Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9(5): 565-575 (1999)
29 Richard Statman: On the existence of n but not n + 1 easy combinators. Mathematical Structures in Computer Science 9(4): 361-365 (1999)
1998
28EERichard Statman: Morphisms and Partitions of V-sets. CSL 1998: 313-322
1997
27EERichard Statman: Effective Reduction and Conversion Strategies for Combinators. RTA 1997: 299-307
26 Paliath Narendran, Frank Pfenning, Richard Statman: On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62(2): 636-647 (1997)
1996
25EERichard Statman: On Cartesian Monoids. CSL 1996: 446-459
1993
24 Paliath Narendran, Frank Pfenning, Richard Statman: On the Unification Problem for Cartesian Closed Categories LICS 1993: 57-63
23 Richard Statman: Some Examples of Non-Existent Combinators. Theor. Comput. Sci. 121(1&2): 441-448 (1993)
1992
22 Ugo de'Liguoro, Adolfo Piperno, Richard Statman: Retracts in simply typed lambda-beta-eta-calculus LICS 1992: 461-469
21 Kaizhong Zhang, Richard Statman, Dennis Shasha: On the Editing Distance Between Unordered Labeled Trees. Inf. Process. Lett. 42(3): 133-139 (1992)
1991
20 Richard Statman: Freyd's Hierarchy of Combinator Monoids LICS 1991: 186-190
1989
19EEMerrick L. Furst, Jonathan L. Gross, Richard Statman: Genus distributions for two classes of graphs. J. Comb. Theory, Ser. B 46(1): 22-36 (1989)
18 Richard Statman: The Word Problem for Smullyan's Lark Combinator is Decidable. J. Symb. Comput. 7(2): 103-112 (1989)
17 Richard Statman: On Sets of Solutions to Combinator Equations. Theor. Comput. Sci. 66(1): 99-104 (1989)
1988
16EEJohn C. Cherniavsky, Mahendran Velauthapillai, Richard Statman: Inductive Inference: An Abstract Approach. COLT 1988: 251-266
1987
15 Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman: Empty Types in Polymorphic Lambda Calculus. POPL 1987: 253-262
1986
14 Richard Statman: On Translating Lambda Terms into Combinators; The Basis Problem LICS 1986: 378-382
13 Ana Pasztor, Richard Statman: Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43: 251-263 (1986)
12 Richard Statman: Every Countable Poset is Embeddable in the Poset of Unsolvable Terms. Theor. Comput. Sci. 48(3): 95-100 (1986)
1985
11 Richard Statman: Logical Relations and the Typed lambda-Calculus Information and Control 65(2/3): 85-97 (1985)
1984
10EECatriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman: On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46 (1984)
1982
9 Harry R. Lewis, Richard Statman: Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15(5): 220-222 (1982)
8 Richard Statman: Completeness, Invariance and lambda-Definability. J. Symb. Log. 47(1): 17-26 (1982)
1981
7 Richard Statman: Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract) FOCS 1981: 279-282
6 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)
1980
5 Richard Statman: Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. SIAM J. Comput. 9(1): 104-110 (1980)
1979
4 John S. Gourlay, William C. Rounds, Richard Statman: On Properties Preserved by Contraction of Concurrent Systems. Semantics of Concurrent Computation 1979: 51-65
3 Richard Statman: Intuitionistic Propositional Logic is Polynomial-Space Complete. Theor. Comput. Sci. 9: 67-72 (1979)
2 Richard Statman: The Typed lambda-Calculus is not Elementary Recursive. Theor. Comput. Sci. 9: 73-81 (1979)
1977
1 Richard Statman: The Typed lambda-Calculus Is not Elementary Recursive FOCS 1977: 90-94

Coauthor Index

1Hendrik Pieter Barendregt (Henk Barendregt) [30] [39]
2Catriel Beeri [10]
3John C. Cherniavsky [16]
4Martin Dowd [10]
5Ronald Fagin [10]
6Merrick L. Furst [19]
7John S. Gourlay [4]
8Jonathan L. Gross [19]
9Benedetto Intrigila [37] [38] [41] [42] [43] [44]
10Harry R. Lewis [9]
11Albert R. Meyer [15]
12John C. Mitchell [15]
13Eugenio Moggi [15]
14Paliath Narendran [24] [26]
15Ana Pasztor [13]
16Frank Pfenning [24] [26]
17Adolfo Piperno [22]
18William C. Rounds [4]
19Dennis Shasha [21]
20Mahendran Velauthapillai [16]
21Kaizhong Zhang [21]
22Ugo de'Liguoro [22]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)