The following pages link to Richard Statman (Q754194):
Displayed 50 items.
- Item:Q754194 (redirect page) (← links)
- On sets of solutions to combinator equations (Q582274) (← links)
- Solution to a problem of Chang and Lee (Q754195) (← links)
- Scott induction and closure under \(\omega\)-sups (Q1087326) (← links)
- Solving functional equations at higher types; some examples and some theorems (Q1091380) (← links)
- Every countable poset is embeddable in the poset of unsolvable terms (Q1098834) (← links)
- The word problem for Smullyan's lark combinator is decidable (Q1114668) (← links)
- An intersection problem for finite automata (Q1118410) (← links)
- Genus distributions for two classes of graphs (Q1118607) (← links)
- Reductions of the graph reconstruction conjecture (Q1157346) (← links)
- Item:Q754194 (redirect page) (← links)
- On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619) (← links)
- Unifiability is complete for co-N Log Space (Q1173403) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
- The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
- Some examples of non-existent combinators (Q1314364) (← links)
- Fixed points in lambda calculus. an eccentric survey of problems and solutions (Q1688969) (← links)
- The completeness of BCD for an operational semantics (Q1709713) (← links)
- On the representation of semigroups and other congruences in the lambda calculus (Q1744394) (← links)
- How to think of intersection types as Cartesian products (Q1744395) (← links)
- Some results on extensionality in lambda calculus (Q1765154) (← links)
- On the \(\lambda Y\) calculus (Q1886326) (← links)
- Finite generation and presentation problems for lambda calculus and combinatory logic (Q2151418) (← links)
- On polymorphic types of untyped terms (Q2453585) (← links)
- (Q2708320) (← links)
- (Q2723901) (← links)
- (Q2767026) (← links)
- (Q2882383) (← links)
- (Q2958549) (← links)
- Lambda theories allowing terms with a finite number of fixed points (Q2973253) (← links)
- On Polymorphic Types of Untyped Terms (Q3003364) (← links)
- (Q3048829) (← links)
- (Q3077958) (← links)
- Cartesian Monoids (Q3178269) (← links)
- (Q3312273) (← links)
- λ-definable functionals andβη conversion (Q3322071) (← links)
- Reflections on a Theorem of Henkin (Q3454814) (← links)
- (Q3487318) (← links)
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus (Q3612630) (← links)
- The Omega Rule is $\mathbf{\Pi_{1}^{1}}$-Complete in the $\lambda\beta$-Calculus (Q3636805) (← links)
- Logical relations and the typed λ-calculus (Q3724297) (← links)
- On the Structure of Armstrong Relations for Functional Dependencies (Q3766891) (← links)
- (Q3795665) (← links)
- (Q3882451) (← links)
- Speed-Up by Theories with Infinite Models (Q3922672) (← links)
- Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation (Q3944041) (← links)
- Completeness, invariance and <i>λ</i>-definability (Q3947643) (← links)
- Topological subgraphs of cubic graphs and a theorem of dirac (Q3968950) (← links)
- (Q4010370) (← links)