Searcharxiv⌕ Search

arXiv subjects

Félix Castro

Publications and source records attributed to Félix Castro.

4 recordsLinked to original sources

Evidence-Carrying Transport Across Effects

A program logic proved sound against one effectful semantics need not remain sound when the effect is re-implemented, yet the semantic relationship between reasoning before and after a change of effect is usually left implicit and re-established by hand. This paper provides a uniform, proof-relevant account of it. Working in realizability, where a notion of computation determines a model whose entailments carry explicit program evidence, we introduce simulations between effectful realizability cores, generalizing Longley's applicative morphisms to computation over an arbitrary strong monad. A single simulation transports the source logic along a ladder: it induces a morphism of the associated evidenced frames and, functorially, of the induced triposes. These passages are $2$-fully-faithful, so the three levels agree and a change of effect carries the entire higher-order program logic together with the evidence witnessing each derivation. A computationally dense simulation moreover computes a modality on the source logic, a nucleus through which the transport factors and which marks exactly the reasoning stable under the change, read off from the translation rather than postulated. This recovers known examples such as the double-negation modality of classical realizability, and examples such as sheafification arise from a modal refinement of the construction. Overall, the framework makes a change of effect a first-class object, one that can be composed, factored through its modality, and shown in cases not to exist, opening a path to transporting verified reasoning across effects.

cs.LO↗

An Interpretation of E-HA$^w$ inside HA$^w$

Higher Type Arithmetic (HA$^w$) is a first-order many-sorted theory. It is a conservative extension of Heyting Arithmetic obtained by extending the syntax of terms to all of System T: the objects of interest here are the functionals of higher types. While equality between natural numbers is specified by the axioms of Peano, how can equality between functionals be defined? From this question, different versions of HA$^w$ arise, such as an extensional version (E-HA$^w$) and an intentional version (I-HA$^w$). In this work, we will see how the study of partial equivalence relations leads us to design a translation by parametricity from E-HA$^w$ to HA$^w$.

cs.LO↗

Implicative Assemblies

Implicative algebras, recently discovered by Miquel, are combinatorial structures unifying classical and intuitionistic realizability as well as forcing. In this paper we introduce implicative assemblies as sets valued in the separator of an underlying implicative algebra. Given a fixed implicative algebra A, implicative assemblies over A organise themselves in a category Asm with tracked set-theoretical functions as morphisms. We show that Asm is a quasitopos with NNO.

math.AT↗

Concurrent Realizability on Conjunctive Structures

The point of this work is to explore axiomatisations of concurrent computation using the technology of proof theory and realizability. To deal with this problem, we redefine the Concurrent Realizability of Beffara using as realizers a $π$-calculus with global fusions. We define a variant of the Conjunctive Structures of É Miquey as a general structure where belong realizers and truth values from realizability. As for Secuential Realizability, we encode the realizers into the algebraic structure by means of a combinatory presentation, following the work of Honda & Yoshida. In this first work we restricted to work with the $π$-calculus without replication and its corresponding type system is the multiplicative linear logic (MLL).

cs.LO↗