Computational ludics

DOI10.1016/J.TCS.2010.12.026zbMath1222.03032OpenAlexW2911816136MaRDI QIDQ534713

Kazushige Terui

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.026

zbMATH Keywords

automata theorynormalization procedureformal languagesludicsfinitely generated designsinfinite designsterm syntax for designs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70)

Related Items (12)

From Focalization of Logic to the Logic of Focalization ⋮ Jump from parallel to sequential proofs: exponentials ⋮ Unnamed Item ⋮ Classical realizability in the CPS target language ⋮ On the Meaning of Focalization ⋮ On the Meaning of Logical Completeness ⋮ Focalisation and Classical Realisability ⋮ Game of grounds ⋮ An interpretation of CCS into ludics ⋮ Realizability models for a linear dependent PCF ⋮ Unnamed Item ⋮ Infinitary affine proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive observability in Ludics: the geometry of tests
• On full abstraction for PCF: I, II and III
• Confluence of the coinductive \(\lambda\)-calculus
• Polarized games
• Locus Solum: From the rules of logic to the logic of rules
• Ludics with repetitions (Exponentials, Interactive types and Completeness)
• On the meaning of logical completeness
• Ludics is a Model for the Finitary Linear Pi-Calculus
• Abstract Böhm trees
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

This page was built for publication: Computational ludics