Richard Statman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2022

On sets of terms having a given intersection typeAndrew Polonsky, Richard Statman. lmcs, 18(3), 2022. [doi]

2017

Lambda theories allowing terms with a finite number of fixed pointsBenedetto Intrigila, Richard Statman. mscs, 27(3):405-427, 2017. [doi]

2016

The Completeness of BCD for an Operational SemanticsRichard Statman. TYPES 2018: [doi]

2013

Lambda Calculus with TypesHendrik Pieter Barendregt, Wil Dekkers, Richard Statman. Perspectives in logic, Cambridge University Press, 2013. [doi]

2011

Solution to the Range Problem for Combinatory LogicBenedetto Intrigila, Richard Statman. FUIN, 111(2):203-222, 2011. [doi]

2007

The Omega Rule is P::1:::::1:::-Complete in the ::::lambdabeta:::: -CalculusBenedetto Intrigila, Richard Statman. tlca 2007: 178-193 [doi]

2006

Solution of a Problem of Barendregt on Sensible lambda-TheoriesBenedetto Intrigila, Richard Statman. lmcs, 2(4), 2006. [doi]

2005

Some results on extensionality in lambda calculusBenedetto Intrigila, Richard Statman. APAL, 132(2-3):109-125, 2005. [doi]

Böhm s Theorem, Church s Delta, Numeral Systems, and Ershov MorphismsRichard Statman, Henk Barendregt. BIRTHDAY 2005: 40-54 [doi]

Two Variables Are Not EnoughRichard Statman. ictcs 2005: 406-409 [doi]

2004

The Omega Rule is II_2^0-Hard in the lambda beta -CalculusBenedetto Intrigila, Richard Statman. lics 2004: 202-210 [doi]

On the lambda::::Y:::: calculusRichard Statman. APAL, 130(1-3):325-337, 2004. [doi]

2002

On The Lambda Y CalculusRichard Statman. lics 2002: 159-166 [doi]

2001

Marginalia to a Theorem of JacopiniRichard Statman. FUIN, 45(1-2):117-121, 2001.

2000

On the Word Problem for CombinatorsRichard Statman. RTA 2000: 203-213

Church s Lambda Delta CalculusRichard Statman. lpar 2000: 293-307 [doi]

1999

Applications of Plotkin-Terms: Partitions and Morphisms for Closed TermsRichard Statman, Henk Barendregt. JFP, 9(5):565-575, 1999.

Consequences of Jacopini s Theorem: Consistent Equalities and EquationsRichard Statman. tlca 1999: 355-364 [doi]

On the existence of n but not n + 1 easy combinatorsRichard Statman. mscs, 9(4):361-365, 1999.

1998

Morphisms and Partitions of V-setsRichard Statman. csl 1999: 313-322

1997

On the Unification Problem for Cartesian Closed CategoriesPaliath Narendran, Frank Pfenning, Richard Statman. JSYML, 62(2):636-647, 1997.

Effective Reduction and Conversion Strategies for CombinatorsRichard Statman. RTA 1997: 299-307

1996

On Cartesian MonoidsRichard Statman. csl 1997: 446-459

1993

On the Unification Problem for Cartesian Closed CategoriesPaliath Narendran, Frank Pfenning, Richard Statman. lics 1993: 57-63

Some Examples of Non-Existent CombinatorsRichard Statman. TCS, 121(1&2):441-448, 1993.

1992

Retracts in simply typed lambda-beta-eta-calculusUgo de Liguoro, Adolfo Piperno, Richard Statman. lics 1992: 461-469

On the Editing Distance Between Unordered Labeled TreesKaizhong Zhang, Richard Statman, Dennis Shasha. ipl, 42(3):133-139, 1992.

1991

Freyd s Hierarchy of Combinator MonoidsRichard Statman. lics 1991: 186-190

1989

Genus distributions for two classes of graphsMerrick L. Furst, Jonathan L. Gross, Richard Statman. JCT, 46(1):22-36, 1989. [doi]

The Word Problem for Smullyan s Lark Combinator is DecidableRichard Statman. JSC, 7(2):103-112, 1989.

On Sets of Solutions to Combinator EquationsRichard Statman. TCS, 66(1):99-104, 1989.

1988

Inductive Inference: An Abstract ApproachJohn C. Cherniavsky, Mahendran Velauthapillai, Richard Statman. colt 1988: 251-266 [doi]

1987

Empty Types in Polymorphic Lambda CalculusAlbert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman. POPL 1987: 253-262

1986

Scott Induction and Closure under omega-SupsAna Pasztor, Richard Statman. TCS, 43:251-263, 1986.

On Translating Lambda Terms into Combinators; The Basis ProblemRichard Statman. lics 1986: 378-382

Every Countable Poset is Embeddable in the Poset of Unsolvable TermsRichard Statman. TCS, 48(3):95-100, 1986.

Solving functional equations at higher types: some examples and some theoremsRichard Statman. ndjfl, 27(1):66-74, 1986. [doi]

1985

Logical Relations and the Typed lambda-CalculusRichard Statman. iandc, 65(2/3):85-97, May/June 1985.

1984

On the Structure of Armstrong Relations for Functional DependenciesCatriel Beeri, Martin Dowd, Ronald Fagin, Richard Statman. JACM, 31(1):30-46, 1984. [doi]

1982

Unifiability is Complete for co-NLogSpaceHarry R. Lewis, Richard Statman. ipl, 15(5):220-222, 1982.

Completeness, Invariance and lambda-DefinabilityRichard Statman. JSYML, 47(1):17-26, 1982.

Topological subgraphs of cubic graphs and a theorem of diracRichard Statman. jgt, 6(4):419-427, 1982. [doi]

1981

Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract)Richard Statman. focs 1981: 279-282

On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification ProblemsRichard Statman. TCS, 15:329-338, 1981.

1980

Worst Case Exponential Lower Bounds for Input Resolution with ParamodulationRichard Statman. SICOMP, 9(1):104-110, 1980.

Solution to a problem of Chang and LeeRichard Statman. ndjfl, 21(3):518-520, 1980. [doi]

1979

On Properties Preserved by Contraction of Concurrent SystemsJohn S. Gourlay, William C. Rounds, Richard Statman. scc 1979: 51-65

The Typed lambda-Calculus is not Elementary RecursiveRichard Statman. TCS, 9:73-81, 1979.

Intuitionistic Propositional Logic is Polynomial-Space CompleteRichard Statman. TCS, 9:67-72, 1979.

1977

The Typed lambda-Calculus Is not Elementary RecursiveRichard Statman. focs 1977: 90-94

Sign in or sign up to see more results.

runs on WebDSL