default search action
BibTeX records: Matthieu Sozeau
@article{DBLP:journals/pacmpl/ForsterST24, author = {Yannick Forster and Matthieu Sozeau and Nicolas Tabareau}, title = {Verified Extraction from Coq to OCaml}, journal = {Proc. {ACM} Program. Lang.}, volume = {8}, number = {{PLDI}}, pages = {52--75}, year = {2024}, url = {https://doi.org/10.1145/3656379}, doi = {10.1145/3656379}, timestamp = {Fri, 02 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/ForsterST24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/TabareauTS21, author = {Nicolas Tabareau and {\'{E}}ric Tanter and Matthieu Sozeau}, title = {The Marriage of Univalence and Parametricity}, journal = {J. {ACM}}, volume = {68}, number = {1}, pages = {5:1--5:44}, year = {2021}, url = {https://doi.org/10.1145/3429979}, doi = {10.1145/3429979}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jacm/TabareauTS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/FinsterAS21, author = {Eric Finster and Antoine Allioux and Matthieu Sozeau}, title = {Types Are Internal {\(\infty\)}-Groupoids}, booktitle = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} 2021, Rome, Italy, June 29 - July 2, 2021}, pages = {1--13}, publisher = {{IEEE}}, year = {2021}, url = {https://doi.org/10.1109/LICS52264.2021.9470541}, doi = {10.1109/LICS52264.2021.9470541}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lics/FinsterAS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/corr/abs-2107-07670, author = {Matthieu Sozeau}, editor = {Elaine Pimentel and Enrico Tassi}, title = {Touring the MetaCoq Project (Invited Paper)}, booktitle = {Proceedings of the Sixteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, {LFMTP} 2021, Pittsburgh, USA, 16th July 2021}, series = {{EPTCS}}, volume = {337}, pages = {13--29}, year = {2021}, url = {https://doi.org/10.4204/EPTCS.337.2}, doi = {10.4204/EPTCS.337.2}, timestamp = {Mon, 26 Jun 2023 20:50:02 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-07670.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2105-00024, author = {Antoine Allioux and Eric Finster and Matthieu Sozeau}, title = {Types are Internal {\(\infty\)}-Groupoids}, journal = {CoRR}, volume = {abs/2105.00024}, year = {2021}, url = {https://arxiv.org/abs/2105.00024}, eprinttype = {arXiv}, eprint = {2105.00024}, timestamp = {Wed, 12 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2105-00024.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2108-10259, author = {Kenji Maillard and Nicolas Margulies and Matthieu Sozeau and Nicolas Tabareau and {\'{E}}ric Tanter}, title = {The Multiverse: Logical Modularity for Proof Assistants}, journal = {CoRR}, volume = {abs/2108.10259}, year = {2021}, url = {https://arxiv.org/abs/2108.10259}, eprinttype = {arXiv}, eprint = {2108.10259}, timestamp = {Fri, 27 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2108-10259.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jar/SozeauABCFKMTW20, author = {Matthieu Sozeau and Abhishek Anand and Simon Boulier and Cyril Cohen and Yannick Forster and Fabian Kunze and Gregory Malecha and Nicolas Tabareau and Th{\'{e}}o Winterhalter}, title = {The MetaCoq Project}, journal = {J. Autom. Reason.}, volume = {64}, number = {5}, pages = {947--999}, year = {2020}, url = {https://doi.org/10.1007/s10817-019-09540-0}, doi = {10.1007/S10817-019-09540-0}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jar/SozeauABCFKMTW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pacmpl/SozeauBFTW20, author = {Matthieu Sozeau and Simon Boulier and Yannick Forster and Nicolas Tabareau and Th{\'{e}}o Winterhalter}, title = {Coq Coq correct! verification of type checking and erasure for Coq, in Coq}, journal = {Proc. {ACM} Program. Lang.}, volume = {4}, number = {{POPL}}, pages = {8:1--8:28}, year = {2020}, url = {https://doi.org/10.1145/3371076}, doi = {10.1145/3371076}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/pacmpl/SozeauBFTW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pacmpl/SozeauM19, author = {Matthieu Sozeau and Cyprien Mangin}, title = {Equations reloaded: high-level dependently-typed functional programming and proving in Coq}, journal = {Proc. {ACM} Program. Lang.}, volume = {3}, number = {{ICFP}}, pages = {86:1--86:29}, year = {2019}, url = {https://doi.org/10.1145/3341690}, doi = {10.1145/3341690}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/SozeauM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pacmpl/GilbertCST19, author = {Ga{\"{e}}tan Gilbert and Jesper Cockx and Matthieu Sozeau and Nicolas Tabareau}, title = {Definitional proof-irrelevance without {K}}, journal = {Proc. {ACM} Program. Lang.}, volume = {3}, number = {{POPL}}, pages = {3:1--3:28}, year = {2019}, url = {https://doi.org/10.1145/3290316}, doi = {10.1145/3290316}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/GilbertCST19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpp/WinterhalterST19, author = {Th{\'{e}}o Winterhalter and Matthieu Sozeau and Nicolas Tabareau}, editor = {Assia Mahboubi and Magnus O. Myreen}, title = {Eliminating reflection from type theory}, booktitle = {Proceedings of the 8th {ACM} {SIGPLAN} International Conference on Certified Programs and Proofs, {CPP} 2019, Cascais, Portugal, January 14-15, 2019}, pages = {91--103}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293880.3294095}, doi = {10.1145/3293880.3294095}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cpp/WinterhalterST19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1909-05027, author = {Nicolas Tabareau and {\'{E}}ric Tanter and Matthieu Sozeau}, title = {The Marriage of Univalence and Parametricity}, journal = {CoRR}, volume = {abs/1909.05027}, year = {2019}, url = {http://arxiv.org/abs/1909.05027}, eprinttype = {arXiv}, eprint = {1909.05027}, timestamp = {Tue, 17 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1909-05027.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pacmpl/TabareauTS18, author = {Nicolas Tabareau and {\'{E}}ric Tanter and Matthieu Sozeau}, title = {Equivalences for free: univalent parametricity for effective transport}, journal = {Proc. {ACM} Program. Lang.}, volume = {2}, number = {{ICFP}}, pages = {92:1--92:29}, year = {2018}, url = {https://doi.org/10.1145/3236787}, doi = {10.1145/3236787}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pacmpl/TabareauTS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itp/AnandBCST18, author = {Abhishek Anand and Simon Boulier and Cyril Cohen and Matthieu Sozeau and Nicolas Tabareau}, editor = {Jeremy Avigad and Assia Mahboubi}, title = {Towards Certified Meta-Programming with Typed Template-Coq}, booktitle = {Interactive Theorem Proving - 9th International Conference, {ITP} 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10895}, pages = {20--39}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-319-94821-8\_2}, doi = {10.1007/978-3-319-94821-8\_2}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/itp/AnandBCST18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/rta/TimanyS18, author = {Amin Timany and Matthieu Sozeau}, editor = {H{\'{e}}l{\`{e}}ne Kirchner}, title = {Cumulative Inductive Types In Coq}, booktitle = {3rd International Conference on Formal Structures for Computation and Deduction, {FSCD} 2018, July 9-12, 2018, Oxford, {UK}}, series = {LIPIcs}, volume = {108}, pages = {29:1--29:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.FSCD.2018.29}, doi = {10.4230/LIPICS.FSCD.2018.29}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/rta/TimanyS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jfp/ZilianiS17, author = {Beta Ziliani and Matthieu Sozeau}, title = {A comprehensible guide to a new unifier for {CIC} including universe polymorphism and overloading}, journal = {J. Funct. Program.}, volume = {27}, pages = {e10}, year = {2017}, url = {https://doi.org/10.1017/S0956796817000028}, doi = {10.1017/S0956796817000028}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jfp/ZilianiS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpp/BauerGLSSS17, author = {Andrej Bauer and Jason Gross and Peter LeFanu Lumsdaine and Michael Shulman and Matthieu Sozeau and Bas Spitters}, editor = {Yves Bertot and Viktor Vafeiadis}, title = {The HoTT library: a formalization of homotopy type theory in Coq}, booktitle = {Proceedings of the 6th {ACM} {SIGPLAN} Conference on Certified Programs and Proofs, {CPP} 2017, Paris, France, January 16-17, 2017}, pages = {164--172}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3018610.3018615}, doi = {10.1145/3018610.3018615}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cpp/BauerGLSSS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1710-03912, author = {Amin Timany and Matthieu Sozeau}, title = {Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC)}, journal = {CoRR}, volume = {abs/1710.03912}, year = {2017}, url = {http://arxiv.org/abs/1710.03912}, eprinttype = {arXiv}, eprint = {1710.03912}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1710-03912.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mscs/BoveKS16, author = {Ana Bove and Alexander Krauss and Matthieu Sozeau}, title = {Partiality and recursion in interactive theorem provers - an overview}, journal = {Math. Struct. Comput. Sci.}, volume = {26}, number = {1}, pages = {38--88}, year = {2016}, url = {https://doi.org/10.1017/S0960129514000115}, doi = {10.1017/S0960129514000115}, timestamp = {Mon, 26 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mscs/BoveKS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/JaberLPST16, author = {Guilhem Jaber and Gabriel Lewertowski and Pierre{-}Marie P{\'{e}}drot and Matthieu Sozeau and Nicolas Tabareau}, editor = {Martin Grohe and Eric Koskinen and Natarajan Shankar}, title = {The Definitional Side of the Forcing}, booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS} '16, New York, NY, USA, July 5-8, 2016}, pages = {367--376}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2933575.2935320}, doi = {10.1145/2933575.2935320}, timestamp = {Wed, 11 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/lics/JaberLPST16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BauerGLSSS16, author = {Andrej Bauer and Jason Gross and Peter LeFanu Lumsdaine and Michael Shulman and Matthieu Sozeau and Bas Spitters}, title = {The HoTT Library: {A} formalization of homotopy type theory in Coq}, journal = {CoRR}, volume = {abs/1610.04591}, year = {2016}, url = {http://arxiv.org/abs/1610.04591}, eprinttype = {arXiv}, eprint = {1610.04591}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BauerGLSSS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icfp/ZilianiS15, author = {Beta Ziliani and Matthieu Sozeau}, editor = {Kathleen Fisher and John H. Reppy}, title = {A unification algorithm for Coq featuring universe polymorphism and overloading}, booktitle = {Proceedings of the 20th {ACM} {SIGPLAN} International Conference on Functional Programming, {ICFP} 2015, Vancouver, BC, Canada, September 1-3, 2015}, pages = {179--191}, publisher = {{ACM}}, year = {2015}, url = {https://doi.org/10.1145/2784731.2784751}, doi = {10.1145/2784731.2784751}, timestamp = {Wed, 23 Jun 2021 16:58:51 +0200}, biburl = {https://dblp.org/rec/conf/icfp/ZilianiS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/types/2014, editor = {Hugo Herbelin and Pierre Letouzey and Matthieu Sozeau}, title = {20th International Conference on Types for Proofs and Programs, {TYPES} 2014, May 12-15, 2014, Paris, France}, series = {LIPIcs}, volume = {39}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2015}, url = {http://www.dagstuhl.de/dagpub/978-3-939897-88-0}, isbn = {978-3-939897-88-0}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/types/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/ManginS15, author = {Cyprien Mangin and Matthieu Sozeau}, title = {Equations for Hereditary Substitution in Leivant's Predicative System {F:} {A} Case Study}, journal = {CoRR}, volume = {abs/1508.00455}, year = {2015}, url = {http://arxiv.org/abs/1508.00455}, eprinttype = {arXiv}, eprint = {1508.00455}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/ManginS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itp/SozeauT14, author = {Matthieu Sozeau and Nicolas Tabareau}, editor = {Gerwin Klein and Ruben Gamboa}, title = {Universe Polymorphism in Coq}, booktitle = {Interactive Theorem Proving - 5th International Conference, {ITP} 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8558}, pages = {499--514}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-08970-6\_32}, doi = {10.1007/978-3-319-08970-6\_32}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/itp/SozeauT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/unif/ZilianiS14, author = {Beta Ziliani and Matthieu Sozeau}, editor = {Temur Kutsia and Christophe Ringeissen}, title = {Towards a better-behaved unification algorithm for Coq}, booktitle = {Proceedings of the 28th International Workshop on Unification, {UNIF} 2014, Vienna, Austria, July 13, 2014}, pages = {74--87}, year = {2014}, url = {https://www3.risc.jku.at/publications/download/risc\_5001/proceedings-UNIF2014.pdf\#page=79}, timestamp = {Tue, 19 Sep 2023 15:35:06 +0200}, biburl = {https://dblp.org/rec/conf/unif/ZilianiS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/lics/JaberTS12, author = {Guilhem Jaber and Nicolas Tabareau and Matthieu Sozeau}, title = {Extending Type Theory with Forcing}, booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012}, pages = {395--404}, publisher = {{IEEE} Computer Society}, year = {2012}, url = {https://doi.org/10.1109/LICS.2012.49}, doi = {10.1109/LICS.2012.49}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/lics/JaberTS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itp/Sozeau10, author = {Matthieu Sozeau}, editor = {Matt Kaufmann and Lawrence C. Paulson}, title = {Equations: {A} Dependent Pattern-Matching Compiler}, booktitle = {Interactive Theorem Proving, First International Conference, {ITP} 2010, Edinburgh, UK, July 11-14, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6172}, pages = {419--434}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-14052-5\_29}, doi = {10.1007/978-3-642-14052-5\_29}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/itp/Sozeau10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jfrea/Sozeau09, author = {Matthieu Sozeau}, title = {A New Look at Generalized Rewriting in Type Theory}, journal = {J. Formaliz. Reason.}, volume = {2}, number = {1}, pages = {41--62}, year = {2009}, url = {https://doi.org/10.6092/issn.1972-5787/1574}, doi = {10.6092/ISSN.1972-5787/1574}, timestamp = {Thu, 24 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jfrea/Sozeau09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Matthieu08, author = {Matthieu Sozeau}, title = {Un environnement pour la programmation avec types d{\'{e}}pendants. (An environment for programming with dependent types)}, school = {University of Paris-Sud, Orsay, France}, year = {2008}, url = {https://tel.archives-ouvertes.fr/tel-00640052}, timestamp = {Tue, 21 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Matthieu08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tphol/SozeauO08, author = {Matthieu Sozeau and Nicolas Oury}, editor = {Otmane A{\"{\i}}t Mohamed and C{\'{e}}sar A. Mu{\~{n}}oz and Sofi{\`{e}}ne Tahar}, title = {First-Class Type Classes}, booktitle = {Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5170}, pages = {278--293}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-71067-7\_23}, doi = {10.1007/978-3-540-71067-7\_23}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/tphol/SozeauO08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icfp/Sozeau07, author = {Matthieu Sozeau}, editor = {Ralf Hinze and Norman Ramsey}, title = {Program-ing finger trees in Coq}, booktitle = {Proceedings of the 12th {ACM} {SIGPLAN} International Conference on Functional Programming, {ICFP} 2007, Freiburg, Germany, October 1-3, 2007}, pages = {13--24}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1291151.1291156}, doi = {10.1145/1291151.1291156}, timestamp = {Fri, 25 Jun 2021 14:48:54 +0200}, biburl = {https://dblp.org/rec/conf/icfp/Sozeau07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/types/Sozeau06, author = {Matthieu Sozeau}, editor = {Thorsten Altenkirch and Conor McBride}, title = {Subset Coercions in Coq}, booktitle = {Types for Proofs and Programs, International Workshop, {TYPES} 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {4502}, pages = {237--252}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/978-3-540-74464-1\_16}, doi = {10.1007/978-3-540-74464-1\_16}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/types/Sozeau06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.