|
[1]
|
D. Doligez and X. Leroy, “A concurrent, generational garbage collector for a
multithreaded implementation of ML,” in Conference Record of the
Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Languages, Charleston, South Carolina, USA, January 1993
(M. S. V. Deusen and B. Lang, eds.), pp. 113--123, ACM Press, 1993.
[ DOI ]
|
|
[2]
|
X. Leroy, “Manifest types, modules, and separate compilation,” in
Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on
Principles of Programming Languages, Portland, Oregon, USA, January 17-21,
1994 (H. Boehm, B. Lang, and D. M. Yellin, eds.), pp. 109--122, ACM Press,
1994.
[ DOI ]
|
|
[3]
|
D. Doligez and G. Gonthier, “Portable, unobtrusive garbage collection for
multiprocessor systems,” in Conference Record of POPL'94: 21st ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland,
Oregon, USA, January 17-21, 1994 (H. Boehm, B. Lang, and D. M. Yellin,
eds.), pp. 70--83, ACM Press, 1994.
[ DOI ]
|
|
[4]
|
X. Leroy, “Applicative functors and fully transparent higher-order modules,”
in Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium
on Principles of Programming Languages, San Francisco, California, USA,
January 23-25, 1995 (R. K. Cytron and P. Lee, eds.), pp. 142--153, ACM
Press, 1995.
[ DOI ]
|
|
[5]
|
X. Leroy, “A syntactic theory of type generativity and sharing,” J.
Funct. Program., vol. 6, no. 5, pp. 667--698, 1996.
[ DOI ]
|
|
[6]
|
J. Garrigue and D. Rémy, “Extending ML with semi-explicit higher-order
polymorphism,” in Theoretical Aspects of Computer Software, Third
International Symposium, TACS '97, Sendai, Japan, September 23-26, 1997,
Proceedings (M. Abadi and T. Ito, eds.), vol. 1281 of Lecture Notes in
Computer Science, pp. 20--46, Springer, 1997.
[ DOI ]
|
|
[7]
|
D. Rémy and J. Vouillon, “Objective ML: A simple object-oriented
extension of ML,” in Conference Record of POPL'97: The 24th ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers
Presented at the Symposium, Paris, France, 15-17 January 1997 (P. Lee,
F. Henglein, and N. D. Jones, eds.), pp. 40--53, ACM Press, 1997.
[ DOI ]
|
|
[8]
|
X. Leroy, “The effectiveness of type-based unboxing,” in TIC 1997:
workshop Types in Compilation, Technical report BCCS-97-03, Boston College,
Computer Science Department, June 1997.
|
|
[9]
|
D. Rémy and J. Vouillon, “Objective ML: An effective object-oriented
extension to ML,” Theory Pract. Object Syst., vol. 4, no. 1,
pp. 27--50, 1998.
|
|
[10]
|
J. Garrigue and D. Rémy, “Semi-explicit first-class polymorphism for
ML,” Inf. Comput., vol. 155, no. 1-2, pp. 134--169, 1999.
[ DOI ]
|
|
[11]
|
X. Leroy, “A modular module system,” J. Funct. Program., vol. 10,
no. 3, pp. 269--303, 2000.
|
|
[12]
|
J. Garrigue, “Labeled and optional arguments for Objective Caml,” in
JSSST Workshop on Programming and Programming Languages, Mar. 2001.
|
|
[13]
|
J. Garrigue, “Relaxing the value restriction,” in Functional and Logic
Programming, 7th International Symposium, FLOPS 2004, Nara, Japan, April
7-9, 2004, Proceedings (Y. Kameyama and P. J. Stuckey, eds.), vol. 2998 of
Lecture Notes in Computer Science, pp. 196--213, Springer, 2004.
[ DOI ]
|
|
[14]
|
F. Pottier and D. Rémy, “The essence of ML type inference,” in
Advanced Topics in Types and Programming Languages (B. C. Pierce, ed.),
ch. 10, pp. 389--489, MIT Press, 2005.
|
|
[15]
|
J. Garrigue, “Private row types: Abstracting the unnamed,” in
Programming Languages and Systems, 4th Asian Symposium, APLAS 2006, Sydney,
Australia, November 8-10, 2006, Proceedings (N. Kobayashi, ed.), vol. 4279
of Lecture Notes in Computer Science, pp. 44--60, Springer, 2006.
[ DOI ]
|
|
[16]
|
F. Pottier and Y. Régis-Gianas, “Stratified type inference for
generalized algebraic data types,” in Proceedings of the 33rd ACM
SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL
2006, Charleston, South Carolina, USA, January 11-13, 2006 (J. G. Morrisett
and S. L. P. Jones, eds.), pp. 232--244, ACM, 2006.
[ DOI ]
|
|
[17]
|
V. Balat, J. Vouillon, and B. Yakobowski, “Experience report: Ocsigen, a
Web programming framework,” in Proceeding of the 14th ACM SIGPLAN
international conference on Functional programming, ICFP 2009, Edinburgh,
Scotland, UK, August 31 - September 2, 2009 (G. Hutton and A. P. Tolmach,
eds.), pp. 311--316, ACM, 2009.
[ DOI ]
|
|
[18]
|
J. Garrigue and D. Rémy, “Ambivalent types for principal type inference
with GADTs,” in Programming Languages and Systems - 11th Asian
Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013.
Proceedings (C. Shan, ed.), vol. 8301 of Lecture Notes in Computer
Science, pp. 257--272, Springer, 2013.
[ DOI ]
|
|
[19]
|
J. Vouillon and V. Balat, “From bytecode to javascript: the js_of_ocaml
compiler,” Softw. Pract. Exp., vol. 44, no. 8, pp. 951--972, 2014.
[ DOI ]
|
|
[20]
|
J. Garrigue and J. Le Normand, “GADTs and exhaustiveness: Looking for the
impossible,” in Proceedings ML Family / OCaml Users and Developers
workshops, ML Family/OCaml 2015, Vancouver, Canada, 3rd & 4th September
2015 (J. Yallop and D. Doligez, eds.), vol. 241 of EPTCS,
pp. 23--35, 2015.
[ DOI ]
|
|
[21]
|
S. Dolan, K. C. Sivaramakrishnan, and A. Madhavapeddy, “Bounding data races in
space and time,” in Proceedings of the 39th ACM SIGPLAN Conference
on Programming Language Design and Implementation, PLDI 2018, Philadelphia,
PA, USA, June 18-22, 2018 (J. S. Foster and D. Grossman, eds.),
pp. 242--255, ACM, 2018.
[ DOI ]
|
|
[22]
|
F. Bour, T. Refis, and G. Scherer, “Merlin: a language server for OCaml
(experience report),” Proc. ACM Program. Lang., vol. 2, no. ICFP,
pp. 103:1--103:15, 2018.
[ DOI ]
|
|
[23]
|
K. C. Sivaramakrishnan, S. Dolan, L. White, S. Jaffer, T. Kelly, A. Sahoo,
S. Parimala, A. Dhiman, and A. Madhavapeddy, “Retrofitting parallelism onto
OCaml,” Proc. ACM Program. Lang., vol. 4, no. ICFP,
pp. 113:1--113:30, 2020.
[ DOI ]
|
|
[24]
|
K. C. Sivaramakrishnan, S. Dolan, L. White, T. Kelly, S. Jaffer, and
A. Madhavapeddy, “Retrofitting effect handlers onto OCaml,” in
PLDI '21: 42nd ACM SIGPLAN International Conference on Programming
Language Design and Implementation, Virtual Event, Canada, June 20-25, 20211
(S. N. Freund and E. Yahav, eds.), pp. 206--221, ACM, 2021.
[ DOI ]
|
|
[25]
|
A. Reynaud, G. Scherer, and J. Yallop, “A practical mode system for recursive
definitions,” Proc. ACM Program. Lang., vol. 5, no. POPL,
pp. 1--29, 2021.
[ DOI ]
|
|
[1]
|
X. Leroy and F. Rouaix, “Security properties of typed applets,” in
Secure Internet Programming, Security Issues for Mobile and Distributed
Objects (J. Vitek and C. D. Jensen, eds.), vol. 1603 of Lecture Notes
in Computer Science, pp. 147--182, Springer, 1999.
[ DOI ]
|
|
[2]
|
X. Leroy and F. Pessaux, “Type-based analysis of uncaught exceptions,”
ACM Trans. Program. Lang. Syst., vol. 22, no. 2, pp. 340--377, 2000.
[ DOI ]
|
|
[3]
|
C. Calcagno, W. Taha, L. Huang, and X. Leroy, “Implementing multi-stage
languages using ASTs, gensym, and reflection,” in Generative
Programming and Component Engineering, Second International Conference,
GPCE 2003, Erfurt, Germany, September 22-25, 2003, Proceedings
(F. Pfenning and Y. Smaragdakis, eds.), vol. 2830 of Lecture Notes in
Computer Science, pp. 57--76, Springer, 2003.
[ DOI ]
|
|
[4]
|
F. Pottier and V. Simonet, “Information flow inference for ML,” ACM
Trans. Program. Lang. Syst., vol. 25, no. 1, pp. 117--158, 2003.
[ DOI ]
|
|
[5]
|
A. Frisch, “OCaml + XDuce,” in Proceedings of the 11th ACM
SIGPLAN International Conference on Functional Programming, ICFP 2006,
Portland, Oregon, USA, September 16-21, 2006 (J. H. Reppy and J. L. Lawall,
eds.), pp. 192--200, ACM, 2006.
[ DOI ]
|
|
[6]
|
J. Yallop, “Practical generic programming in OCaml,” in Proceedings of
the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007 (C. V.
Russo and D. Dreyer, eds.), pp. 83--94, ACM, 2007.
[ DOI ]
|
|
[7]
|
M. Furr and J. S. Foster, “Checking type safety of foreign function calls,”
ACM Trans. Program. Lang. Syst., vol. 30, no. 4, pp. 18:1--18:63,
2008.
[ DOI ]
|
|
[8]
|
S. Owens, “A sound semantics for OCaml-light,” in Programming
Languages and Systems, 17th European Symposium on Programming, ESOP 2008,
Held as Part of the Joint European Conferences on Theory and Practice of
Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008.
Proceedings (S. Drossopoulou, ed.), vol. 4960 of Lecture Notes in
Computer Science, pp. 1--15, Springer, 2008.
[ DOI ]
|
|
[9]
|
P. Cuoq, J. Signoles, P. Baudin, R. Bonichon, G. Canet, L. Correnson,
B. Monate, V. Prevosto, and A. Puccetti, “Experience report: OCaml for an
industrial-strength static analysis framework,” in Proceeding of the
14th ACM SIGPLAN international conference on Functional programming,
ICFP 2009, Edinburgh, Scotland, UK, August 31 - September 2, 2009
(G. Hutton and A. P. Tolmach, eds.), pp. 281--286, ACM, 2009.
[ DOI ]
|
|
[10]
|
B. Montagu and D. Rémy, “Modeling abstract types in modules with open
existential types,” in Proceedings of the 36th ACM SIGPLAN-SIGACT
Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA,
USA, January 21-23, 2009 (Z. Shao and B. C. Pierce, eds.), pp. 354--365,
ACM, 2009.
[ DOI ]
|
|
[11]
|
H. Im, K. Nakata, J. Garrigue, and S. Park, “A syntactic type system for
recursive modules,” in Proceedings of the 26th Annual ACM SIGPLAN
Conference on Object-Oriented Programming, Systems, Languages, and
Applications, OOPSLA 2011, part of SPLASH 2011, Portland, OR, USA,
October 22 - 27, 2011 (C. V. Lopes and K. Fisher, eds.), pp. 993--1012,
ACM, 2011.
[ DOI ]
|
|
[12]
|
J. Garrigue and K. Nakata, “Path resolution for nested recursive modules,”
High. Order Symb. Comput., vol. 24, no. 3, pp. 207--237, 2011.
[ DOI ]
|
|
[13]
|
O. Kiselyov, “Delimited control in OCaml, abstractly and concretely,”
Theor. Comput. Sci., vol. 435, pp. 56--76, 2012.
[ DOI ]
|
|
[14]
|
M. Danelutto and R. D. Cosmo, “A "minimal disruption" skeleton experiment:
Seamless map & reduce embedding in OCaml,” in Proceedings of the
International Conference on Computational Science, ICCS 2012, Omaha,
Nebraska, USA, 4-6 June, 2012 (H. H. Ali, Y. Shi, D. Khazanchi, M. Lees,
G. D. van Albada, J. J. Dongarra, and P. M. A. Sloot, eds.), vol. 9 of
Procedia Computer Science, pp. 1837--1846, Elsevier, 2012.
[ DOI ]
|
|
[15]
|
M. Bourgoin, E. Chailloux, and J. L. Lamotte, “Spoc: GPGPU programming
through stream processing with OCaml,” Parallel Process. Lett.,
vol. 22, no. 2, 2012.
[ DOI ]
|
|
[16]
|
F. Pottier, “Hindley-Milner elaboration in applicative style: functional
pearl,” in Proceedings of the 19th ACM SIGPLAN international
conference on Functional programming, Gothenburg, Sweden, September 1-3,
2014 (J. Jeuring and M. M. T. Chakravarty, eds.), pp. 203--212, ACM, 2014.
[ DOI ]
|
|
[17]
|
O. Kiselyov, “The design and implementation of BER MetaOCaml - system
description,” in Functional and Logic Programming - 12th International
Symposium, FLOPS 2014, Kanazawa, Japan, June 4-6, 2014. Proceedings
(M. Codish and E. Sumii, eds.), vol. 8475 of Lecture Notes in Computer
Science, pp. 86--102, Springer, 2014.
[ DOI ]
|
|
[18]
|
B. Vaugon, P. Wang, and E. Chailloux, “Programming microcontrollers in
OCaml: The OCaPIC project,” in Practical Aspects of Declarative
Languages - 17th International Symposium, PADL 2015, Portland, OR, USA,
June 18-19, 2015. Proceedings (E. Pontelli and T. C. Son, eds.), vol. 9131
of Lecture Notes in Computer Science, pp. 132--148, Springer, 2015.
[ DOI ]
|
|
[19]
|
G. Radanne, J. Vouillon, and V. Balat, “Eliom: A core ML language for
tierless web programming,” in Programming Languages and Systems - 14th
Asian Symposium, APLAS 2016, Hanoi, Vietnam, November 21-23, 2016,
Proceedings (A. Igarashi, ed.), vol. 10017 of Lecture Notes in Computer
Science, pp. 377--397, 2016.
[ DOI ]
|
|
[20]
|
X. Clerc, “OCaml-Java: The Java virtual machine as the target of an
OCaml compiler,” J. Funct. Program., vol. 26, p. e7, 2016.
[ DOI ]
|
|
[21]
|
J. Hoffmann, A. Das, and S. Weng, “Towards automatic resource bound analysis
for OCaml,” in Proceedings of the 44th ACM SIGPLAN Symposium on
Principles of Programming Languages, POPL 2017, Paris, France, January
18-20, 2017 (G. Castagna and A. D. Gordon, eds.), pp. 359--373, ACM, 2017.
[ DOI ]
|
|
[22]
|
O. Kiselyov, “Reconciling abstraction with high performance: A MetaOCaml
approach,” Found. Trends Program. Lang., vol. 5, no. 1, pp. 1--101,
2018.
[ DOI ]
|
|
[23]
|
J. Yallop, D. Sheets, and A. Madhavapeddy, “A modular foreign function
interface,” Sci. Comput. Program., vol. 164, pp. 82--97, 2018.
[ DOI ]
|
|
[24]
|
K. Imai, N. Yoshida, and S. Yuen, “Session-OCaml: A session-based library
with polarities and lenses,” Sci. Comput. Program., vol. 172,
pp. 135--159, 2019.
[ DOI ]
|
|
[25]
|
F. Berenger, K. Y. J. Zhang, and Y. Yamanishi, “Chemoinformatics and
structural bioinformatics in OCaml,” J. Cheminformatics, vol. 11,
no. 1, pp. 10:1--10:13, 2019.
[ DOI ]
|
|
[26]
|
A. Charguéraud, J. Filliâtre, C. Lourenço, and M. Pereira,
“GOSPEL - providing OCaml with a formal specification language,” in
Formal Methods - The Next 30 Years - Third World Congress, FM 2019,
Porto, Portugal, October 7-11, 2019, Proceedings (M. H. ter Beek, A. McIver,
and J. N. Oliveira, eds.), vol. 11800 of Lecture Notes in Computer
Science, pp. 484--501, Springer, 2019.
[ DOI ]
|
|
[27]
|
N. Licker and T. M. Jones, “Duplo: a framework for OCaml post-link
optimisation,” Proc. ACM Program. Lang., vol. 4, no. ICFP,
pp. 98:1--98:29, 2020.
[ DOI ]
|
|
[28]
|
G. Mével, J. Jourdan, and F. Pottier, “Cosmo: a concurrent separation
logic for multicore OCaml,” Proc. ACM Program. Lang., vol. 4,
no. ICFP, pp. 96:1--96:29, 2020.
[ DOI ]
|
|
[29]
|
P. E. de Vilhena and F. Pottier, “A separation logic for effect handlers,”
Proc. ACM Program. Lang., vol. 5, no. POPL, pp. 1--28, 2021.
[ DOI ]
|
|
[30]
|
M. Pereira and A. Ravara, “Cameleer: A deductive verification tool for
OCaml,” in Computer Aided Verification - 33rd International Conference,
CAV 2021, Virtual Event, July 20-23, 2021, Proceedings, Part II
(A. Silva and K. R. M. Leino, eds.), vol. 12760 of Lecture Notes in
Computer Science, pp. 677--689, Springer, 2021.
[ DOI ]
|