Pages that link to "Item:Q1327395"
From MaRDI portal
The following pages link to The lazy lambda calculus in a concurrency scenario (Q1327395):
Displaying 19 items.
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Fair ambients (Q877172) (← links)
- Theory of interaction (Q896903) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- On the semantics of the call-by-name CPS transform (Q1575687) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Decoding choice encodings (Q1854385) (← links)
- Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) (← links)
- Variations on mobile processes (Q1960530) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
- A two-level logic approach to reasoning about computations (Q2392484) (← links)
- FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS (Q2856009) (← links)
- The λ-calculus in the π-calculus (Q3094164) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures (Q5262945) (← links)
- From Applicative to Environmental Bisimulation (Q5739359) (← links)
