@inproceedings{c5c3a385e35b4203aaba956c4e1e0e5e,
title = "Separating functional computation from relations",
abstract = "The logical foundation of arithmetic generally starts with a quantificational logic over relations. Of course, one often wishes to have a formal treatment of functions within this setting. Both Hilbert and Church added choice operators (such as the epsilon operator) to logic in order to coerce relations that happen to encode functions into actual functions. Others have extended the term language with confluent term rewriting in order to encode functional computation as rewriting to a normal form. We take a different approach that does not extend the underlying logic with either choice principles or with an equality theory. Instead, we use the familiar twophase construction of focused proofs and capture functional computation entirely within one of these phases. As a result, our logic remains purely relational even when it is computing functions.",
keywords = "Computation and deduction, Fixed points, Focused proof systems",
author = "Ulysse G{\'e}rard and Dale Miller",
note = "Publisher Copyright: {\textcopyright} Ulysse G{\'e}rard and Dale Miller.; 26th Annual EACSL Conference on Computer Science Logic, CSL 2017 ; Conference date: 20-08-2017 Through 24-08-2017",
year = "2017",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.CSL.2017.23",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Valentin Goranko and Mads Dam",
booktitle = "Computer Science Logic 2017, CSL 2017",
}