- CSB - MetaPress - Google - Bing - Yahoo
 | 2008 | |
|---|---|---|
| 13 |      | Jean-Louis Krivine: Structures de réalisabilité, RAM et ultrafiltre sur N CoRR abs/0809.2394: (2008) |
| 2007 | ||
| 12 | | Jean-Louis Krivine, Yves Legrandgérard: Valid formulas, games and network protocols CoRR abs/0708.1480: (2007) |
| 11 | | Jean-Louis Krivine: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation 20(3): 199-207 (2007) |
| 2003 | ||
| 10 | | Jean-Louis Krivine: Dependent choice, `quote' and the clock. Theor. Comput. Sci. 308(1-3): 259-276 (2003) |
| 2001 | ||
| 9 | | Jean-Louis Krivine: Typed lambda-calculus in classical Zermelo-Frænkel set theory. Arch. Math. Log. 40(3): 189-205 (2001) |
| 2000 | ||
| 8 | | Vincent Danos, Jean-Louis Krivine: Disjunctive Tautologies as Synchronisation Schemes. CSL 2000: 292-301 |
| 7 | | Jean-Louis Krivine: The Curry-Howard Correspondence in Set Theory. LICS 2000: 307-308 |
| 1996 | ||
| 6 |  | Jean-Louis Krivine: About Classical Logic and Imperative Programming. Ann. Math. Artif. Intell. 16: 405-414 (1996) |
| 5 | | Jean-Louis Krivine: Une preuve formelle et intuitionniste du théorème de complétude de la logique classique. Bulletin of Symbolic Logic 2(4): 405-421 (1996) |
| 1994 | ||
| 4 | | Jean-Louis Krivine: Classical Logic, Storage Operators and Second-Order lambda-Calculus. Ann. Pure Appl. Logic 68(1): 53-78 (1994) |
| 3 | | Jean-Louis Krivine: A General Storage Theorem for Integers in Call-by-Name lambda-Calculus. Theor. Comput. Sci. 129(1): 79-94 (1994) |
| 1991 | ||
| 2 | | Jean-Louis Krivine: Lambda-calcul, évaluation paresseuse et mise en mémoire. ITA 25: 67-84 (1991) |
| 1990 | ||
| 1 | | Jean-Louis Krivine, Michel Parigot: Programming with Proofs. Elektronische Informationsverarbeitung und Kybernetik 26(3): 149-167 (1990) |
| 1 | Vincent Danos | [8] |
| 2 | Yves Legrandgérard | [12] |
| 3 | Michel Parigot | [1] |