Separating Functional Computation from Relations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Separating Functional Computation from Relations

Résumé

The logical foundations of arithmetic generally start with a quantificational logic of relations. Of course, one often wishes to have a formal treatment of functions within this setting. Both Hilbert and Church added to logic choice operators (such as the epsilon operator) 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 two-phase 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
Fichier principal
Vignette du fichier
CSL_2017_paper_66.pdf (456.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01615683 , version 1 (12-10-2017)

Identifiants

  • HAL Id : hal-01615683 , version 1

Citer

Ulysse Gérard, Dale Miller. Separating Functional Computation from Relations. 26th EACSL Annual Conference on Computer Science Logic (CSL 2017), Aug 2017, Stockholm, Sweden. pp.23:1--23:17. ⟨hal-01615683⟩
198 Consultations
67 Téléchargements

Partager

Gmail Facebook X LinkedIn More