default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Statman
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Richard Statman, Gilles Dowek:
On Statman's Finite Completeness Theorem. CoRR abs/2309.03602 (2023)- 2022
- [j36]Andrew Polonsky, Richard Statman:
On sets of terms having a given intersection type. Log. Methods Comput. Sci. 18(3) (2022) - [c33]Rick Statman:
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic. LFCS 2022: 316-326 - 2021
- [c32]Rick Statman:
Church's Semigroup Is Sq-Universal. FSCD 2021: 6:1-6:6 - 2020
- [c31]Richard Statman:
Products in a Category with Only One Object. ACT 2020: 347-353
2010 – 2019
- 2019
- [j35]Rick Statman:
Simple SubTypes of Intersection Types. Fundam. Informaticae 170(1-3): 307-324 (2019) - 2018
- [c30]Rick Statman:
The Completeness of BCD for an Operational Semantics. LFCS 2018: 331-336 - [i2]Richard Statman:
On sets of terms with a given intersection type. CoRR abs/1809.08169 (2018) - 2017
- [j34]Benedetto Intrigila, Richard Statman:
Lambda theories allowing terms with a finite number of fixed points. Math. Struct. Comput. Sci. 27(3): 405-427 (2017) - [j33]Rick Statman:
Taming the wild ant-lion; a counterexample to a conjecture of Böhm. Math. Struct. Comput. Sci. 27(5): 734-737 (2017) - 2016
- [c29]Rick Statman:
Levy Labels and Recursive Types. LFCS 2016: 392-406 - [c28]Richard Statman:
The Completeness of BCD for an Operational Semantics. TYPES 2016: 15:1-15:5 - [c27]Rick Statman:
On the Representation of Semigroups and Other Congruences in the Lambda Calculus. MFPS 2016: 299-304 - [c26]Rick Statman:
How to Think of Intersection Types as Cartesian Products. MFPS 2016: 305-312 - 2014
- [j32]Rick Statman:
On polymorphic types of untyped terms. J. Comput. Syst. Sci. 80(6): 1163-1173 (2014) - [c25]Rick Statman:
Near Semi-rings and Lambda Calculus. RTA-TLCA 2014: 410-424 - [c24]Rick Statman:
A Finite Model Property for Intersection Types. ITRS 2014: 1-9 - 2013
- [b1]Hendrik Pieter Barendregt, Wil Dekkers, Richard Statman:
Lambda Calculus with Types. Perspectives in logic, Cambridge University Press 2013, ISBN 978-0-521-76614-2, pp. I-XXII, 1-833 - [c23]Rick Statman:
A New Type Assignment for Strongly Normalizable Terms. CSL 2013: 634-652 - 2011
- [j31]Benedetto Intrigila, Richard Statman:
Solution to the Range Problem for Combinatory Logic. Fundam. Informaticae 111(2): 203-222 (2011) - [c22]Rick Statman:
On Polymorphic Types of Untyped Terms. WoLLIC 2011: 239-256 - 2010
- [c21]Rick Statman:
Cartesian Monoids. MFPS 2010: 437-451
2000 – 2009
- 2009
- [j30]Benedetto Intrigila, Richard Statman:
The Omega Rule is Π11-Complete in the λβ-Calculus. Log. Methods Comput. Sci. 5(2) (2009) - 2007
- [j29]Rick Statman:
On the complexity of alpha conversion. J. Symb. Log. 72(4): 1197-1203 (2007) - [c20]Benedetto Intrigila, Richard Statman:
The Omega Rule is P11-Complete in the lambdabeta -Calculus. TLCA 2007: 178-193 - 2006
- [j28]Benedetto Intrigila, Richard Statman:
Solution of a Problem of Barendregt on Sensible lambda-Theories. Log. Methods Comput. Sci. 2(4) (2006) - [i1]Benedetto Intrigila, Richard Statman:
Solution of a Problem of Barendregt on Sensible lambda-Theories. CoRR abs/cs/0609080 (2006) - 2005
- [j27]Benedetto Intrigila, Richard Statman:
Some results on extensionality in lambda calculus. Ann. Pure Appl. Log. 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]Richard Statman:
Two Variables Are Not Enough. ICTCS 2005: 406-409 - 2004
- [j26]Richard Statman:
On the lambdaY calculus. Ann. Pure Appl. Log. 130(1-3): 325-337 (2004) - [c17]Benedetto Intrigila, Richard Statman:
The Omega Rule is II_2^0-Hard in the lambda beta -Calculus. LICS 2004: 202-210 - 2002
- [c16]Richard Statman:
On The Lambda Y Calculus. LICS 2002: 159-166 - 2001
- [j25]Richard Statman:
Marginalia to a Theorem of Jacopini. Fundam. Informaticae 45(1-2): 117-121 (2001) - 2000
- [c15]Richard Statman:
Church's Lambda Delta Calculus. LPAR 2000: 293-307 - [c14]Richard Statman:
On the Word Problem for Combinators. RTA 2000: 203-213
1990 – 1999
- 1999
- [j24]Richard Statman, Henk Barendregt:
Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms. J. Funct. Program. 9(5): 565-575 (1999) - [j23]Richard Statman:
On the existence of n but not n + 1 easy combinators. Math. Struct. Comput. Sci. 9(4): 361-365 (1999) - [c13]Richard Statman:
Consequences of Jacopini's Theorem: Consistent Equalities and Equations. TLCA 1999: 355-364 - 1998
- [c12]Richard Statman:
Morphisms and Partitions of V-sets. CSL 1998: 313-322 - 1997
- [j22]Paliath Narendran, Frank Pfenning, Richard Statman:
On the Unification Problem for Cartesian Closed Categories. J. Symb. Log. 62(2): 636-647 (1997) - [c11]Richard Statman:
Effective Reduction and Conversion Strategies for Combinators. RTA 1997: 299-307 - 1996
- [c10]Richard Statman:
On Cartesian Monoids. CSL 1996: 446-459 - 1993
- [j21]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
- [j20]Kaizhong Zhang, Richard Statman, Dennis E. 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]Richard Statman:
Freyd's Hierarchy of Combinator Monoids. LICS 1991: 186-190
1980 – 1989
- 1989
- [j19]Merrick L. Furst, Jonathan L. Gross, Richard Statman:
Genus distributions for two classes of graphs. J. Comb. Theory B 46(1): 22-36 (1989) - [j18]Richard Statman:
The Word Problem for Smullyan's Lark Combinator is Decidable. J. Symb. Comput. 7(2): 103-112 (1989) - [j17]Richard Statman:
On Sets of Solutions to Combinator Equations. Theor. Comput. Sci. 66(1): 99-104 (1989) - 1988
- [j16]Michael E. Saks, Rick Statman:
An intersection problem for finite automata. Discret. Appl. Math. 21(3): 245-255 (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
- [j15]Richard Statman:
Solving functional equations at higher types: some examples and some theorems. Notre Dame J. Formal Log. 27(1): 66-74 (1986) - [j14]Ana Pasztor, Richard Statman:
Scott Induction and Closure under omega-Sups. Theor. Comput. Sci. 43: 251-263 (1986) - [j13]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
- [j12]Richard Statman:
Logical Relations and the Typed lambda-Calculus. Inf. Control. 65(2/3): 85-97 (1985) - 1984
- [j11]Catriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman:
On the Structure of Armstrong Relations for Functional Dependencies. J. ACM 31(1): 30-46 (1984) - 1983
- [j10]Richard Statman:
λ-definable functionals andβη conversion. Arch. Math. Log. 23(1): 21-26 (1983) - 1982
- [j9]Harry R. Lewis, Richard Statman:
Unifiability is Complete for co-NLogSpace. Inf. Process. Lett. 15(5): 220-222 (1982) - [j8]Richard Statman:
Topological subgraphs of cubic graphs and a theorem of dirac. J. Graph Theory 6(4): 419-427 (1982) - [j7]Richard Statman:
Completeness, Invariance and lambda-Definability. J. Symb. Log. 47(1): 17-26 (1982) - 1981
- [j6]Richard Statman:
Reductions of the graph reconstruction conjecture. Discret. Math. 36(1): 103-107 (1981) - [j5]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
- [j4]Richard Statman:
Solution to a problem of Chang and Lee. Notre Dame J. Formal Log. 21(3): 518-520 (1980) - [j3]Richard Statman:
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation. SIAM J. Comput. 9(1): 104-110 (1980)
1970 – 1979
- 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]Richard Statman:
The Typed lambda-Calculus Is not Elementary Recursive. FOCS 1977: 90-94
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
