The following pages link to (Q4842980):
Displaying 31 items.
- A semantic account of strong normalization in linear logic (Q276260) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- A semantic measure of the execution time in linear logic (Q534698) (← links)
- Light logics and optimal reduction: completeness and complexity (Q627123) (← links)
- Interaction graphs: multiplicatives (Q714715) (← links)
- Interactive observability in Ludics: the geometry of tests (Q817844) (← links)
- A categorical model for the geometry of interaction (Q817846) (← links)
- Weak typed Böhm theorem on IMLL (Q866556) (← links)
- Interaction graphs: additives (Q892169) (← links)
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Interaction combinators (Q1368381) (← links)
- Additives of linear logic and normalization. I: A (restricted) Church-Rosser property. (Q1398477) (← links)
- Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
- Polarized proof-nets and \(\lambda \mu\)-calculus (Q1853586) (← links)
- The additive multiboxes (Q1861326) (← links)
- An abstract approach to stratification in linear logic (Q2343125) (← links)
- Conformal Field Theory as a Nuclear Functor (Q2864148) (← links)
- Handshake Games (Q2864210) (← links)
- Observational Equivalence for the Interaction Combinators and Internal Separation (Q2867902) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- (Q4222847) (← links)
- Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: <i>a minimalist approach</i> (Q4637628) (← links)
- On intuitionistic proof nets with additional rewrite rules and their approximations (Q4916174) (← links)
- On the Functor ℓ2 (Q4922076) (← links)
- A <tt>MALL</tt> geometry of interaction based on indexed linear logic (Q5006458) (← links)
- (Q5015215) (← links)
- (Q5094132) (← links)
- Abstract machines, optimal reduction, and streams (Q5108536) (← links)
- Proofs as Polynomials (Q5415631) (← links)
- An Explicit Framework for Interaction Nets (Q5902126) (← links)
