Pages that link to "Item:Q2576663"
From MaRDI portal
The following pages link to Genericity and the \(\pi\)-calculus (Q2576663):
Displaying 16 items.
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- Analysing input/output-capabilities of mobile processes with a generic type system (Q1772312) (← links)
- A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- Processes and games (Q2851048) (← links)
- Sequence types for the \(\pi\)-calculus (Q2851089) (← links)
- Propositions as sessions (Q2875234) (← links)
- Full Abstraction in a Subtyped pi-Calculus with Linear Types (Q3090836) (← links)
- Every 1-generic computes a properly 1-generic (Q3416120) (← links)
- Invisible genericity and 0<sup>#</sup> (Q4254683) (← links)
- (Q4417854) (← links)
- (Q4511302) (← links)
- Trees from Functions as Processes (Q4585071) (← links)
- Type-Based Security for Mobile Computing Integrity, Secrecy and Liveness (Q5262979) (← links)
- Foundations of Software Science and Computational Structures (Q5705882) (← links)