Computational interpretations of analysis via products of selection functions

Authors:
Martín Escardó;Paulo Oliva
Affiliations:
University of Birmingham;Queen Mary University of London
Venue:
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Year:
2010

Citing 5
Cited 3

Program Extraction from Classical Proofs

LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Modified bar recursion

Mathematical Structures in Computer Science
Infinite sets that admit fast exhaustive search

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Selection functions, bar recursion and backward induction

Mathematical Structures in Computer Science
The Peirce translation and the double negation shift

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe

What sequential games, the tychonoff theorem and the double-negation shift have in common

Proceedings of the third ACM SIGPLAN workshop on Mathematically structured functional programming
The Peirce translation and the double negation shift

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
A Constructive Proof of Dependent Choice, Compatible with Classical Logic

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the computational interpretation of full comprehension via two well-known functional interpretations (dialectica and modified realizability) corresponds to two closely related infinite products of selection functions.