Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2017.34
URN: urn:nbn:de:0030-drops-77035
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7703/
Pavaux, Alice
Inductive and Functional Types in Ludics
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{pavaux:LIPIcs:2017:7703,
author = {Alice Pavaux},
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 = {Valentin Goranko and Mads Dam},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7703},
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}
}
| Keywords: | Ludics, Inductive types, Fixed point, Linear logic, Game semantics | |
| Seminar: | 26th EACSL Annual Conference on Computer Science Logic (CSL 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 16.08.2017 |
