Richard Statman

Affiliations:
  • Carnegie Mellon University, Pittsburgh, USA


According to our database1, Richard Statman authored at least 66 papers between 1979 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021
Uniqueness typing for intersection types.
CoRR, 2021

Church's Semigroup Is Sq-Universal.
Proceedings of the 6th International Conference on Formal Structures for Computation and Deduction, 2021

2020
Products in a Category with Only One Object.
Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, 2020

2019
Simple SubTypes of Intersection Types.
Fundam. Informaticae, 2019

2018
On sets of terms with a given intersection type.
CoRR, 2018

2017
Taming the wild ant-lion; a counterexample to a conjecture of Böhm.
Math. Struct. Comput. Sci., 2017

Lambda theories allowing terms with a finite number of fixed points.
Math. Struct. Comput. Sci., 2017

2016
How to Think of Intersection Types as Cartesian Products.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

On the Representation of Semigroups and Other Congruences in the Lambda Calculus.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

The Completeness of BCD for an Operational Semantics.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Levy Labels and Recursive Types.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2014
On polymorphic types of untyped terms.
J. Comput. Syst. Sci., 2014

A Finite Model Property for Intersection Types.
Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

Near Semi-rings and Lambda Calculus.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
A New Type Assignment for Strongly Normalizable Terms.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

Lambda Calculus with Types.
Perspectives in logic, Cambridge University Press, ISBN: 978-0-521-76614-2, 2013

2011
Solution to the Range Problem for Combinatory Logic.
Fundam. Informaticae, 2011

2010
Cartesian Monoids.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

2009
The Omega Rule is Π<sub>1</sub><sup>1</sup>-Complete in the λβ-Calculus
Log. Methods Comput. Sci., 2009

2007
On the complexity of alpha conversion.
J. Symb. Log., 2007

The Omega Rule is P<sub>1</sub><sup>1</sup>-Complete in the <i>lambdabeta</i> -Calculus.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2006
Solution of a Problem of Barendregt on Sensible lambda-Theories.
Log. Methods Comput. Sci., 2006

2005
Some results on extensionality in lambda calculus.
Ann. Pure Appl. Log., 2005

Two Variables Are Not Enough.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

Böhm's Theorem, Church's Delta, Numeral Systems, and Ershov Morphisms.
Proceedings of the Processes, 2005

2004
On the lambda<i>Y</i> calculus.
Ann. Pure Appl. Log., 2004

The Omega Rule is II_2^0-Hard in the lambda beta -Calculus.
Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004

2002
On The Lambda Y Calculus.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Marginalia to a Theorem of Jacopini.
Fundam. Informaticae, 2001

2000
On the Word Problem for Combinators.
Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Church's Lambda Delta Calculus.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
On the existence of n but not n + 1 easy combinators.
Math. Struct. Comput. Sci., 1999

Applications of Plotkin-Terms: Partitions and Morphisms for Closed Terms.
J. Funct. Program., 1999

Consequences of Jacopini's Theorem: Consistent Equalities and Equations.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

1998
Morphisms and Partitions of V-sets.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
On the Unification Problem for Cartesian Closed Categories.
J. Symb. Log., 1997

Effective Reduction and Conversion Strategies for Combinators.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

1993
Some Examples of Non-Existent Combinators.
Theor. Comput. Sci., 1993

1992
On the Editing Distance Between Unordered Labeled Trees.
Inf. Process. Lett., 1992

Retracts in simply typed lambda-beta-eta-calculus
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991
Freyd's Hierarchy of Combinator Monoids
Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS '91), 1991

1989
On Sets of Solutions to Combinator Equations.
Theor. Comput. Sci., 1989

The Word Problem for Smullyan's Lark Combinator is Decidable.
J. Symb. Comput., 1989

Genus distributions for two classes of graphs.
J. Comb. Theory, Ser. B, 1989

1988
An intersection problem for finite automata.
Discret. Appl. Math., 1988

Inductive Inference: An Abstract Approach.
Proceedings of the First Annual Workshop on Computational Learning Theory, 1988

1987
Empty Types in Polymorphic Lambda Calculus.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

1986
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms.
Theor. Comput. Sci., 1986

Scott Induction and Closure under omega-Sups.
Theor. Comput. Sci., 1986

Solving functional equations at higher types: some examples and some theorems.
Notre Dame J. Formal Log., 1986

On Translating Lambda Terms into Combinators; The Basis Problem
Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

1985
Logical Relations and the Typed lambda-Calculus
Inf. Control., 1985

1984
On the Structure of Armstrong Relations for Functional Dependencies.
J. ACM, 1984

1983
<i>λ</i>-definable functionals and<i>βη</i> conversion.
Arch. Math. Log., 1983

1982
Completeness, Invariance and lambda-Definability.
J. Symb. Log., 1982

Topological subgraphs of cubic graphs and a theorem of dirac.
J. Graph Theory, 1982

Unifiability is Complete for co-NLogSpace.
Inf. Process. Lett., 1982

1981
On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems.
Theor. Comput. Sci., 1981

Reductions of the graph reconstruction conjecture.
Discret. Math., 1981

Number Theoretic Functions Computable by Polymorphic Programs (Extended Abstract)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation.
SIAM J. Comput., 1980

Solution to a problem of Chang and Lee.
Notre Dame J. Formal Log., 1980

1979
The Typed lambda-Calculus is not Elementary Recursive.
Theor. Comput. Sci., 1979

Intuitionistic Propositional Logic is Polynomial-Space Complete.
Theor. Comput. Sci., 1979

On Properties Preserved by Contraction of Concurrent Systems.
Proceedings of the Semantics of Concurrent Computation, 1979


  Loading...