2009 · 41 citations · 19 references
ComputingComputer ScienceMathematicsFormal MethodsGame TheoryPhilosophy Of LanguageFormal SemanticsInteractive Proof SystemsType SystemsAbstract SemanticsCompletenessCompleteness ConditionsGame-theoretic SemanticsLogical CompletenessLogical ProofMetatheory Of Proof Systems
We prove that is possible to extend Girard's Ludics so as to have repetitions (hence exponentials), and still have the results on semantical types which characterize Ludics in the panorama of Game Semantics. The results are obtained by using less structure than in the original paper; this has an interest on its own, and we hope that it will open the way to applying the approach of Ludics to a larger domain.
19
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
On Full Abstraction for PCF: I, II, and III
J. M. E. Hyland, C.-H. Luke Ong · Information and Computation · 2000 · 646 citations · Full text