Filtrer vos résultats
- 36
- 3
- 28
- 6
- 3
- 1
- 1
- 3
- 39
- 1
- 2
- 4
- 2
- 2
- 2
- 6
- 2
- 2
- 5
- 4
- 3
- 3
- 1
- 36
- 3
- 20
- 20
- 16
- 9
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 39
- 8
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
39 résultats
|
|
triés par
|
|
GADT meet subtypingACM SIGPLAN Workshop on ML, Aug 2012, Copenhague, Denmark
Communication dans un congrès
hal-01093940v1
|
||
|
Which simple types have a unique inhabitant?The 20th ACM SIGPLAN International Conference on Functional Programming (ICFP 2015), Aug 2015, Vancouver, Canada
Communication dans un congrès
hal-01235596v1
|
||
|
Debootstrapping without ArcheologyThe Art, Science, and Engineering of Programming, 2022, 6 (3), ⟨10.22152/programming-journal.org/2022/6/13⟩
Article dans une revue
hal-03917754v1
|
||
|
Merlin: a language server for OCaml (experience report)Proceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1 - 15. ⟨10.1145/3236798⟩
Article dans une revue
hal-01929161v1
|
||
Macaque : Interrogation sûre et flexible de base de données depuis OCamlVing et unième journées francophones des langages applicatifs, Jan 2010, La Ciotat, France
Communication dans un congrès
hal-00495977v1
|
|||
|
Multi-focusing on extensional rewriting with sumsTyped Lambda Calculi and Applications, Jun 2015, Warsaw, Poland
Communication dans un congrès
hal-01235372v1
|
||
|
Ambiguous pattern variablesOCaml 2016: The OCaml Users and Developers Workshop, Sep 2016, Nara, Japan. pp.2
Communication dans un congrès
hal-01413241v1
|
||
|
Normalization by realizability also evaluatesVingt-sixièmes Journées Francophones des Langages Applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France
Communication dans un congrès
hal-01099138v1
|
||
|
Tail Modulo ConsJFLA 2021 - Journées Francophones des Langages Applicatifs, Apr 2021, Saint Médard d’Excideuil, France
Communication dans un congrès
hal-03146495v1
|
||
|
GADT meet Subtyping[Research Report] RR-8114, INRIA. 2012, pp.33
Rapport
hal-00744292v1
|
||
|
Tracking Data-Flow with Open Closure Types[Research Report] RR-8345, INRIA. 2013, pp.24
Rapport
hal-00851658v1
|
||
|
Full reduction in the face of absurdity[Research Report] INRIA. 2014
Rapport
hal-01093910v1
|
||
|
Deciding unique inhabitants with sums (work in progress)TYPES, May 2014, Paris, France
Communication dans un congrès
hal-01094127v1
|
||
|
Well-typed generic smart-fuzzing for APIsML'14 - ACM SIGPLAN ML Family Workshop, Aug 2014, Göteborg, Sweden
Communication dans un congrès
hal-01094006v1
|
||
|
Quantified Applicatives: API design for type-inference constraintsML Family Workshop, Aug 2020, Jersey City / Online, United States
Communication dans un congrès
hal-03145040v1
|
||
Full reduction in the face of absurdityESOP'2015: European Conference on Programming Languages and Systems, Apr 2015, London, United Kingdom
Communication dans un congrès
hal-01095390v1
|
|||
|
Capturing the Future by Replaying the Past Functional PearlProceedings of the ACM on Programming Languages, 2018, 2 (ICFP), pp.1 - 29. ⟨10.1145/3236771⟩
Article dans une revue
hal-01929178v1
|
||
|
GADTs meet subtypingESOP 2013 - 22nd European Symposium on Programming, Mar 2013, Rome, Italy. pp.554-573, ⟨10.1007/978-3-642-37036-6⟩
Communication dans un congrès
hal-00772993v2
|
||
|
An OCaml use case for strong call-by-need reductionACM SIGPLAN Workshop on ML 2022 - ML Family Workshop, Benoit Montagu, Sep 2022, Ljubljana, Slovenia
Communication dans un congrès
hal-03947986v1
|
||
|
Boxroot, fast movable GC roots for a better FFIML Family Workshop, Benoît Montagu, Sep 2022, Ljubljana, Slovenia
Communication dans un congrès
hal-03910313v1
|
||
|
Génération aléatoire de programmes guidée par la vivacitéJFLA 2018 - Journées Francophones des Langages Applicatifs, Jan 2018, Banyuls-sur-Mer, France
Communication dans un congrès
hal-01682691v1
|
||
|
Unboxing Mutually Recursive Type Definitions in OCamlJFLA 2019 - 30 èmes journées francophones des langages applicatifs, Jan 2019, Les Rousses, France
Communication dans un congrès
hal-01929508v1
|
||
|
2-or-more approximation for intuitionistic logic2014
Pré-publication, Document de travail
hal-01094120v1
|
||
|
FabULous Interoperability for ML and a Linear LanguageInternational Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Apr 2018, Thessaloniki, Greece. ⟨10.1007/978-3-319-89366-2_8⟩
Communication dans un congrès
hal-01929158v1
|
||
A preview of a tutorial on L (polarized μμ-tilde)HOPE 2018 - 7th ACM SIGPLAN Workshop on Higher-Order Programming with Effects, Sep 2018, St. Louis, United States
Communication dans un congrès
hal-01992294v1
|
|||
|
Correct tout seul, sûr à plusieursJFLA 2024 – 35es Journ´ees Francophones des Langages Applicatifs, Jan 2024, Saint-Jacut-de-la-Mer, France
Communication dans un congrès
hal-04406412v1
|
||
|
Coqlex: Generating Formally Verified LexersThe Art, Science, and Engineering of Programming, 2023, 8 (1), ⟨10.22152/programming-journal.org/2024/8/3⟩
Article dans une revue
hal-03912170v2
|
||
|
Polarised Intermediate Representation of Lambda Calculus with SumsThirtieth Annual ACM/IEEE Symposium on Logic In Computer Science (LICS 2015), Jul 2015, Kyoto, Japan. ⟨10.1109/LICS.2015.22⟩
Communication dans un congrès
hal-01160579v2
|
||
|
Translation validation of a pattern-matching compilerML Family Workshop, Aug 2020, New Jersey /Online, United States
Communication dans un congrès
hal-03145030v1
|
||
|
A practical mode system for recursive definitionsProceedings of the ACM on Programming Languages, 2021, 5 (POPL), pp.1-29. ⟨10.1145/3434326⟩
Article dans une revue
hal-03125031v1
|
- 1
- 2