Jean-Louis Krivine

Affiliations:
  • University Paris-Diderot, France


According to our database1, Jean-Louis Krivine authored at least 23 papers between 1990 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A program for the full axiom of choice.
Log. Methods Comput. Sci., 2021

2018
Realizability algebras III: some examples.
Math. Struct. Comput. Sci., 2018

2016
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
Bar recursion in classical realisability : dependent choice and well ordering of R.
CoRR, 2015

2014
On the Structure of Classical Realizability Models of ZF.
Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

2012
Realizability algebras II : new models of ZF + DC
Log. Methods Comput. Sci., 2012

2011
Realizability algebras: a program to well order R
Log. Methods Comput. Sci., 2011

2010
Algèbres de réalisabilité: un programme pour bien ordonner R
CoRR, 2010

2008
Structures de réalisabilité, RAM et ultrafiltre sur N
CoRR, 2008

2007
A call-by-name lambda-calculus machine.
High. Order Symb. Comput., 2007

Valid formulas, games and network protocols
CoRR, 2007

2003
Dependent choice, 'quote' and the clock.
Theor. Comput. Sci., 2003

2001
Typed lambda-calculus in classical Zermelo-Frænkel set theory.
Arch. Math. Log., 2001

2000
The Curry-Howard Correspondence in Set Theory.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

Disjunctive Tautologies as Synchronisation Schemes.
Proceedings of the Computer Science Logic, 2000

1996
Une preuve formelle et intuitionniste du théorème de complétude de la logique classique.
Bull. Symb. Log., 1996

About Classical Logic and Imperative Programming.
Ann. Math. Artif. Intell., 1996

1994
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus.
Theor. Comput. Sci., 1994

Classical Logic, Storage Operators and Second-Order lambda-Calculus.
Ann. Pure Appl. Log., 1994

1993
Lambda-calculus, types and models.
Ellis Horwood series in computers and their applications, Masson, ISBN: 978-0-13-062407-9, 1993

1991
Lambda-calcul, évaluation paresseuse et mise en mémoire.
RAIRO Theor. Informatics Appl., 1991

1990
Programming with Proofs.
J. Inf. Process. Cybern., 1990

Opérateurs de mise en mémoire et traduction de Gödel.
Arch. Math. Log., 1990


  Loading...