The following pages link to Davide Sangiorgi (Q342733):
Displaying 50 items.
- Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
- On the expressiveness and decidability of higher-order process calculi (Q627133) (← links)
- \(\pi\)-calculus, internal mobility, and agent-passing calculi (Q671684) (← links)
- Locality and interleaving semantics in calculi for mobile processes (Q672123) (← links)
- Bisimulation for higher-order process calculi (Q675066) (← links)
- Imperative objects as mobile processes (Q701046) (← links)
- Termination in higher-order concurrent calculi (Q710674) (← links)
- Towards an algebraic theory of typed mobile processes (Q817843) (← links)
- An efficient abstract machine for safe ambients (Q882488) (← links)
- An operational semantics for a calculus for wireless systems (Q964487) (← links)
- Some congruence properties for \(\pi\)-calculus bisimilarities (Q1129260) (← links)
- A fully abstract semantics for causality in the \(\pi\)-calculus (Q1130165) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- On bisimulations for the asynchronous \(\pi\)-calculus (Q1276246) (← links)
- (Q1323375) (redirect page) (← links)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata (Q1323376) (← links)
- The lazy lambda calculus in a concurrency scenario (Q1327395) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
- On the representation of McCarthy's \(amb\) in the \(\pi\)-calculus (Q1763728) (← links)
- A partition refinement algorithm for the \(\pi\)-calculus (Q1854406) (← links)
- Algebraic theories for name-passing calculi (Q1898459) (← links)
- A theory of bisimulation for the \(\pi\)-calculus (Q1901699) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- Eager functions as processes (Q2123050) (← links)
- Unique solutions of contractions, CCS, and their HOL formalisation (Q2216120) (← links)
- Bisimulation and coinduction enhancements: a historical perspective (Q2280213) (← links)
- Towards `up to context' reasoning about higher-order processes (Q2286742) (← links)
- Session types revisited (Q2407105) (← links)
- Ensuring termination by typability (Q2500473) (← links)
- Safe ambients: Abstract machine and distributed implementation (Q2581541) (← links)
- The \(\pi\)-calculus: A theory of mobile processes (Q2734510) (← links)
- The Proof Technique of Unique Solutions of Contractions (Q2787416) (← links)
- Equations, contractions, and unique solutions (Q2819828) (← links)
- Environmental bisimulations for probabilistic higher-order languages (Q2828300) (← links)
- Towards a calculus for wireless systems (Q2851331) (← links)
- Strong Normalisation in λ-Calculi with References (Q2894559) (← links)
- Duality and i/o-Types in the π-Calculus (Q2914377) (← links)
- Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract) (Q2942772) (← links)
- Symmetries and Dualities in Name-Passing Process Calculi (Q2944898) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- Introduction to Bisimulation and Coinduction (Q3118994) (← links)
- Mobile Processes and Termination (Q3184750) (← links)
- Trees from Functions as Processes (Q3190110) (← links)
- Bisimulations Up-to: Beyond First-Order Transition Systems (Q3190111) (← links)
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA (Q3348431) (← links)
- (Q3361899) (← links)
- (Q3384919) (← links)
- Termination in Higher-Order Concurrent Calculi (Q3400914) (← links)
- On Applicative Similarity, Sequentiality, and Full Abstraction (Q3449626) (← links)
