The following pages link to Claudia Faggian (Q418200):
Displaying 30 items.
- An approach to innocent strategies as graphs (Q418201) (← links)
- Interactive observability in Ludics: the geometry of tests (Q817844) (← links)
- Proof nets sequentialisation in multiplicative linear logic (Q952490) (← links)
- From basic logic to quantum logics with cut-elimination (Q1264370) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- A Graph Abstract Machine Describing Event Structure Composition (Q2867884) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- Ludics is a Model for the Finitary Linear Pi-Calculus (Q3612628) (← links)
- Jump from Parallel to Sequential Proofs: Multiplicatives (Q3613346) (← links)
- Partial Orders, Event Structures and Linear Strategies (Q3637188) (← links)
- (Q4218933) (← links)
- (Q4411839) (← links)
- (Q4411840) (← links)
- Basic logic: reflection, symmetry, visibility (Q4527908) (← links)
- The geometry of synchronization (Q4635620) (← links)
- Parallelism and Synchronization in an Infinitary Context (Q4635836) (← links)
- (Q4650582) (← links)
- (Q4986180) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- The geometry of parallelism: classical, probabilistic, and quantum effects (Q5370917) (← links)
- Computer Science Logic (Q5394576) (← links)
- Measurements in Proof Nets as Higher-Order Quantum Circuits (Q5410710) (← links)
- Automata, Languages and Programming (Q5466489) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Factorization and normalization, essentially (Q6536313) (← links)
- Strategies for asymptotic normalization (Q6544112) (← links)
- Asymptotic rewriting (invited talk) (Q6610597) (← links)
- The sum-product algorithm for quantitative multiplicative linear logic (Q6622044) (← links)
- Lambda calculus and probabilistic computation (Q6654500) (← links)
