| 2010 | ||
|---|---|---|
| c4 | Muhammad Humayoun, Christophe Raffalli: MathAbs: a representational language for mathematics. FIT 2010: 37 | |
| 2009 | ||
| j8 | René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc: Some properties of random lambda terms. Logical Methods in Computer Science 9(1) (2009) | |
| 2008 | ||
| j7 | Christophe Raffalli, Frédéric Ruyer: Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work). Fundam. Inform. 84(2): 241-258 (2008) | |
| 2006 | ||
| c3 | ||
| 2004 | ||
| j6 | René David, Christophe Raffalli: An experiment concerning mathematical proofs on computers with French undergraduate students. J. Applied Logic 2(2): 219-239 (2004) | |
| j5 | Christophe Raffalli: Getting results from programs extracted from classical proofs. Theor. Comput. Sci. 323(1-3): 49-70 (2004) | |
| 2003 | ||
| j4 | Christophe Raffalli: System ST toward a type system for extraction and proofs of programs. Ann. Pure Appl. Logic 122(1-3): 107-130 (2003) | |
| j3 | Karim Nour, Christophe Raffalli: Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic. Theor. Comput. Sci. 308(1-3): 227-237 (2003) | |
| c2 | ||
| 2001 | ||
| j2 | Christophe Raffalli: Completeness, minimal logic and programs extraction. Theor. Comput. Sci. 254(1-2): 259-271 (2001) | |
| 1998 | ||
| j1 | Christophe Raffalli: A Semantical Storage Operator Theorem for All Types. Ann. Pure Appl. Logic 91(1): 17-31 (1998) | |
| 1993 | ||
| c1 | ||
| 1 | René David | |
| 2 | Katarzyna Grygiel | |
| 3 | Muhammad Humayoun | |
| 4 | Jakub Kozik | |
| 5 | Karim Nour | |
| 6 | Paul Rozière | |
| 7 | Frédéric Ruyer | |
| 8 | Guillaume Theyssier | |
| 9 | Marek Zaionc |
Data released under the ODC-BY 1.0 license — See also our legal information page