Revisiting the duality of computation: an algebraic analysis of classical realizability models

Étienne Miquey

doi:10.4230/LIPIcs.CSL.2020.30

Conference Papers Year : 2020

Revisiting the duality of computation: an algebraic analysis of classical realizability models

(1, 2)

1
2

Étienne Miquey

Function : Author
PersonId : 6597
IdHAL : emiquey
ORCID : 0000-0002-5987-6547

Gallinette : vers une nouvelle génération d'assistant à la preuve

Laboratoire des Sciences du Numérique de Nantes

Keywords

Theory of computation → Proof theory Theory of computation → Type theory Keywords and phrases realizability model theory forcing proofs-as-programs λ-calculus classical logic lattices tripos call-by-name duality call-by-value 2012 ACM Subject Classification Theory of computation → Logic

Domains

Logic in Computer Science [cs.LO]

Fichier principal

main.pdf (764.06 Ko)

Origin : Files produced by the author(s)

Étienne Miquey : Connect in order to contact the contributor

https://hal.science/hal-02305560

Submitted on : Monday, January 13, 2020-10:18:01 AM

Last modification on : Friday, March 24, 2023-2:53:14 PM

Dates and versions

hal-02305560 , version 1 (04-10-2019)

hal-02305560 , version 2 (13-01-2020)

Identifiers

HAL Id : hal-02305560 , version 2
ARXIV : 1910.02732
DOI : 10.4230/LIPIcs.CSL.2020.30

Cite

Étienne Miquey. Revisiting the duality of computation: an algebraic analysis of classical realizability models. CSL 2020 - Conference on Computer Science Logic, Jan 2020, Barcelone, Spain. pp.1-52, ⟨10.4230/LIPIcs.CSL.2020.30⟩. ⟨hal-02305560v2⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-NANTES INSTITUT-TELECOM CNRS INRIA EC-NANTES UNAM INRIA2 LS2N LS2N-GALLINETTE NANTES-UNIVERSITE

164 View

89 Download

Revisiting the duality of computation: an algebraic analysis of classical realizability models

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share