activity
20062025
most citedRealizability algebras II : new models of ZF + DC

37 citations · 105 across the 15 of their papers we have counts for

collaborators

19 papers

cs.LO2025

Reversible computations are computations

Clément Aubert, Jean Krivine

Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the obser…

math.FA2023

A note about Grothendieck's constant

Jean-Louis Krivine

A remark on the proof that the Grothendieck constant satisfies .

cs.LO2022★ 1 cited

Fundamentals of Compositional Rewriting Theory

Nicolas Behr, Russ Harmer, Jean Krivine

A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically stru…

cs.LO2021★ 1 cited

Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics (Long version)

Nicolas Behr, Jean Krivine, Jakob L. Andersen +1

The Kappa biochemistry and the MØD organic chemistry frameworks are amongst the most intensely developed applications of rewriting-based methods in the life sciences to date. A typ…

cs.LO2021

Concurrency Theorems for Non-linear Rewriting Theories

Nicolas Behr, Russ Harmer, Jean Krivine

Sesqui-pushout (SqPO) rewriting along non-linear rules and for monic matches is well-known to permit the modeling of fusing and cloning of vertices and edges, yet to date, no const…

cs.LO2020★ 1 cited

A program for the full axiom of choice

Jean-Louis Krivine

The theory of classical realizability is a framework for the Curry-Howard correspondence which enables to associate a program with each proof in Zermelo-Fraenkel set theory. But, a…