Filter your results
- 36
- 5
- 21
- 11
- 5
- 2
- 1
- 1
- 4
- 1
- 41
- 5
- 4
- 2
- 3
- 5
- 2
- 3
- 2
- 2
- 3
- 1
- 1
- 2
- 2
- 2
- 1
- 1
- 39
- 1
- 1
- 21
- 20
- 8
- 8
- 8
- 4
- 3
- 1
- 1
- 1
- 41
- 9
- 6
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
41 Results
|
|
sorted by
|
|
A unified treatment of syntax with bindersJournal of Functional Programming, 2012, 22 (4--5), pp.614--704. ⟨10.1017/S0956796812000251⟩
Journal articles
hal-00772721v1
|
||
Stratified type inference for generalized algebraic data typesPOPL'06 - Proceedings of the 33rd ACM Symposium on Principles of Programming Languages, Jan 2006, Charleston, South Carolina, United States. pp.232--244
Conference papers
inria-00629091v1
|
|||
|
Visitors unchainedProceedings of the ACM on Programming Languages, 2017, 1 (ICFP), pp.1 - 28. ⟨10.1145/3110272⟩
Journal articles
hal-01670735v1
|
||
|
Validating LR(1) ParsersESOP 2012 - Programming Languages and Systems - 21st European Symposium on Programming, Mar 2012, Tallinn, Estonia. pp.397-416, ⟨10.1007/978-3-642-28869-2_20⟩
Conference papers
hal-01077321v1
|
||
|
The ins and outs of iteration in Mezzo2013
Preprints, Working Papers, ...
hal-00912381v1
|
||
|
Spy Game: Verifying a Local Generic Solver in IrisProceedings of the ACM on Programming Languages, 2020, 4 (POPL), ⟨10.1145/3371101⟩
Journal articles
hal-02351562v1
|
||
Towards efficient, typed LR parsers.ACM Workshop on ML, Mar 2006, Portland, Oregon, United States
Conference papers
inria-00629090v1
|
|||
|
A step-indexed Kripke Model of Hidden StateMathematical Structures in Computer Science, 2013, 23 (1), pp.1--54
Journal articles
hal-00772757v1
|
||
|
Time Credits and Time Receipts in IrisEuropean Symposium on Programming, Apr 2019, Prague, Czech Republic. pp.3-29, ⟨10.1007/978-3-030-17184-1_1⟩
Conference papers
hal-02183311v1
|
||
|
A Semi-Syntactic Soundness Proof for HM(X)[Research Report] RR-4150, INRIA. 2001
Reports
inria-00072475v1
|
||
|
A typed store-passing translation for general referencesPOPL 2011: 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Jan 2011, Austin, United States. ⟨10.1145/1925844.1926403⟩
Conference papers
hal-01081187v1
|
||
|
Type Soundness and Race Freedom for MezzoFLOPS 2014: 12th International Symposium on Functional and Logic Programming, Jun 2014, Kanazawa, Japan. pp.253 - 269, ⟨10.1007/978-3-319-07151-0_16⟩
Conference papers
hal-01081194v1
|
||
|
A High-Level Separation Logic for Heap Space under Garbage Collection (Extended Version)Inria. 2022
Reports
hal-03823056v2
|
||
|
A Separation Logic for Effect HandlersProceedings of the ACM on Programming Languages, 2021, 5 (POPL), ⟨10.1145/3434314⟩
Journal articles
hal-03049514v1
|
||
|
JOIN(X): Constraint-Based Type Inference for the Join-CalculusProceedings of the 10th European Symposium on Programming (ESOP'01), Apr 2001, Genova, pp.221--236
Conference papers
inria-00000029v1
|
||
|
Programming with permissions: the Mezzo languageACM SIGPLAN Workshop on ML, Sep 2012, Copenhagen, Denmark
Conference papers
hal-01092204v1
|
||
|
The Design and Formalization of Mezzo, a Permission-Based Programming LanguageACM Transactions on Programming Languages and Systems (TOPLAS), 2016, 38 (4), pp.94. ⟨10.1145/2837022⟩
Journal articles
hal-01246534v1
|
||
|
A Separation Logic for Heap Space under Garbage CollectionProceedings of the ACM on Programming Languages, 2022, ⟨10.1145/3498672⟩
Journal articles
hal-03478162v1
|
||
|
Formal Proof and Analysis of an Incremental Cycle Detection AlgorithmInteractive Theorem Proving, Sep 2019, Portland, United States
Conference papers
hal-02167236v1
|
||
|
A few lessons from the Mezzo projectSummit oN Advances in Programming Languages (SNAPL), May 2015, Asilomar, United States. ⟨10.4230/LIPIcs.SNAPL.2015.221⟩
Conference papers
hal-01246360v1
|
||
|
Depth-First Search and Strong Connectivity in CoqVingt-sixièmes journées francophones des langages applicatifs (JFLA 2015), Jan 2015, Le Val d'Ajol, France
Conference papers
hal-01096354v1
|
||
|
A High-Level Separation Logic for Heap Space under Garbage CollectionProceedings of the ACM on Programming Languages, In press, POPL, 7, ⟨10.1145/3571218⟩
Journal articles
hal-03852060v1
|
||
|
Specification and Verification of a Transient Stack (Artifact)Software hal-03473197v1 |
||
|
Cosmo: A Concurrent Separation Logic for Multicore OCamlProceedings of the ACM on Programming Languages, 2020, 4 (ICFP), ⟨10.1145/3408978⟩
Journal articles
hal-02929998v1
|
||
|
Specification and Verification of a Transient StackCPP 2022 - 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2022, Philadelphia, United States. ⟨10.1145/3497775.3503677⟩
Conference papers
hal-03472028v1
|
||
|
Implémentation d'un système de modules évolué en Caml-Light[Rapport de recherche] RR-2449, INRIA. 1995
Reports
inria-00074226v1
|
||
|
Hindley-Milner Elaboration in Applicative StyleICFP 2014: 19th ACM SIGPLAN International Conference on Functional Programming, Sep 2014, Goteborg, Sweden. ⟨10.1145/2628136.2628145⟩
Conference papers
hal-01081233v1
|
||
|
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation6th International Conference on Interactive Theorem Proving (ITP), Aug 2015, Nanjing, China. ⟨10.1007/978-3-319-22102-1_9⟩
Conference papers
hal-01245872v1
|
||
|
A Hoare Logic for Call-by-Value Functional ProgramsMPC 08 - Proceedings of the Ninth International Conference on Mathematics of Program Construction, Jul 2008, Marseille, France. pp.305--335, ⟨10.1007/978-3-540-70594-9_17⟩
Conference papers
inria-00629092v1
|
||
|
Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time CreditsJournal of Automated Reasoning, 2019, 62 (3), pp.331--365. ⟨10.1007/s10817-017-9431-7⟩
Journal articles
hal-01652785v1
|
- 1
- 2