| [1] |
Clément Blaudeau, Didier Rémy, and Gabriel Radanne.
Avoiding signature avoidance in modules with zippers.
Unpublished draft, available electronically, September 2024.
[ bib | PDF | http | Abstract ] |
| [2] |
Samuel Vivien, Didier Rémy, Thomas Réfis, and Gabriel Scherer.
On the design and implementation of Modular Explicits.
Presented at the OCaml 2024 workshop, available electronically,
September 2024.
[ bib | PDF | .html | Abstract ] |
| [3] |
Clément Blaudeau, Didier Rémy, and Gabriel Radanne.
Fulfilling OCaml modules with Transparency.
Proc. ACM Program. Lang., 8(OOPSLA'24):194--222, 2024.
[ bib | DOI | PDF | http | Abstract ] |
| [4] |
Clément Blaudeau, Didier Rémy, and Gabriel Radanne.
Retrofitting OCaml modules.
In Timothy Bourke and Delphine Demange, editors, JFLA 2023 -
34èmes Journées Francophones des Langages Applicatifs, pages
59--100, Praz-sur-Arly, France, January 2023.
[ bib | See also | PDF | http | Abstract ] |
| [5] |
Steve Kremer, Ludovic Mé, Didier Rémy, and Vincent Roca.
Cybersecurity: Current challenges and Inria's research
directions.
Number 3 in Inria white book. Inria, January 2019.
[ bib | PDF | http ] |
| [6] |
Lucas Baudin and Didier Rémy.
Disornamentation.
In ML Family Workshop 2018, St. Louis, Missouri, United
States, September 2018.
[ bib | PDF | http ] |
| [7] |
Didier Rémy.
Ornamentation put into Practice in ML.
In Seventh Workshop on Mathematically Structured Functional
Programming (MSFP 2018), Oxford, United Kingdom, July 2018.
[ bib | http ] |
| [8] |
Thomas Williams and Didier Rémy.
A Principled Approach to Ornamentation in ML.
Proceedings of the ACM on Programming Languages,
2(POPL):21:1--21:30, January 2018.
[ bib | DOI | PDF | http ] |
| [9] |
Thomas Williams and Didier Rémy.
A Principled Approach to Ornamentation in ML (extended
version).
Research report, Inria, November 2017.
[ bib | DOI | PDF | http ] |
| [10] |
Didier Rémy.
Ornaments: exploiting parametricity for safer, more automated
code refactorization and code reuse (invited talk).
In Haskell 2017: Proceedings of the 10th ACM SIGPLAN
International Symposium on Haskell, pages 1--1, Oxford, United Kingdom,
September 2017. ACM Press.
[ bib | http ] |
| [11] |
Didier Rémy.
Type Systems for Programming Languages.
Course notes, available electronically, 2015.
[ bib | PDF ] |
| [12] |
Gabriel Scherer and Didier Rémy.
Full Reduction in the Face of Absurdity.
In Programming Languages and Systems - 24th European Symposium
on Programming, ESOP 2015, Held as Part of the European Joint Conferences
on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18,
2015. Proceedings, pages 685--709, 2015.
[ bib | DOI | PDF | http ] |
| [13] |
Gabriel Scherer and Didier Rémy.
Which simple types have a unique inhabitant?
In Proceedings of the 20th ACM SIGPLAN International
Conference on Functional Programming, ICFP 2015, Vancouver, BC, Canada,
September 1-3, 2015, pages 243--255, 2015.
[ bib | DOI | PDF | http ] |
| [14] |
Gabriel Scherer and Didier Rémy.
Which simple types have a unique inhabitant?
Extended version of [13], 2015.
[ bib | PDF | http ] |
| [15] |
Gabriel Scherer and Didier Rémy.
Full reduction in the face of absurdity.
Research report, INRIA, December 2014.
[ bib | PDF | http ] |
| [16] |
Thomas Williams, Pierre-Évariste Dagand, and Didier Rémy.
Ornaments in Practice.
September 2014.
[ bib | PDF | Abstract ] |
| [17] |
Didier Rémy and Julien Cretin.
From Amber to Coercion Constraints.
In Martin Abadi, Philippa Gardner, Andrew D. Gordon, and Radu
Mardare, editors, Essays for the Luca Cardelli Fest, number
MSR-TR-2014-104 in TechReport. Microsoft Research, September 2014.
[ bib | PDF | .pdf ] |
| [18] |
Julien Cretin and Didier Rémy.
System F with Coercion Constraints.
In Logics In Computer Science (LICS). ACM, July 2014.
[ bib | See also | PDF | Abstract ] |
| [19] |
Thomas Williams, Pierre-Évariste Dagand, and Didier Rémy.
Ornaments in Practice.
In WGP+ '14: Proceedings of the 10th ACM SIGPLAN Workshop on
Generic Programming, New York, NY, USA, July 2014. ACM.
[ bib | PDF | Abstract ] |
| [20] |
Julien Cretin and Didier Rémy.
System F with Coercion Constraints.
Rapport de recherche RR-8456, INRIA, January 2014.
[ bib | PDF | http | Abstract ] |
| [21] |
Jacques Garrigue and Didier Rémy.
Ambivalent Types for Principal Type Inference with
GADTs.
In 11th Asian Symposium on Programming Languages and Systems,
Melbourne, Australia, December 2013.
[ bib | See also | PDF | Abstract ] |
| [22] |
Julien Cretin and Didier Rémy.
Coherent Coercion Abstration with a step-indexed
strong-reduction semantics.
available at http://gallium.inria.fr/ remy/coercions/, July 2013.
[ bib | See also | PDF | Abstract ] |
| [23] |
Gabriel Scherer and Didier Rémy.
GADTs Meet Subtyping.
In Proceedings of the 22Nd European Conference on Programming
Languages and Systems, ESOP'13, pages 554--573, Berlin, Heidelberg, 2013.
Springer-Verlag.
[ bib | DOI | See also | At Publisher's | Abstract ] |
| [24] |
Didier Rémy and Boris Yakobowski.
A Church-Style Intermediate Language for MLF.
Theoretical Computer Science, 435(1):77--105, June 2012.
[ bib | See also | PDF | At Publisher's | Abstract ] |
| [25] |
Jacques Garrigue and Didier Rémy.
Tracing ambiguity in GADT type inference.
Unpublished, June 2012.
[ bib | PDF | Abstract ] |
| [26] |
Julien Cretin and Didier Rémy.
On the Power of Coercion Abstraction.
In Proceedings of the 39th ACM Symposium on Principles of
Programming Languages (POPL 2012), Philadephia, PA, USA, January 2012.
[ bib | See also | At Publisher's | Abstract ] |
| [27] |
Julien Cretin and Didier Rémy.
Extending System F-eta with Abstraction over Erasable
Coercions.
Research Report RR-7587, INRIA, July 2011.
[ bib | See also | PDF | At Publisher's | Abstract ] |
| [28] |
Didier Rémy and Boris Yakobowski.
A Church-Style Intermediate Language for MLF.
In Matthias Blume, Naoki Kobayashi, and German Vidal, editors,
Functional and Logic Programming, volume 6009 of Lecture Notes in
Computer Science, pages 24--39. Springer Berlin / Heidelberg, 2010.
[ bib | DOI | See also | PDF | At Publisher's | Abstract ] |
| [29] |
Benoît Montagu and Didier Rémy.
Modeling Abstract Types in Modules with Open Existential Types.
In Proceedings of the 36th ACM Symposium on Principles of
Programming Languages (POPL'09), pages 354--365, Savannah, GA, USA, January
2009.
[ bib | DOI | See also | PDF | Abstract ] |
| [30] |
Didier Le Botlan and Didier Rémy.
Recasting MLF.
Information and Computation, 207(6):726--785, 2009.
[ bib | DOI | See also | PDF | At Publisher's | http | Abstract ] |
| [31] |
Didier Rémy and Boris Yakobowski.
Efficient Type Inference for the MLF Language: a
graphical and constraints-based approach.
In The 13th ACM SIGPLAN International Conference on Functional
Programming (ICFP'08), pages 63--74, Victoria, BC, Canada, September 2008.
[ bib | DOI | See also | PDF | Abstract ] |
| [32] |
Xavier Leroy and Didier Rémy.
Programmation du système Unix en OCaml.
Course notes, available electronically, 2008.
[ bib | PDF ] |
| [33] |
Benoît Montagu and Didier Rémy.
Towards a Simpler Account of Modules and Generativity: Abstract
Types have Open Existential Types.
January 2008.
[ bib | See also | PDF | Abstract ] |
| [34] |
Didier Le Botlan and Didier Rémy.
Recasting MLF.
Research Report 6228, INRIA, Rocquencourt, BP 105, 78 153 Le Chesnay
Cedex, France, June 2007.
[ bib | See also | PDF | At Publisher's | Abstract ] |
| [35] |
Didier Rémy and Boris Yakobowski.
A graphical presentation of MLF types with a linear-time
unification algorithm.
In Proceedings of the 2007 ACM SIGPLAN International Workshop on
Types in Languages Design and Implementation (TLDI'07), pages 27--38, Nice,
France, January 2007. ACM Press.
[ bib | http | Abstract ] |
| [36] |
Didier Rémy and Boris Yakobowski.
A graphical presentation of MLF types with a linear-time
incremental unification algorithm.
Extended version of [35], July
2006.
[ bib | See also | PDF | .ps.gz | Abstract ] |
| [37] |
Didier Rémy.
Simple, partial type-inference for System F based on
type-containment.
In Proceedings of the tenth International Conference on
Functional Programming, September 2005.
[ bib | See also | PDF | .ps.gz | Abstract ] |
| [38] |
Roberto Di Cosmo, François Pottier, and Didier Rémy.
Subtyping Recursive Types modulo Associative Commutative
Products.
In Seventh International Conference on Typed Lambda Calculi and
Applications (TLCA'05), Nara, Japan, April 2005.
[ bib | Long version .pdf | Long version | PDF | .ps.gz | Abstract ] |
| [39] |
François Pottier and Didier Rémy.
The Essence of ML Type Inference.
In Benjamin C. Pierce, editor, Advanced Topics in Types and
Programming Languages, chapter 10, pages 389--489. MIT Press, 2005.
[ bib | http ] |
| [40] |
Didier Le Botlan and Didier Rémy.
MLF: Raising ML to the power of System F.
In Proceedings of the Eighth ACM SIGPLAN International
Conference on Functional Programming, pages 27--38, August 2003.
[ bib | PDF | http | .dvi.gz | .ps.gz | Abstract ] |
| [41] |
François Pottier and Didier Rémy.
The Essence of ML Type Inference.
Extended preliminary version of [39], 2003.
[ bib | See also | .ps.gz ] |
| [42] |
Didier Rémy.
Using, Understanding, and Unraveling the OCaml
Language.
In Gilles Barthe, editor, Applied Semantics. Advanced
Lectures. LNCS 2395., pages 413--537. Springer Verlag, 2002.
[ bib | PDF | http | .ps.gz | Abstract ] |
| [43] |
Cédric Fournet, Luc Maranget, Cosimo Laneve, and Didier Rémy.
Inheritance in the Join Calculus.
In Foundations of Software Technology and Theoretical Computer
Science, volume 1974 of Lecture Notes in Computer Science. Springer,
December 2000.
[ bib | PDF | http | .ps.gz | Abstract ] |
| [44] |
Didier Rémy.
Re-exploring multiple inheritance.
Invited talk at FOOL'7, January 2000.
[ bib ] |
| [45] |
Jacques Garrigue and Didier Rémy.
Extending ML with Semi-Explicit Higher-Order Polymorphism.
Information and Computation, 155(1/2):134--169, 1999.
A preliminary version appeared in TACS'97.
[ bib | PDF | http | Abstract ] |
| [46] |
Didier Rémy and Jérôme Vouillon.
The reality of virtual types for free!
Unpublished note avaliable electronically, October 1998.
[ bib | http | .ps.gz | Abstract ] |
| [47] |
Didier Rémy.
From Classes to Objects via Subtyping.
A preliminary version appeared in LNCS 1381 (ESOP 98), June 1998.
[ bib | PDF | Abstract ] |
| [48] |
Didier Rémy.
From Classes to Objects via Subtyping.
In European Symposium On Programming, volume 1381 of
Lecture Notes in Computer Science. Springer, March 1998.
[ bib | .html | Abstract ] |
| [49] |
Didier Rémy.
Des enregistrements aux objets.
Mémoire d'habilitation à diriger des recherches,
Université de Paris 7, 1998.
[ bib | PDF | Abstract ] |
| [50] |
Carl A. Gunter, Didier Rémy, and Jon G. Riecke.
Return types for Functional Continuations.
A preliminary version appeared as [58],
1998.
[ bib | Software | See also | PDF | Abstract ] |
| [51] |
Didier Rémy and Jérôme Vouillon.
Objective ML: An effective object-oriented extension to ML.
Theory And Practice of Object Systems, 4(1):27--50, 1998.
A preliminary version appeared in the proceedings of the 24th ACM
Conference on Principles of Programming Languages, 1997.
[ bib | PDF | Abstract ] |
| [52] |
Jacques Garrigue and Didier Rémy.
Extending ML with Semi-Explicit Higher-Order Polymorphism.
In International Symposium on Theoretical Aspects of Computer
Software, volume 1281 of Lecture Notes in Computer Science, pages
20--46. Springer, September 1997.
[ bib | PDF | Abstract ] |
| [53] |
Cédric Fournet, Luc Maranget, Cosimo Laneve, and Didier Rémy.
Implicit typing à la ML for the join-calculus.
In 8th International Conference on Concurrency Theory
(CONCUR'97), volume 1243 of Lecture Notes in Computer Science, pages
196--212, Warsaw, Poland, 1997. Springer.
[ bib | PDF | Abstract ] |
| [54] |
Didier Rémy and Jérôme Vouillon.
Objective ML: A simple object-oriented extension of ML.
In Proceedings of the 24th ACM Conference on Principles of
Programming Languages, pages 40--53, Paris, France, January 1997.
[ bib | PDF | Abstract ] |
| [55] |
Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, and
Didier Rémy.
A Calculus of Mobile Agents.
In 7th International Conference on Concurrency Theory
(CONCUR'96), volume 1119 of Lecture Notes in Computer Science, pages
406--421, Pisa, Italy, August 26-29 1996. Springer.
[ bib | PDF | Abstract ] |
| [56] |
Didier Rémy.
Better subtypes and row variables for record types.
Presented at the workshop on Advances in types for computer science
at the Newton Institute, Cambridge, UK, August 1995.
[ bib | .dvi.gz | Abstract ] |
| [57] |
Didier Rémy.
A case study of typechecking with constrained types: Typing
record concatenation.
Presented at the workshop on Advances in types for computer science
at the Newton Institute, Cambridge, UK, August 1995.
[ bib | .dvi.gz | Abstract ] |
| [58] |
Carl A. Gunter, Didier Rémy, and Jon G. Riecke.
A Generalization of Exceptions and Control in ML.
In Proc. ACM Conf. on Functional Programming and Computer
Architecture, June 1995.
[ bib | PDF | http | Abstract ] |
| [59] |
Martín Abadi, Luca Cardelli, Benjamin C. Pierce, and Didier Rémy.
Dynamic typing in polymorphic languages.
Journal of Functional Programming, 5(1):111--130, January 1995.
Also appeared as SRC Research Report 120. Preliminary version
appeared in the Proceedings of the ACM SigPlan Workshop on ML and its
Applications, June 1992.
[ bib | PDF | Abstract ] |
| [60] |
Didier Rémy.
Programming Objects with ML-ART: An extension to ML with
Abstract and Record Types.
In Masami Hagiya and John C. Mitchell, editors, International
Symposium on Theoretical Aspects of Computer Software, number 789 in Lecture
Notes in Computer Science, pages 321--346, Sendai, Japan, April 1994.
Springer-Verlag.
[ bib | PDF | Abstract ] |
| [61] |
Benjamin C. Pierce, Didier Rémy, and David N. Turner.
A Typed Higher-Order Programming Language Based on the
Pi-Calculus.
A preliminary version was presented at the Workshop on Type Theory
and its Application to Computer Systems, Kyoto University, July 1993.
[ bib ] |
| [62] |
Didier Rémy.
Syntactic Theories and the Algebra of Record Terms.
Research Report 1869, Institut National de Recherche en Informatique
et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1993.
[ bib | PDF | Abstract ] |
| [63] |
Carl A. Gunter and Didier Rémy.
A proof-theoretic assessment of runtime type errors.
Research Report 11261-921230-43TM, AT&T Bell Laboratories, 600
Mountain Ave, Murray Hill, NJ 07974-2070, 1993.
[ bib | PDF | Abstract ] |
| [64] |
Didier Rémy.
Typing Record Concatenation for Free.
In Carl A. Gunter and John C. Mitchell, editors, Theoretical
Aspects Of Object-Oriented Programming. Types, Semantics and Language
Design. MIT Press, 1993.
[ bib | PDF | Abstract ] |
| [65] |
Didier Rémy.
Type Inference for Records in a Natural Extension of ML.
In Carl A. Gunter and John C. Mitchell, editors, Theoretical
Aspects Of Object-Oriented Programming. Types, Semantics and Language
Design. MIT Press, 1993.
[ bib | PDF | Abstract ] |
| [66] |
Didier Rémy.
Efficient Representation of Extensible Records.
In Proceedings of the 1992 workshop on ML and its
Applications, page 12, San Francisco, USA, June 1992.
[ bib | PDF ] |
| [67] |
Didier Rémy.
Extending ML Type System with a Sorted Equational Theory.
Research Report 1766, Institut National de Recherche en Informatique
et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, 1992.
[ bib | PDF | Abstract ] |
| [68] |
Didier Rémy.
Typing Record Concatenation for Free.
In Nineteenth Annual Symposium on Principles Of Programming
Languages, pages 166--176, 1992.
[ bib | PDF ] |
| [69] |
Didier Rémy.
Projective ML.
In 1992 ACM Conference on Lisp and Functional Programming,
pages 66--75, New-York, 1992. ACM press.
[ bib | PDF | Abstract ] |
| [70] |
Didier Rémy.
Type Inference for Records in a natural Extension of ML.
Research Report 1431, Institut National de Recherche en Informatique
et Automatisme, Rocquencourt, BP 105, 78 153 Le Chesnay Cedex, France, May
1991.
See also [65] and [72].
[ bib | PDF ] |
| [71] |
Didier Rémy.
Algèbres Touffues. Application au Typage Polymorphe des
Objets Enregistrements dans les Langages Fonctionnels.
Thèse de doctorat, Université de Paris 7, 1990.
[ bib | PDF ] |
| [72] |
Didier Rémy.
Records and Variants as a natural Extension of ML.
In Sixteenth Annual Symposium on Principles Of Programming
Languages, 1989.
See also [65].
[ bib ] |
This file was generated by bibtex2html 1.99.