The following pages link to (Q4490717):
Displaying 20 items.
- A synthetic theory of sequential domains (Q424548) (← links)
- A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
- Interaction graphs: multiplicatives (Q714715) (← links)
- A general adequacy result for a linear functional language (Q1391860) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- A fully abstract model for the \(\pi\)-calculus. (Q1400720) (← links)
- Parallel and serial hypercoherences (Q1583243) (← links)
- Stratified coherence spaces: A denotational semantics for light linear logic (Q1827389) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- A specification structure for deadlock-freedom of synchronous processes (Q1960536) (← links)
- Game semantics for constructive modal logic (Q2142094) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- A structural approach to reversible computation (Q2581367) (← links)
- Abstract Interpretation for Proving Secrecy Properties in Security Protocols (Q2841216) (← links)
- Concrete Process Categories (Q2841311) (← links)
- Non-Uniform Hypercoherences (Q2842815) (← links)
