Nicolas Tabareau
Présentation
Publications
Publications
|
|
Bounded Sort Polymorphism with Elimination ConstraintsProceedings of the ACM on Programming Languages, 2026, 10, ⟨10.1145/3776732⟩ |
|
|
All Your Base Are Belong to UsProceedings of the ACM on Programming Languages, 2025, 9, pp.1-34. ⟨10.1145/3704912⟩ |
|
|
Observational Equality Meets CICACM Transactions on Programming Languages and Systems (TOPLAS), 2025, 47 (2), pp.1-35. ⟨10.1145/3719342⟩ |
|
|
Robust Dynamic Embedding for Gradual Typing *Proceedings of the ACM on Programming Languages, 2025, 9 (ICFP), pp.1-26. ⟨10.1145/3747507⟩ |
|
|
Correct and Complete Type Checking and Certified Erasure for Coq, in CoqJournal of the ACM (JACM), 2024, pp.1-76. ⟨10.1145/3706056⟩ |
|
|
Gradual Indexed Inductive TypesProceedings of the ACM on Programming Languages, 2024, 8 (ICFP), pp.544-572. ⟨10.1145/3674644⟩ |
|
|
Verified Extraction from Coq to OCamlProceedings of the ACM on Programming Languages, 2024, 8 (PLDI), pp.52-75. ⟨10.1145/3656379⟩ |
|
|
Impredicative Observational EqualityProceedings of the ACM on Programming Languages, 2023, Proceedings of the ACM on programming languages, 7 (POPL), pp.74. ⟨10.1145/3571739⟩ |
|
|
Gradualizing the Calculus of Inductive ConstructionsACM Transactions on Programming Languages and Systems (TOPLAS), 2022, ⟨10.1145/3495528⟩ |
|
|
A Reasonably Gradual Type TheoryProceedings of the ACM on Programming Languages, In press, ⟨10.1145/3547655⟩ |
|
|
Observational Equality: Now For GoodProceedings of the ACM on Programming Languages, 2022, 6 (POPL), pp.1-29. ⟨10.1145/3498693⟩ |
|
|
The Taming of the Rew: A Type Theory with Computational AssumptionsProceedings of the ACM on Programming Languages, 2021, POPL 2021, ⟨10.1145/3434341⟩ |
|
|
The Marriage of Univalence and ParametricityJournal of the ACM (JACM), 2021, 68 (1), pp.1-44. ⟨10.1145/3429979⟩ |
|
|
The Fire TriangleProceedings of the ACM on Programming Languages, 2020, pp.1-28. ⟨10.1145/3371126⟩ |
|
|
Model structure on the universe of all types in interval type theoryMathematical Structures in Computer Science, 2020, pp.1-32. ⟨10.1017/S0960129520000213⟩ |
|
|
Coq Coq Correct! Verification of Type Checking and Erasure for Coq, in CoqProceedings of the ACM on Programming Languages, 2020, pp.1-28. ⟨10.1145/3371076⟩ |
|
|
The MetaCoq ProjectJournal of Automated Reasoning, 2020, ⟨10.1007/s10817-019-09540-0⟩ |
|
|
Chemical foundations of distributed aspectsDistributed Computing, 2019, 32 (3), pp.193-216. ⟨10.1007/s00446-018-0334-6⟩ |
|
|
Definitional Proof-Irrelevance without KProceedings of the ACM on Programming Languages, 2019, POPL'19, pp.1-28. ⟨10.1145/3290316⟩ |
|
|
A Reasonably Exceptional Type TheoryProceedings of the ACM on Programming Languages, 2019, Issue ICFP, 3, pp.1-29. ⟨10.1145/3341712⟩ |
|
|
Equivalences for FreeProceedings of the ACM on Programming Languages, 2018, ICFP'18, 2 (ICFP), pp.1-29. ⟨10.1145/3234615⟩ |
|
|
An explicit formula for the free exponential modality of linear logicMathematical Structures in Computer Science, 2018, 28 (7), pp.1253-1286. ⟨10.1017/S0960129516000426⟩ |
|
|
Preface: Special Issue on Homotopy Type Theory and Univalent FoundationsJournal of Automated Reasoning, 2018, ⟨10.1007/s10817-018-9491-3⟩ |
|
|
Foundations of Dependent InteroperabilityJournal of Functional Programming, 2018, 28, ⟨10.1017/S0956796818000011⟩ |
|
|
Effect capabilities for Haskell: Taming effect interference in monadic programmingScience of Computer Programming, 2016, 119, pp.3-30. ⟨10.1016/j.scico.2015.11.010⟩ |
|
|
Lawvere-Tierney sheafification in Homotopy Type TheoryJournal of Formalized Reasoning, 2016, 9 (2), ⟨10.6092/issn.1972-5787/6232⟩ |
|
|
Execution Levels for Aspect-Oriented Programming: Design, Semantics, Implementations and ApplicationsScience of Computer Programming, 2014, 80 (1), pp.311-342. ⟨10.1016/j.scico.2013.09.002⟩ |
|
|
Effective Aspects: A Typed Monadic Embedding of Pointcuts and AdviceLNCS Transactions on Aspect-Oriented Software Development, 2014 |
|
|
Resource modalities in tensor logicAnnals of Pure and Applied Logic, 2010, 161 (5), pp.632-653. ⟨10.1016/j.apal.2009.07.018⟩ |
|
|
How synchronization protects from noise.PLoS Computational Biology, 2010, 6 (1), pp.e1000637. ⟨10.1371/journal.pcbi.1000637⟩ |
|
|
A contraction theory approach to stochastic incremental stabilityIEEE Transactions on Automatic Control, 2009, 54 (4), pp.816--820. ⟨10.1109/TAC.2008.2009619⟩ |
|
|
Geometry of the superior colliculus mapping and efficient oculomotor computationBiological Cybernetics (Modeling), 2007, 97 (4), pp.279-292. ⟨10.1007/s00422-007-0172-2⟩ |
|
|
Babel-formal: Translation of Proofs between Lean and RocqThe 5th Workshop on Mathematical Reasoning and AI at NeurIPS 2025, Dec 2025, San Diego, United States |
|
|
Incremental Certified ProgrammingOOPSLA 2025 - ACM Conference on Object Oriented Programming Systems Languages and Applications, Oct 2025, Singapore, Singapore. pp.1-28, ⟨10.1145/3763068⟩ |
|
|
Observational Equality Meets CICESOP 2024 - 33rd European Symposium on Programming, Apr 2024, Luxembourg, Luxembourg. pp.275-301, ⟨10.1007/978-3-031-57262-3_12⟩ |
|
|
The Rewster: Type Preserving Rewrite Rules for the Coq Proof AssistantInternational Conference on Interactive Theorem Proving (ITP 2024), Yves Bertot; Temur Kutsia; Michael Norrish, Sep 2024, Tbilisi, Georgia. pp.18, ⟨10.4230/LIPIcs.ITP.2024.26⟩ |
|
|
The Rewster: The Coq Proof Assistant with Rewrite RulesTYPES 2023 - 29th International Conference on Types for Proofs and Programs, Jun 2023, Valencia, Spain. pp.1-3 |
|
|
From Lost to the River: Embracing Sort ProliferationTYPES 2023 - 29th International Conference on Types for Proofs and Programs, Jun 2023, Valencia, Spain. pp.1-2 |
|
|
Setoid type theory - a syntactic translationMPC 2019 - 13th International Conference on Mathematics of Program Construction, Oct 2019, Porto, Portugal. pp.155-196, ⟨10.1007/978-3-030-33636-3_7⟩ |
|
|
Eliminating Reflection from Type TheoryCPP 2019 - 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2019, Lisbonne, Portugal. pp.91-103, ⟨10.1145/3293880.3294095⟩ |
|
|
Towards Certified Meta-Programming with Typed Template-CoqITP 2018 - 9th Conference on Interactive Theorem Proving, Jul 2018, Oxford, United Kingdom. pp.20-39, ⟨10.1007/978-3-319-94821-8_2⟩ |
|
|
Failure is Not an Option An Exceptional Type TheoryESOP 2018 - 27th European Symposium on Programming, Apr 2018, Thessaloniki, Greece. pp.245-271, ⟨10.1007/978-3-319-89884-1_9⟩ |
|
|
An explicit formula for the free exponential modality of linear logicICALP 2009 : 36th International Colloquium on Automata, Languages, and Programming, Jul 2009, Rhodes, Greece. pp.247-260, ⟨10.1007/978-3-642-02930-1_21⟩ |
|
|
Typed Template Coq -- Certified Meta-Programming in CoqCoqPL 2018 - The Fourth International Workshop on Coq for Programming Languages, Jan 2018, Los Angeles, CA, United States. pp.1-2 |
|
|
The next 700 syntactical models of type theoryCertified Programs and Proofs (CPP 2017), Jan 2017, Paris, France. pp.182 - 194, ⟨10.1145/3018610.3018620⟩ |
|
|
An Effectful Way to Eliminate Addiction to DependenceLogic in Computer Science (LICS), 2017 32nd Annual ACM/IEEE Symposium on, Jun 2017, Reykjavik, Iceland. pp.12, ⟨10.1109/LICS.2017.8005113⟩ |
|
|
Modèles de la théorie des types donnés par traduction de programme28ièmes Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France |
|
|
Partial Type Equivalences for Verified Dependent InteroperabilityICFP 2016 - 21st ACM SIGPLAN International Conference on Functional Programming, Sep 2016, Nara, Japan. pp.298-310, ⟨10.1145/2951913.2951933⟩ |
|
|
The Definitional Side of the ForcingLogics in Computer Science, May 2016, New York, United States. ⟨10.1145/http://dx.doi.org/10.1145/2933575.2935320⟩ |
Wild omega-Categories for the Homotopy Hypothesis in Type TheoryTyped Lambda Calculi and Applications, 2015, Varsovie, Poland. pp.226-240, ⟨10.4230/LIPIcs.TLCA.2015.226⟩ |
|
|
|
Gradual Certified Programming in Coq11th ACM Dynamic Languages Symposium (DLS 2015), Oct 2015, Pittsburgh, United States. ⟨10.1145/2816707.2816710⟩ |
Compositional Reasoning About Aspect Interference13th International Conference on Modularity (Modularity'14), Apr 2014, Lugano, Switzerland |
|
|
|
Aspectual Session TypesModularity - 13th International Conference on Modularity, Apr 2014, Lugano, Switzerland. ⟨10.1145/2577080.2577085⟩ |
Lazier Imperative ProgrammingPrinciples and Practice of Declarative Programming (PPDP), Sep 2014, Canterbury, United Kingdom |
|
|
|
Effect Capabilities For HaskellBrazilian Symposium on Programming Languages (SBLP), Sep 2014, Maceio, Brazil |
Universe Polymorphism in CoqInteractive Theorem Proving, Jul 2014, Vienna, Austria |
|
|
|
Anti-Unification with Type ClassesJournées Francophones des Langages Applicatifs (JFLA), Feb 2013, Aussois, France |
|
|
Taming aspects with monads and membranesFOAL'13: Foundations of aspect-oriented languages, Mar 2013, Fukuoka, Japan. ⟨10.1145/2451598.2451600⟩ |
|
|
A Typed Monadic Embedding of Aspects12th annual international conference on Aspect-Oriented Software Development (Modularity-AOSD'13), Mar 2013, Fukuoka, Japan |
|
|
Extending Type Theory with ForcingLICS 2012 : Logic In Computer Science, Jun 2012, Dubrovnik, Croatia. pp.0-0 |
|
|
A Practical Monadic Aspect WeaverFoundations of Aspect-Oriented Languages, Mar 2012, Potsdam, Germany |
|
|
Taming Aspects with MembranesFoundations of Aspect-Oriented Languages, Mar 2012, Potsdam, Germany |
|
|
A Monadic Interpretation of Execution Levels and Exceptions for AOPModularity: AOSD'12, Mar 2012, Postdam, Germany |
|
|
The Journey of Biorthogonal Logical Relations to the Realm of Assembly CodeWorkshop LOLA 2011, Syntax and Semantics of Low Level Languages, Jun 2011, Toronto, Canada |
Aspect oriented programming: a language for 2-categoriesProceedings of the 10th international workshop on Foundations of aspect-oriented languages, Mar 2011, Porto de Galinhas, Brazil. pp.13--17, ⟨10.1145/1960510.1960514⟩ |
|
|
|
Krivine realizability for compiler correctnessWorkshop LOLA 2010, Syntax and Semantics of Low Level Languages, Jul 2010, Edinburgh, United Kingdom |
|
|
A theory of distributed aspects9th International Conference on Aspect-Oriented Software Development (AOSD '10), Mar 2010, Rennes, Saint-Malo, France. pp.133--144, ⟨10.1145/1739230.1739246⟩ |
|
|
An explicit formula for the free exponential modality of linear logic36th International Colloquium on Automata, Languages and Programming, Jul 2009, Rhodes, Greece. pp.247-260, ⟨10.1007/978-3-642-02930-1⟩ |
|
|
An algebraic account of references in game semanticsMathematical Foundations of Programming Semantics, Apr 2009, Oxford, United Kingdom. pp.377-405 |
|
|
Compiling Functional Types to Relational Specifications for Low Level Imperative CodeTypes in Language Design and Implementation, Jan 2009, Savannah, United States |
|
|
Implementation of a neurophysiological model of saccadic eye movements on an anthropomorphic robotic head6th IEEE-RAS International Conference on Humanoid Robots, Dec 2006, Gênes, Italy. pp.438-443, ⟨10.1109/ICHR.2006.321309⟩ |
|
|
Selective amplification using a contracting model of the basal gangliaNeuroComp 2006, 2006, Pont A Mousson, France. pp.30-33 |
|
|
Contracting model of the basal gangliaModeling Natural Action Selection, 2005, Edinburgh, United Kingdom. pp.69-76 |
|
|
On timed automata with input-determined guardsFormal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Sep 2004, France. pp.68-83, ⟨10.1007/b100824⟩ |
Forcing in Coq2012 |
|
|
Lazier Imperative Programming[Research Report] RR-8569, INRIA. 2014 |
|
|
Contraction analysis of nonlinear random dynamical systems[Research Report] RR-8368, INRIA. 2013, pp.17 |
|
|
Exploring Membranes for Controlling Aspects[Research Report] RR-7739, INRIA. 2011, pp.33 |
|
|
Aspect Oriented Programming: a language for 2-categories[Research Report] RR-7527, INRIA. 2011, pp.30 |
|
|
Modalités de ressource et contrôle en logique tensorielleMathématiques [math]. Université Paris-Diderot - Paris VII, 2008. Français. ⟨NNT : ⟩ |
|
|
Managing Logical and Computational Complexity using Program TransformationsCategory Theory [math.CT]. université de nantes, 2016 |