The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Richard Statman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  44. The Omega Rule is \mathbf{\Pi_{1}^{1}}-Complete in the \lambda\beta-Calculus [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002