License: 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.2015.24
URN: urn:nbn:de:0030-drops-54053
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5405/
Mazza, Damiano
Simple Parsimonious Types and Logarithmic Space
Abstract
We present a functional characterization of deterministic logspace-computable predicates based on a variant (although not a subsystem) of propositional linear logic, which we call parsimonious logic. The resulting calculus is simply-typed and contains no primitive besides those provided by the underlying logical system, which makes it one of the simplest higher-order languages capturing logspace currently known. Completeness of the calculus uses the descriptive complexity characterization of logspace (we encode first-order logic with deterministic closure), whereas soundness is established by executing terms on a token machine (using the geometry of interaction).
BibTeX - Entry
@InProceedings{mazza:LIPIcs:2015:5405,
author = {Damiano Mazza},
title = {{Simple Parsimonious Types and Logarithmic Space}},
booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
pages = {24--40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-90-3},
ISSN = {1868-8969},
year = {2015},
volume = {41},
editor = {Stephan Kreutzer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5405},
URN = {urn:nbn:de:0030-drops-54053},
doi = {10.4230/LIPIcs.CSL.2015.24},
annote = {Keywords: implicit computational complexity, linear logic, geometry of interaction}
}
Keywords: |
|
implicit computational complexity, linear logic, geometry of interaction |
Collection: |
|
24th EACSL Annual Conference on Computer Science Logic (CSL 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
07.09.2015 |