The following pages link to (Q5565113):
Displaying 50 items.
- Alpha equivalence equalities (Q428860) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- Krivine machines and higher-order schemes (Q476196) (← links)
- The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II. (Q505454) (← links)
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus (Q530864) (← links)
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- On sets of solutions to combinator equations (Q582274) (← links)
- Ternary relations and relevant semantics (Q598309) (← links)
- The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction (Q654911) (← links)
- Representing model theory in a type-theoretical logical framework (Q654913) (← links)
- A combinatory logic approach to higher-order E-unification (Q673971) (← links)
- Lambda abstraction algebras: representation theorems (Q674002) (← links)
- On abstract normalisation beyond neededness (Q683744) (← links)
- A direct proof of the confluence of combinatory strong reduction (Q732008) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- The discrimination theorem holds for combinatory weak reduction (Q755570) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Principal type schemes for an extended type theory (Q790801) (← links)
- Theory of symbolic expressions. I (Q791311) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Reduction graphs in the lambda calculus (Q792994) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- \(\lambda\)-definability of free algebras (Q803116) (← links)
- Systems of combinatory logic related to Quine's `New Foundations' (Q809994) (← links)
- The Girard-Reynolds isomorphism (second edition) (Q879366) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Constructive system for automatic program synthesis (Q912589) (← links)
- A characterization of lambda definable tree operations (Q918191) (← links)
- External and internal syntax of the \(\lambda \)-calculus (Q968531) (← links)
- A construction of one-point bases in extended lambda calculi (Q1029098) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- A characterization of F-complete type assignments (Q1089331) (← links)
- Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← links)
- One-step recurrent terms in \(\lambda\)-\(\beta\)-calculus (Q1104313) (← links)
- Substitution revisited (Q1106190) (← links)
- The calculus of constructions (Q1108266) (← links)
- Principal type scheme and unification for intersection type discipline (Q1110311) (← links)
- Conditional rewrite rules: Confluence and termination (Q1111368) (← links)
- BCK-combinators and linear \(\lambda\)-terms have types (Q1119620) (← links)
- On pseudo-c\(\beta\) normal form in combinatory logic (Q1120559) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- From types to sets (Q1140642) (← links)
- Invertible terms in the lambda calculus (Q1145689) (← links)
- An efficient interpreter for the lambda-calculus (Q1158139) (← links)
- The IO- and OI-hierarchies (Q1161273) (← links)
- Pre-recursive categories (Q1164127) (← links)
- On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
