Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their structure following a game semantics approach. Inductive types are interpreted as least fixed points, and we prove an internal completeness result giving an explicit construction for such fixed points. The interactive properties of the ludics interpretation of inductive and functional types are then studied. In particular, we identify which higher-order functions types fail to satisfy type safety, and we give a computational explanation.
@InProceedings{pavaux:LIPIcs.CSL.2017.34, author = {Pavaux, Alice}, title = {{Inductive and Functional Types in Ludics}}, booktitle = {26th EACSL Annual Conference on Computer Science Logic (CSL 2017)}, pages = {34:1--34:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-045-3}, ISSN = {1868-8969}, year = {2017}, volume = {82}, editor = {Goranko, Valentin and Dam, Mads}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2017.34}, URN = {urn:nbn:de:0030-drops-77035}, doi = {10.4230/LIPIcs.CSL.2017.34}, annote = {Keywords: Ludics, Inductive types, Fixed point, Linear logic, Game semantics} }
Feedback for Dagstuhl Publishing