The following pages link to (Q3221960):
Displayed 26 items.
- Realizability models and implicit complexity (Q534712) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation (Q651316) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- Inter-deriving semantic artifacts for object-oriented programming (Q980939) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- Fixed points in lambda calculus. an eccentric survey of problems and solutions (Q1688969) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Statistical properties of lambda terms (Q2327214) (← links)
- The differential \(\lambda \mu\)-calculus (Q2373711) (← links)
- Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
- The Simple Type Theory of Normalisation by Evaluation (Q2841227) (← links)
- (Q3300796) (← links)
- (Q4603450) (← links)
- (Q4625694) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- Dynamic game semantics (Q4988428) (← links)
- Categories with Families: Unityped, Simply Typed, and Dependently Typed (Q5014596) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- (Q5028447) (← links)
- (Q5089030) (← links)
- Non-speculative and upward invocation of continuations in a parallel language (Q5096761) (← links)
- (Q5109521) (← links)
- (Q5111304) (← links)
- Cut Elimination, Substitution and Normalisation (Q5213610) (← links)