François Pottier
From MaRDI portal
Person:670698
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Verifying an Effect-Handler-Based Define-By-Run Reverse-Mode AD Library Logical Methods in Computer Science | 2024-01-16 | Paper |
| Time credits and time receipts in Iris Programming Languages and Systems | 2023-11-24 | Paper |
| A type system for effect handlers and dynamic labels | 2023-11-24 | Paper |
| scientific article; zbMATH DE number 7649967 (Why is no real title available?) | 2023-02-03 | Paper |
| A framework for type inference with subtyping Proceedings of the third ACM SIGPLAN international conference on Functional programming | 2019-09-26 | Paper |
| A fistful of dollars: formalizing asymptotic complexity claims via deductive program verification | 2019-09-13 | Paper |
| Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits Journal of Automated Reasoning | 2019-03-20 | Paper |
| Stratified type inference for generalized algebraic data types Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2017-08-21 | Paper |
| A framework for type inference with subtyping Proceedings of the third ACM SIGPLAN international conference on Functional programming | 2017-08-21 | Paper |
| Temporary read-only permissions for separation logic Programming Languages and Systems | 2017-05-19 | Paper |
| Hindley-Milner elaboration in applicative style (functional pearl) Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
| Simplifying subtyping constraints Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 | 2016-09-01 | Paper |
| Polymorphic typed defunctionalization Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-11-11 | Paper |
| Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation Interactive Theorem Proving | 2015-09-14 | Paper |
| Information flow inference for free Proceedings of the fifth ACM SIGPLAN international conference on Functional programming | 2015-09-11 | Paper |
| Information flow inference for ML Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
| Functional translation of a calculus of capabilities Proceedings of the 13th ACM SIGPLAN international conference on Functional programming | 2015-03-16 | Paper |
| Numbering matters Proceedings of the ninth ACM SIGPLAN international conference on Functional programming | 2015-03-09 | Paper |
| A fresh look at programming with names and binders Proceedings of the 15th ACM SIGPLAN international conference on Functional programming | 2015-03-05 | Paper |
| Type soundness and race freedom for Mezzo Functional and Logic Programming | 2014-07-24 | Paper |
| A typed store-passing translation for general references Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
| Syntactic soundness proof of a type-and-capability system with hidden state Journal of Functional Programming | 2013-03-28 | Paper |
| A step-indexed Kripke model of hidden state Mathematical Structures in Computer Science | 2013-03-14 | Paper |
| A unified treatment of syntax with binders Journal of Functional Programming | 2012-10-29 | Paper |
| Validating LR(1) Parsers Programming Languages and Systems | 2012-06-22 | Paper |
| A semantic foundation for hidden state Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
| A Hoare Logic for Call-by-Value Functional Programs Lecture Notes in Computer Science | 2008-08-28 | Paper |
| Polymorphic typed defunctionalization and concretization Higher-Order and Symbolic Computation | 2006-11-17 | Paper |
| Typed Lambda Calculi and Applications Lecture Notes in Computer Science | 2005-11-11 | Paper |
| Producing all ideals of a forest, functionally Journal of Functional Programming | 2004-03-29 | Paper |
| Simplifying subtyping constraints: a theory Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1693037 (Why is no real title available?) | 2002-01-22 | Paper |
| scientific article; zbMATH DE number 1692942 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1629946 (Why is no real title available?) | 2001-11-04 | Paper |
| A versatile constraint-based type inference system Nordic Journal of Computing | 2001-05-06 | Paper |
Research outcomes over time
This page was built for person: François Pottier
