default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicolas Tabareau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Mara Malewski, Kenji Maillard, Nicolas Tabareau, Éric Tanter:
Gradual Indexed Inductive Types. Proc. ACM Program. Lang. 8(ICFP): 544-572 (2024)- [j27]Yannick Forster
, Matthieu Sozeau, Nicolas Tabareau:
Verified Extraction from Coq to OCaml. Proc. ACM Program. Lang. 8(PLDI): 52-75 (2024) - [c32]Loïc Pujet, Nicolas Tabareau:
Observational Equality Meets CIC. ESOP (1) 2024: 275-301 - [c31]Yann Leray, Gaëtan Gilbert, Nicolas Tabareau, Théo Winterhalter:
The Rewster: Type Preserving Rewrite Rules for the Coq Proof Assistant. ITP 2024: 26:1-26:18 - 2023
- [j26]Loïc Pujet, Nicolas Tabareau:
Impredicative Observational Equality. Proc. ACM Program. Lang. 7(POPL): 2171-2196 (2023) - 2022
- [j25]Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter:
A reasonably gradual type theory. Proc. ACM Program. Lang. 6(ICFP): 931-959 (2022) - [j24]Loïc Pujet, Nicolas Tabareau:
Observational equality: now for good. Proc. ACM Program. Lang. 6(POPL): 1-27 (2022) - [j23]Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau, Éric Tanter:
Gradualizing the Calculus of Inductive Constructions. ACM Trans. Program. Lang. Syst. 44(2): 7:1-7:82 (2022) - [i8]Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau, Éric Tanter:
A Reasonably Gradual Type Theory. CoRR abs/2209.00975 (2022) - 2021
- [j22]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
The Marriage of Univalence and Parametricity. J. ACM 68(1): 5:1-5:44 (2021) - [j21]Simon Boulier, Nicolas Tabareau:
Model structure on the universe of all types in interval type theory. Math. Struct. Comput. Sci. 31(4): 392-423 (2021) - [j20]Jesper Cockx, Nicolas Tabareau, Théo Winterhalter:
The taming of the rew: a type theory with computational assumptions. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [i7]Kenji Maillard, Nicolas Margulies, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter:
The Multiverse: Logical Modularity for Proof Assistants. CoRR abs/2108.10259 (2021) - 2020
- [j19]Matthieu Sozeau, Abhishek Anand, Simon Boulier, Cyril Cohen, Yannick Forster, Fabian Kunze, Gregory Malecha, Nicolas Tabareau, Théo Winterhalter:
The MetaCoq Project. J. Autom. Reason. 64(5): 947-999 (2020) - [j18]Matthieu Sozeau, Simon Boulier, Yannick Forster, Nicolas Tabareau, Théo Winterhalter:
Coq Coq correct! verification of type checking and erasure for Coq, in Coq. Proc. ACM Program. Lang. 4(POPL): 8:1-8:28 (2020) - [j17]Pierre-Marie Pédrot, Nicolas Tabareau:
The fire triangle: how to mix substitution, dependent elimination, and effects. Proc. ACM Program. Lang. 4(POPL): 58:1-58:28 (2020) - [i6]Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau, Éric Tanter:
Gradualizing the Calculus of Inductive Constructions. CoRR abs/2011.10618 (2020)
2010 – 2019
- 2019
- [j16]Nicolas Tabareau, Éric Tanter:
Chemical foundations of distributed aspects. Distributed Comput. 32(3): 193-216 (2019) - [j15]Peter LeFanu Lumsdaine, Nicolas Tabareau:
Preface: Special Issue on Homotopy Type Theory and Univalent Foundations. J. Autom. Reason. 63(2): 157-158 (2019) - [j14]Pierre-Marie Pédrot, Nicolas Tabareau, Hans Jacob Fehrmann, Éric Tanter:
A reasonably exceptional type theory. Proc. ACM Program. Lang. 3(ICFP): 108:1-108:29 (2019) - [j13]Gaëtan Gilbert, Jesper Cockx, Matthieu Sozeau, Nicolas Tabareau:
Definitional proof-irrelevance without K. Proc. ACM Program. Lang. 3(POPL): 3:1-3:28 (2019) - [c30]Théo Winterhalter, Matthieu Sozeau, Nicolas Tabareau:
Eliminating reflection from type theory. CPP 2019: 91-103 - [c29]Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Nicolas Tabareau:
Setoid Type Theory - A Syntactic Translation. MPC 2019: 155-196 - [i5]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
The Marriage of Univalence and Parametricity. CoRR abs/1909.05027 (2019) - 2018
- [j12]Pierre-Évariste Dagand, Nicolas Tabareau, Éric Tanter:
Foundations of dependent interoperability. J. Funct. Program. 28: e9 (2018) - [j11]Paul-André Melliès, Nicolas Tabareau, Christine Tasson:
An explicit formula for the free exponential modality of linear logic. Math. Struct. Comput. Sci. 28(7): 1253-1286 (2018) - [j10]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
Equivalences for free: univalent parametricity for effective transport. Proc. ACM Program. Lang. 2(ICFP): 92:1-92:29 (2018) - [c28]Pierre-Marie Pédrot, Nicolas Tabareau:
Failure is Not an Option - An Exceptional Type Theory. ESOP 2018: 245-271 - [c27]Abhishek Anand, Simon Boulier, Cyril Cohen, Matthieu Sozeau, Nicolas Tabareau:
Towards Certified Meta-Programming with Typed Template-Coq. ITP 2018: 20-39 - 2017
- [c26]Simon Boulier, Pierre-Marie Pédrot, Nicolas Tabareau:
The next 700 syntactical models of type theory. CPP 2017: 182-194 - [c25]Pierre-Marie Pédrot, Nicolas Tabareau:
An effectful way to eliminate addiction to dependence. LICS 2017: 1-12 - 2016
- [j9]Kevin Quirin, Nicolas Tabareau:
Lawvere-Tierney sheafification in Homotopy Type Theory. J. Formaliz. Reason. 9(2): 131-161 (2016) - [j8]Ismael Figueroa, Nicolas Tabareau, Éric Tanter:
Effect capabilities for Haskell: Taming effect interference in monadic programming. Sci. Comput. Program. 119: 3-30 (2016) - [c24]Pierre-Évariste Dagand, Nicolas Tabareau, Éric Tanter:
Partial type equivalences for verified dependent interoperability. ICFP 2016: 298-310 - [c23]Guilhem Jaber, Gabriel Lewertowski, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau:
The Definitional Side of the Forcing. LICS 2016: 367-376 - 2015
- [c22]Guilhem Jaber, Nicolas Tabareau:
Kripke Open Bisimulation - A Marriage of Game Semantics and Operational Techniques. APLAS 2015: 271-291 - [c21]Éric Tanter, Nicolas Tabareau:
Gradual certified programming in Coq. DLS 2015: 26-40 - [c20]André Hirschowitz, Tom Hirschowitz, Nicolas Tabareau:
Wild omega-Categories for the Homotopy Hypothesis in Type Theory. TLCA 2015: 226-240 - [i4]Éric Tanter, Nicolas Tabareau:
Gradual Certified Programming in Coq. CoRR abs/1506.04205 (2015) - 2014
- [j7]Éric Tanter, Ismael Figueroa, Nicolas Tabareau:
Execution levels for aspect-oriented programming: Design, semantics, implementations and applications. Sci. Comput. Program. 80: 311-342 (2014) - [c19]Ismael Figueroa, Tom Schrijvers, Nicolas Tabareau, Éric Tanter:
Compositional reasoning about aspect interference. MODULARITY 2014: 133-144 - [c18]Nicolas Tabareau, Mario Südholt, Éric Tanter:
Aspectual session types. MODULARITY 2014: 193-204 - [c17]Matthieu Sozeau, Nicolas Tabareau:
Universe Polymorphism in Coq. ITP 2014: 499-514 - [c16]Rémi Douence, Nicolas Tabareau:
Lazier Imperative Programming. PPDP 2014: 7-18 - [c15]Ismael Figueroa, Nicolas Tabareau, Éric Tanter:
Effect Capabilities for Haskell. SBLP 2014: 92-108 - 2013
- [j6]Ismael Figueroa, Nicolas Tabareau, Éric Tanter:
Effective Aspects: A Typed Monadic Embedding of Pointcuts and Advice. LNCS Trans. Aspect Oriented Softw. Dev. 11: 145-192 (2013) - [c14]Nicolas Tabareau, Ismael Figueroa, Éric Tanter:
A typed monadic embedding of aspects. AOSD 2013: 171-184 - [c13]Ismael Figueroa, Nicolas Tabareau, Éric Tanter:
Taming aspects with monads and membranes. FOAL 2013: 1-6 - 2012
- [c12]Nicolas Tabareau:
A monadic interpretation of execution levels and exceptions for AOP. AOSD 2012: 71-82 - [c11]Éric Tanter, Nicolas Tabareau, Rémi Douence:
Taming aspects with membranes. FOAL 2012: 3-8 - [c10]Ismael Figueroa, Éric Tanter, Nicolas Tabareau:
A practical monadic aspect weaver. FOAL 2012: 21-26 - [c9]Guilhem Jaber, Nicolas Tabareau, Matthieu Sozeau:
Extending Type Theory with Forcing. LICS 2012: 395-404 - 2011
- [c8]Nicolas Tabareau:
Aspect oriented programming: a language for 2-categories. FOAL 2011: 13-17 - 2010
- [j5]Paul-André Melliès, Nicolas Tabareau:
Resource modalities in tensor logic. Ann. Pure Appl. Log. 161(5): 632-653 (2010) - [j4]Nicolas Tabareau, Jean-Jacques E. Slotine, Quang-Cuong Pham:
How Synchronization Protects from Noise. PLoS Comput. Biol. 6(1) (2010) - [c7]Nicolas Tabareau:
A theory of distributed aspects. AOSD 2010: 133-144
2000 – 2009
- 2009
- [j3]Quang-Cuong Pham, Nicolas Tabareau, Jean-Jacques E. Slotine:
A Contraction Theory Approach to Stochastic Incremental Stability. IEEE Trans. Autom. Control. 54(4): 816-820 (2009) - [c6]Paul-André Melliès, Nicolas Tabareau, Christine Tasson:
An Explicit Formula for the Free Exponential Modality of Linear Logic. ICALP (2) 2009: 247-260 - [c5]Nick Benton, Nicolas Tabareau:
Compiling functional types to relational specifications for low level imperative code. TLDI 2009: 3-14 - [c4]Paul-André Melliès, Nicolas Tabareau:
An Algebraic Account of References in Game Semantics. MFPS 2009: 377-405 - 2008
- [b1]Nicolas Tabareau:
Modalités de ressource et contrôle en logique tensorielle. (Resource modalities and control in tensorial logic). Paris Diderot University, France, 2008 - [j2]Benoît Girard, Nicolas Tabareau, Quang-Cuong Pham, Alain Berthoz, Jean-Jacques E. Slotine:
Where neuroscience and dynamic system theory meet autonomous robotics: A contracting basal ganglia model for action selection. Neural Networks 21(4): 628-641 (2008) - 2007
- [j1]Nicolas Tabareau, Daniel Bennequin, Alain Berthoz, Jean-Jacques E. Slotine, Benoît Girard:
Geometry of the superior colliculus mapping and efficient oculomotor computation. Biol. Cybern. 97(4): 279-292 (2007) - [c3]Paul-André Melliès, Nicolas Tabareau:
Resource modalities in game semantics. LICS 2007: 389-398 - [i3]Paul-André Melliès, Nicolas Tabareau:
Resource modalities in game semantics. CoRR abs/0705.0462 (2007) - 2006
- [c2]Luigi Manfredi, Eliseo Stefano Maini, Paolo Dario, Cecilia Laschi, Benoît Girard, Nicolas Tabareau, Alain Berthoz:
Implementation of a neurophysiological model of saccadic eye movements on an anthropomorphic robotic head. Humanoids 2006: 438-443 - [i2]Deepak D'Souza, Nicolas Tabareau:
On timed automata with input-determined guards. CoRR abs/cs/0601096 (2006) - [i1]Nicolas Tabareau:
De l'oprateur de trace dans les jeux de Conway. CoRR abs/math/0607462 (2006) - 2004
- [c1]Deepak D'Souza, Nicolas Tabareau:
On Timed Automata with Input-Determined Guards. FORMATS/FTRTFT 2004: 68-83
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-22 19:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
