Jean-Louis Krivine

Publication Activity (10 Years)

Years Active: 1990-2021
Publications (10 Years): 5

Top Topics

Partial Ordering

Complex Objects

Deductive Databases

Program Execution

Top Venues

Math. Struct. Comput. Sci.

Log. Methods Comput. Sci.

Publications

Jean-Louis Krivine
A program for the full axiom of choice. Log. Methods Comput. Sci. 17 (3) (2021)
Jean-Louis Krivine
A program for the full axiom of choice. CoRR (2020)
Jean-Louis Krivine
Realizability algebras III: some examples. Math. Struct. Comput. Sci. 28 (1) (2018)
Jean-Louis Krivine
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis. CSL (2016)
Jean-Louis Krivine
Bar recursion in classical realisability : dependent choice and well ordering of R. CoRR (2015)
Jean-Louis Krivine
On the Structure of Classical Realizability Models of ZF. TYPES (2014)
Jean-Louis Krivine
On the structure of classical realizability models of ZF. CoRR (2014)
Jean-Louis Krivine
Realizability algebras II : new models of ZF + DC Log. Methods Comput. Sci. 8 (1) (2012)
Jean-Louis Krivine
Realizability algebras III: some examples CoRR (2012)
Jean-Louis Krivine
Realizability algebras: a program to well order R Log. Methods Comput. Sci. 7 (3) (2011)
Jean-Louis Krivine
Algèbres de réalisabilité: un programme pour bien ordonner R CoRR (2010)
Jean-Louis Krivine
Structures de réalisabilité, RAM et ultrafiltre sur N CoRR (2008)
Jean-Louis Krivine, Yves Legrandgérard
Valid formulas, games and network protocols CoRR (2007)
Jean-Louis Krivine
A call-by-name lambda-calculus machine. High. Order Symb. Comput. 20 (3) (2007)
Jean-Louis Krivine
Dependent choice, 'quote' and the clock. Theor. Comput. Sci. 308 (1-3) (2003)
Jean-Louis Krivine
Typed lambda-calculus in classical Zermelo-Frænkel set theory. Arch. Math. Log. 40 (3) (2001)
Jean-Louis Krivine
The Curry-Howard Correspondence in Set Theory. LICS (2000)
Vincent Danos, Jean-Louis Krivine
Disjunctive Tautologies as Synchronisation Schemes. CSL (2000)
Jean-Louis Krivine
About Classical Logic and Imperative Programming. Ann. Math. Artif. Intell. 16 (1996)
Jean-Louis Krivine
Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. Bull. Symb. Log. 2 (4) (1996)
Jean-Louis Krivine
Classical Logic, Storage Operators and Second-Order lambda-Calculus. Ann. Pure Appl. Log. 68 (1) (1994)
Jean-Louis Krivine
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. Theor. Comput. Sci. 129 (1) (1994)
Jean-Louis Krivine
Lambda-calcul, évaluation paresseuse et mise en mémoire. RAIRO Theor. Informatics Appl. 25 (1991)
Jean-Louis Krivine, Michel Parigot
Programming with Proofs. J. Inf. Process. Cybern. 26 (3) (1990)
Jean-Louis Krivine
Opérateurs de mise en mémoire et traduction de Gödel. Arch. Math. Log. 30 (4) (1990)