Pages that link to "Item:Q2387197"
From MaRDI portal
The following pages link to Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197):
Displaying 15 items.
- An exact correspondence between a typed pi-calculus and polarised proof-nets (Q974114) (← links)
- Comparing communication primitives via their relative expressive power (Q1004386) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- Towards a unified approach to encodability and separation results for process calculi (Q1959439) (← links)
- Expressiveness of concurrent intensionality (Q2193283) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- (Q2766797) (← links)
- Sequence types for the \(\pi\)-calculus (Q2851089) (← links)
- Polymorphic Abstract Syntax via Grothendieck Construction (Q3000622) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- A calculus with polymorphic and polyvariant flow types (Q4542147) (← links)
- A Translation of Beta-binders in a Prioritized Pi-calculus (Q5404078) (← links)
- Foundations of Software Science and Computational Structures (Q5705882) (← links)
- Automata, Languages and Programming (Q5716865) (← links)
- Full abstraction for expressiveness: history, myths and facts (Q5741573) (← links)