Computational ludics

DOI10.1016/J.TCS.2010.12.026zbMATH Open1222.03032OpenAlexW2911816136MaRDI QIDQ534713FDOQ534713

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

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

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)

Cites Work

• On full abstraction for PCF: I, II and III
• Locus solum: From the rules of logic to the logic of rules.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Typed lambda-calculus in classical Zermelo-Fraenkel set theory
• Polarized games
• 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
• Title not available (Why is that?)
• Confluence of the coinductive \(\lambda\)-calculus
• Title not available (Why is that?)
• Interactive observability in Ludics: the geometry of tests

Cited In (18)

• Title not available (Why is that?)
• On the meaning of focalization
• An interpretation of CCS into ludics
• Jump from parallel to sequential proofs: exponentials
• Ludics and Web: Another Reading of Standard Operations
• Classical realizability in the CPS target language
• Realizability models for a linear dependent PCF
• On the Meaning of Logical Completeness
• Infinitary affine proofs
• Zeta functions and the (linear) logic of Markov processes
• Automata, Languages and Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
• Focalisation and Classical Realisability
• From Focalization of Logic to the Logic of Focalization
• Harmony in the light of computational ludics
• Game of grounds

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)