Computational ludics

DOI10.1016/J.TCS.2010.12.026MaRDI QIDQ534713zbMATHOpenAlexFDO

Authors 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 theoryformal languagesludicsfinitely generated designsinfinite designsnormalization procedureterm syntax for designs

Mathematics Subject Classification ID

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

Recommendations

• Incarnation in ludics and maximal cliques of paths
• scientific article; zbMATH DE number 1948179
• First order in Ludics
• Ludics and natural language: first approaches
• scientific article; zbMATH DE number 1948178

Cites work

• scientific article; zbMATH DE number 5851814 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1948179 (Why is no real title available?)
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• scientific article; zbMATH DE number 1418967 (Why is no real title available?)
• Abstract Böhm trees
• Confluence of the coinductive \(\lambda\)-calculus
• Interactive observability in Ludics: the geometry of tests
• Locus solum: From the rules of logic to the logic of rules.
• Ludics is a Model for the Finitary Linear Pi-Calculus
• Ludics with repetitions (Exponentials, Interactive types and Completeness)
• On full abstraction for PCF: I, II and III
• On the meaning of logical completeness
• Polarized games
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory

Cited in

(20)

• Study of behaviours via visitable paths
• Jump from parallel to sequential proofs: exponentials
• From focalization of logic to the logic of focalization
• Harmony in the light of computational ludics
• Focalisation and Classical Realisability
• Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
• Game of grounds
• On the meaning of focalization
• Zeta functions and the (linear) logic of Markov processes
• Classical realizability in the CPS target language
• Ludics without designs. I: Triads
• Incarnation in ludics and maximal cliques of paths
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1948178 (Why is no real title available?)
• On the Meaning of Logical Completeness
• An interpretation of CCS into ludics
• Realizability models for a linear dependent PCF
• Infinitary affine proofs
• Ludics and Web: Another Reading of Standard Operations
• Inductive and functional types in ludics

This page was built for publication: Computational ludics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534713)