Christophe Raffalli

According to our database1, Christophe Raffalli authored at least 15 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Practical Subtyping for Curry-Style Languages.
ACM Trans. Program. Lang. Syst., 2019

2018
Abstract Representation of Binders in OCaml using the Bindlib Library.
Proceedings of the 13th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2018

2016
Subtyping-Based Type-Checking for System F with Induction and Coinduction.
CoRR, 2016

2010
MathAbs: a representational language for mathematics.
Proceedings of the FIT '10, 2010

2009
Some properties of random lambda terms
Log. Methods Comput. Sci., 2009

2008
Realizability of the Axiom of Choice in HOL. (An Analysis of Krivine's Work).
Fundam. Informaticae, 2008

2006
Proceedings of the Seventeen Provers of the World, Foreword by Dana S. Scott, 2006

2004
Getting results from programs extracted from classical proofs.
Theor. Comput. Sci., 2004

An experiment concerning mathematical proofs on computers with French undergraduate students.
J. Appl. Log., 2004

2003
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic.
Theor. Comput. Sci., 2003

System ST toward a type system for extraction and proofs of programs.
Ann. Pure Appl. Log., 2003

System ST \beta-reduction and completeness.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

2001
Completeness, minimal logic and programs extraction.
Theor. Comput. Sci., 2001

1998
A Semantical Storage Operator Theorem for All Types.
Ann. Pure Appl. Log., 1998

1993
Data Types, Infinity and Equality in System AF<sub>2</sub>.
Proceedings of the Computer Science Logic, 7th Workshop, 1993


  Loading...