default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristophe Raffalli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j9]Rodolphe Lepigre, Christophe Raffalli:
Practical Subtyping for Curry-Style Languages. ACM Trans. Program. Lang. Syst. 41(1): 5:1-5:58 (2019)- 2018
- [c4]Rodolphe Lepigre, Christophe Raffalli:
Abstract Representation of Binders in OCaml using the Bindlib Library. LFMTP@FSCD 2018: 42-56 - 2016
- [i1]Rodolphe Lepigre, Christophe Raffalli:
Subtyping-Based Type-Checking for System F with Induction and Coinduction. CoRR abs/1604.01990 (2016) - 2010
- [c3]Muhammad Humayoun
, Christophe Raffalli:
MathAbs: a representational language for mathematics. FIT 2010: 37
2000 – 2009
- 2009
- [j8]René David, Christophe Raffalli, Guillaume Theyssier, Katarzyna Grygiel, Jakub Kozik, Marek Zaionc:
Some properties of random lambda terms. Log. Methods Comput. Sci. 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. Informaticae 84(2): 241-258 (2008) - 2006
- [p1]Christophe Raffalli, Paul Rozière:
PhoX. The Seventeen Provers of the World 2006: 67-71 - 2004
- [j6]René David, Christophe Raffalli:
An experiment concerning mathematical proofs on computers with French undergraduate students. J. Appl. Log. 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. Log. 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]Christophe Raffalli:
System ST \beta-reduction and completeness. LICS 2003: 21- - 2001
- [j2]Christophe Raffalli:
Completeness, minimal logic and programs extraction. Theor. Comput. Sci. 254(1-2): 259-271 (2001)
1990 – 1999
- 1998
- [j1]Christophe Raffalli:
A Semantical Storage Operator Theorem for All Types. Ann. Pure Appl. Log. 91(1): 17-31 (1998) - 1993
- [c1]Christophe Raffalli:
Data Types, Infinity and Equality in System AF2. CSL 1993: 280-294
Coauthor Index
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-25 05:42 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:
