8 citations · 36 across the 24 of their papers we have counts for
7 papers · 2 filters
Spector bar recursion over finite partial functions
Paulo Oliva, Thomas Powell
We introduce a new, demand-driven variant of Spector's bar recursion in the spirit of the Berardi-Bezem-Coquand functional. The recursion takes place over finite partial functions…
The Herbrand Functional Interpretation of the Double Negation Shift
Martin Escardo, Paulo Oliva
This paper considers a generalisation of selection functions over an arbitrary strong monad , as functionals of type . It is assumed throughout that…
A Higher-order Framework for Decision Problems and Games
Jules Hedges, Paulo Oliva, Evguenia Winschel +2
We introduce a new unified framework for modelling both decision problems and finite games based on quantifiers and selection functions. We show that the canonical utility maximisa…
Proceedings Fifth International Workshop on Classical Logic and Computation
Paulo Oliva
Classical Logic and Computation (CL&C) 2014 is the fifth edition of this workshop series. The workshop series intends to cover all work aiming to explore computational aspects of c…
Bar Recursion and Products of Selection Functions
Martin Escardo, Paulo Oliva
We show how two iterated products of selection functions can both be used in conjunction with system T to interpret, via the dialectica interpretation and modified realizability, f…
Proving termination with transition invariants of height omega
Stefano Berardi, Paulo Oliva, Silvia Steila
The Termination Theorem by Podelski and Rybalchenko states that the reduction relations which are terminating from any initial state are exactly the reduction relations whose trans…
On Affine Logic and Łukasiewicz Logic
Rob Arthan, Paulo Oliva
The multi-valued logic of Łukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the ax…