The following pages link to (Q4101795):
Displayed 14 items.
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Expressive power of typed and type-free programming languages (Q761790) (← links)
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- Descendants and origins in term rewriting. (Q1854348) (← links)
- Games characterizing Levy-Longo trees (Q1884875) (← links)
- Eager functions as processes (Q2123050) (← links)
- A Light Modality for Recursion (Q2988388) (← links)
- From Böhm's Theorem to Observational Equivalences (Q4916172) (← links)
- (Q5109521) (← links)
- Parallel reductions in \(\lambda\)-calculus (Q5903814) (← links)
- Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications (Q6178717) (← links)