Pages that link to "Item:Q1623116"
From MaRDI portal
The following pages link to Proof nets and the linear substitution calculus (Q1623116):
Displaying 19 items.
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- Proof nets and the call-by-value \(\lambda\)-calculus (Q897928) (← links)
- Head linear reduction and pure proof net extraction (Q1342250) (← links)
- Coherence for sharing proof-nets (Q1398472) (← links)
- The spirit of node replication (Q2233421) (← links)
- Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic (Q3498480) (← links)
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (Q3586061) (← links)
- From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing (Q3612618) (← links)
- (Q4993336) (← links)
- (Q5021229) (← links)
- Coherence for sharing proof nets (Q5055862) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- (Q5416219) (← links)
- (Q5854675) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- A strong bisimulation for a classical term calculus (Q6563051) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
