The following pages link to (Q3661543):
Displaying 18 items.
- Lambda abstraction algebras: representation theorems (Q674002) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Weak completeness of type assignment in \(\lambda\)-calculus models: A generalization of Hindley's result (Q809993) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- A characterization of F-complete type assignments (Q1089331) (← 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)
- Algebras and combinators (Q1162534) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- A finite equational axiomatization of the functional algebras for the lambda calculus (Q1283777) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Univalence as a principle of logic (Q1788330) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Towards Lambda Calculus Order-Incompleteness (Q4916175) (← links)
- (Q4991956) (← links)
