default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Louis Krivine
Person information
- affiliation: University Paris-Diderot, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j14]Jean-Louis Krivine:
A program for the full axiom of choice. Log. Methods Comput. Sci. 17(3) (2021)- 2020
- [i7]Jean-Louis Krivine:
A program for the full axiom of choice. CoRR abs/2006.05433 (2020)
2010 – 2019
- 2018
- [j13]Jean-Louis Krivine:
Realizability algebras III: some examples. Math. Struct. Comput. Sci. 28(1): 45-76 (2018) - 2016
- [c4]Jean-Louis Krivine:
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis. CSL 2016: 25:1-25:11 - 2015
- [i6]Jean-Louis Krivine:
Bar recursion in classical realisability : dependent choice and well ordering of R. CoRR abs/1502.00112 (2015) - 2014
- [c3]Jean-Louis Krivine:
On the Structure of Classical Realizability Models of ZF. TYPES 2014: 146-161 - [i5]Jean-Louis Krivine:
On the structure of classical realizability models of ZF. CoRR abs/1408.1868 (2014) - 2012
- [j12]Jean-Louis Krivine:
Realizability algebras II : new models of ZF + DC. Log. Methods Comput. Sci. 8(1) (2012) - [i4]Jean-Louis Krivine:
Realizability algebras III: some examples. CoRR abs/1210.5065 (2012) - 2011
- [j11]Jean-Louis Krivine:
Realizability algebras: a program to well order R. Log. Methods Comput. Sci. 7(3) (2011) - 2010
- [i3]Jean-Louis Krivine:
Algèbres de réalisabilité: un programme pour bien ordonner R. CoRR abs/1002.3438 (2010)
2000 – 2009
- 2008
- [i2]Jean-Louis Krivine:
Structures de réalisabilité, RAM et ultrafiltre sur N. CoRR abs/0809.2394 (2008) - 2007
- [j10]Jean-Louis Krivine:
A call-by-name lambda-calculus machine. High. Order Symb. Comput. 20(3): 199-207 (2007) - [i1]Jean-Louis Krivine, Yves Legrandgérard:
Valid formulas, games and network protocols. CoRR abs/0708.1480 (2007) - 2003
- [j9]Jean-Louis Krivine:
Dependent choice, 'quote' and the clock. Theor. Comput. Sci. 308(1-3): 259-276 (2003) - 2001
- [j8]Jean-Louis Krivine:
Typed lambda-calculus in classical Zermelo-Frænkel set theory. Arch. Math. Log. 40(3): 189-205 (2001) - 2000
- [c2]Vincent Danos, Jean-Louis Krivine:
Disjunctive Tautologies as Synchronisation Schemes. CSL 2000: 292-301 - [c1]Jean-Louis Krivine:
The Curry-Howard Correspondence in Set Theory. LICS 2000: 307-308
1990 – 1999
- 1996
- [j7]Jean-Louis Krivine:
About Classical Logic and Imperative Programming. Ann. Math. Artif. Intell. 16: 405-414 (1996) - [j6]Jean-Louis Krivine:
Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. Bull. Symb. Log. 2(4): 405-421 (1996) - 1994
- [j5]Jean-Louis Krivine:
Classical Logic, Storage Operators and Second-Order lambda-Calculus. Ann. Pure Appl. Log. 68(1): 53-78 (1994) - [j4]Jean-Louis Krivine:
A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. Theor. Comput. Sci. 129(1): 79-94 (1994) - 1993
- [b1]Jean-Louis Krivine:
Lambda-calculus, types and models. Ellis Horwood series in computers and their applications, Masson 1993, ISBN 978-0-13-062407-9, pp. I-VIII, 1-180 - 1991
- [j3]Jean-Louis Krivine:
Lambda-calcul, évaluation paresseuse et mise en mémoire. RAIRO Theor. Informatics Appl. 25: 67-84 (1991) - 1990
- [j2]Jean-Louis Krivine:
Opérateurs de mise en mémoire et traduction de Gödel. Arch. Math. Log. 30(4): 241-267 (1990) - [j1]Jean-Louis Krivine, Michel Parigot:
Programming with Proofs. J. Inf. Process. Cybern. 26(3): 149-167 (1990)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
