The following pages link to Computational ludics (Q534713):
Displaying 15 items.
- Classical realizability in the CPS target language (Q1744381) (← links)
- Game of grounds (Q2080589) (← links)
- An interpretation of CCS into ludics (Q2333316) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- On the Meaning of Focalization (Q3080087) (← links)
- From Focalization of Logic to the Logic of Focalization (Q3178251) (← links)
- On the Meaning of Logical Completeness (Q3637186) (← links)
- Focalisation and Classical Realisability (Q3644763) (← links)
- Jump from parallel to sequential proofs: exponentials (Q4577985) (← links)
- (Q4643962) (← links)
- (Q5015213) (← links)
- Infinitary affine proofs (Q5268998) (← links)
- Zeta functions and the (linear) logic of Markov processes (Q6597969) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)
- Harmony in the light of computational ludics (Q6657788) (← links)
