Didier Rémy
- Centre Inria de Paris
Publications
Publications
|
|
On the design and implementation of Modular ExplicitsJFLA 2026 – 37es Journées Francophones des Langages Applicatifs, Marie Kerjean; Yannick Zakowski, Jan 2026, Oberbronn, France |
|
|
Omnidirectional type inference for MLWITS 2026. 5th Workshop on the Implementation of Type Systems, Jan 2026, Rennes, France |
Implicit modules, a middle step towards modular implicitsHigher-order, Typed, Inferred, Strict: ML Family Workshop 2025, Oct 2025, Singapore, Singapore |
|
|
|
On the design and implementation of Modular ExplicitsOCaml Workshop @ ICFP 2024, Sep 2024, Milan, Italy |
|
|
Retrofitting OCaml modulesJFLA 2023 - 34èmes Journées Francophones des Langages Applicatifs, Jan 2023, Praz-sur-Arly, France. pp.59-100 |
Ornamentation put into Practice in MLSeventh Workshop on Mathematically Structured Functional Programming (MSFP 2018), Jul 2018, Oxford, United Kingdom |
|
DisornamentationML 2018 - ML Family Workshop, Sep 2018, St. Louis, Missouri, United States |
|
Ornaments: exploiting parametricity for safer, more automated code refactorization and code reuse (invited talk)the 10th ACM SIGPLAN Symposium on Haskell, Sep 2017, Oxford, France. pp.1-1 |
|
|
|
Which simple types have a unique inhabitant?The 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015), Aug 2015, Vancouver, Canada |
Full reduction in the face of absurdityESOP'2015: European Conference on Programming Languages and Systems, Apr 2015, London, United Kingdom |
|
|
|
Deciding unique inhabitants with sums (work in progress)TYPES, May 2014, Paris, France |
|
|
System F with Coercion ConstraintsCSL-LICS 2014: Joint Meeting of the Annual Conference on Computer Science Logic and the Annual Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. pp.34, ⟨10.1145/2603088.2603128⟩ |
Ornaments in practiceWGP 2014: ACM workshop on Generic programming, Aug 2014, Gothenburg, Sweden. ⟨10.1145/2633628.2633631⟩ |
|
|
|
Ambivalent Types for Principal Type Inference with GADTsAPLAS 2013 - 11th Asian Symposium on Programming Languages and Systems, 2013, Melbourne, Australia. pp.257-272, ⟨10.1007/978-3-319-03542-0_19⟩ |
|
|
GADTs meet subtypingESOP 2013 - 22nd European Symposium on Programming, Mar 2013, Rome, Italy. pp.554-573, ⟨10.1007/978-3-642-37036-6⟩ |
On the Power of Coercion AbstractionPOPL 2012: 39th ACM SIGPLAN-SIGACT Symposium on Principle Of Programming Languages, ACM, Jan 2012, Philadelphia, United States. ⟨10.1145/2103656.2103699⟩ |
|
|
|
Tracing ambiguity in GADT type inferenceACM SIGPLAN Workshop on ML, Sep 2012, copenhagen, Denmark |
|
|
GADTs Meet SubtypingACM SIGPLAN Workshop on ML, Sep 2012, Copenhagen, Denmark |
|
|
GADT meet subtypingACM SIGPLAN Workshop on ML, Aug 2012, Copenhague, Denmark |
Modeling abstract types in modules with open existential typesPOPL09: The 36th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Jan 2009, Savannah GA USA, France. pp.354-365, ⟨10.1145/1480881.1480926⟩ |
|
|
|
Simple, partial type-inference for System F based on type-containmentProceedings of the tenth International Conference on Functional Programming, Sep 2005, Tallinn, Estonia |
Subtyping Recursive Types Modulo Associative Commutative Products7th International Conference, TLCA 2005, Apr 2005, Nara, Japan. pp.179-193, ⟨10.1007/11417170_14⟩ |
|
|
Omnidirectional type inference for ML: principality any wayUniversity of Cambridge, INRIA, IRIF, Université Paris Cité. 2025 |
|
|
The OCaml system release 5.4: Documentation and user's manual[Intern report] Inria. 2025, pp.1107 |
|
|
A Principled Approach to Ornamentation in ML[Research Report] Inria. 2017 |
|
|
Full reduction in the face of absurdity[Research Report] INRIA. 2014 |
|
|
System F with Coercion Constraints[Research Report] RR-8456, INRIA. 2014, pp.36 |
|
|
GADT meet Subtyping[Research Report] RR-8114, INRIA. 2012, pp.33 |
|
|
On the Power of Coercion Abstraction[Research Report] RR-7587, INRIA. 2011, pp.59 |
|
|
Syntactic theories and the algebra of record terms[Research Report] RR-1869, INRIA. 1993 |
|
|
Extension of ML type system with a sorted equation theory on types[Research Report] RR-1766, INRIA. 1992 |
|
|
Typing record concatenation for free[Research Report] RR-1739, INRIA. 1992 |
|
|
Type inference for records in a natural extension of ML[Research Report] RR-1431, INRIA. 1991 |
|
|
Avoiding Signature Avoidance in ML Modules with ZippersProceedings of the ACM on Programming Languages, 2025, POPL (9), ⟨10.1145/3704902⟩ |
|
|
Fulfilling OCaml Modules with TransparencyProceedings of the ACM on Programming Languages, 2024, 8 (OOPSLA1), pp.194-222. ⟨10.1145/3649818⟩ |
|
|
A Principled Approach to Ornamentation in MLProceedings of the ACM on Programming Languages, 2018, pp.1-30. ⟨10.1145/3158109⟩ |
|
|
A Church-Style Intermediate Language for MLFTheoretical Computer Science, 2012, 435, pp.77--105. ⟨10.1016/j.tcs.2012.02.026⟩ |
|
|
Recasting MLFInformation and Computation, 2009, Volume 207, Issue 6, June 2009, Pages 726-785, 207 (6), pp.726-785. ⟨10.1016/j.ic.2008.12.006⟩ |
|
|
CybersécuritéInria, 3, pp.18, 2019, Inria white book |
|
|
CybersecurityInria, 3, pp.172, 2019, Inria white book |
|
|
From Amber to Coercion ConstraintsMartin Abadi; Philippa Gardner; Andrew D. Gordon; Radu Mardare. Essays for the Luca Cardelli Fest, MSR-TR-2014-104, Microsoft Research, 2014, TechReport |
|
|
Ambivalent Types for Principal Type Inference with GADTs (extended version)2013 |