The following pages link to (Q4722037):
Displayed 50 items.
- Nominal lambda calculus: an internal language for FM-Cartesian closed categories (Q265798) (← links)
- A process calculus with finitary comprehended terms (Q385508) (← links)
- Alpha equivalence equalities (Q428860) (← links)
- A logical analysis of the Anselm's \textit{Unum argumentum} (from \textit{Proslogion}) (Q523297) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Intersection type assignment systems with higher-order algebraic rewriting (Q672048) (← links)
- Two beta-equal lambda-I-terms with no types in common (Q672135) (← links)
- Most general first order theorems are not recursively enumerable (Q672461) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Linear logic, coherence and dinaturality (Q685406) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Semantics of the typed \(\lambda\)-calculus with substitution in a cartesian closed category (Q687575) (← links)
- Partial inductive definitions as type-systems for \(\lambda\)-terms (Q688729) (← links)
- Definition and basic properties of the Deva meta-calculus (Q688825) (← links)
- A proof-theoretic characterization of the basic feasible functionals (Q706620) (← links)
- A direct proof of the confluence of combinatory strong reduction (Q732008) (← links)
- Type inference with recursive types: Syntax and semantics (Q756435) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- Types of I-free hereditary right maximal terms (Q812102) (← links)
- Admissibility of cut in LC with fixed point combinator (Q817697) (← links)
- A functional computation model for the duality of two-variable lambda-Boolean functions (Q861192) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- A logic of abstraction related to finite constructive number classes (Q910401) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL (Q918956) (← links)
- Abstract deduction and inferential models for type theory (Q988551) (← links)
- BCK-combinators and linear \(\lambda\)-terms have types (Q1119620) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- On pseudo-c\(\beta\) normal form in combinatory logic (Q1120559) (← links)
- On a conjecture of Bergstra and Tucker (Q1124321) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- Combinatory weak reduction in lambda calculus (Q1129266) (← links)
- Subtyping can have a simple semantics (Q1177151) (← links)
- Implementing the `Fool's model' of combinatory logic (Q1181718) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Decision problems for propositional linear logic (Q1192352) (← links)
- The converse principal type-scheme theorem in lambda calculus (Q1194107) (← links)
- A simple proof of a theorem of Statman (Q1199546) (← links)
- Intersection types for combinatory logic (Q1199823) (← links)
- Coquand's calculus of constructions: A mathematical foundation for a proof development system (Q1201296) (← links)
- Types with intersection: An introduction (Q1201298) (← links)
- Unification under a mixed prefix (Q1201348) (← links)
- Principal types of BCK-lambda-terms (Q1208417) (← links)
- How to decide the lark (Q1208736) (← links)
- Abstraction problems in combinatory logic: A compositive approach (Q1262300) (← links)
- Infiniteness of \(\text{proof}(\alpha)\) is polynomial-space complete (Q1274981) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- On functions preserving levels of approximation: A refined model construction for various lambda calculi (Q1275633) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Implementing tactics and tacticals in a higher-order logic programming language (Q1311396) (← links)