default search action
Anders Mörtberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c16]Maximilian Doré, Evan Cavallo, Anders Mörtberg:
Automating Boundary Filling in Cubical Agda. FSCD 2024: 22:1-22:18 - [i11]Axel Ljungström, Anders Mörtberg:
Computational Synthetic Cohomology Theory in Homotopy Type Theory. CoRR abs/2401.16336 (2024) - [i10]Daniel Gratzer, Håkon Robbestad Gylterud, Anders Mörtberg, Elisabeth Stenholm:
The Category of Iterative Sets in Homotopy Type Theory and Univalent Foundations. CoRR abs/2402.04893 (2024) - [i9]Maximilian Doré, Evan Cavallo, Anders Mörtberg:
Automating Boundary Filling in Cubical Agda. CoRR abs/2402.12169 (2024) - 2023
- [c15]Thomas Lamiaux
, Axel Ljungström, Anders Mörtberg:
Computing Cohomology Rings in Cubical Agda. CPP 2023: 239-252 - [c14]Axel Ljungström, Anders Mörtberg:
Formalizing π4(S3) ≅Z/2Z and Computing a Brunerie Number in Cubical Agda. LICS 2023: 1-13 - [i8]Axel Ljungström, Anders Mörtberg:
Formalizing π4(S^3) ≅ ℤ/2ℤ and Computing a Brunerie Number in Cubical Agda. CoRR abs/2302.00151 (2023) - 2022
- [c13]Benedikt Ahrens
Implementing a category-theoretic framework for typed abstract syntax. CPP 2022: 307-323 - [c12]Guillaume Brunerie, Axel Ljungström, Anders Mörtberg:
Synthetic Integral Cohomology in Cubical Agda. CSL 2022: 11:1-11:19 - [c11]Max Zeuner
A Univalent Formalization of Constructive Affine Schemes. TYPES 2022: 14:1-14:24 - [i7]Thomas Lamiaux, Axel Ljungström, Anders Mörtberg:
Computing Cohomology Rings in Cubical Agda. CoRR abs/2212.04182 (2022) - 2021
- [j11]Andrea Vezzosi
Cubical Agda: A dependently typed programming language with univalence and higher inductive types. J. Funct. Program. 31: e8 (2021) - [j10]Benedikt Ahrens
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations. Math. Struct. Comput. Sci. 31(1): 1-2 (2021) - [j9]Benedikt Ahrens
Preface to the MSCS Issue 31.1 (2021) Homotopy Type Theory and Univalent Foundations - Part II. Math. Struct. Comput. Sci. 31(4): 361-362 (2021) - [j8]Anders Mörtberg
Cubical methods in homotopy type theory and univalent foundations. Math. Struct. Comput. Sci. 31(10): 1147-1184 (2021) - [j7]Carlo Angiuli
Internalizing representation independence with univalence. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [i6]Benedikt Ahrens, Ralph Matthes
Implementing a Category-Theoretic Framework for Typed Abstract Syntax. CoRR abs/2112.06984 (2021) - 2020
- [c10]Anders Mörtberg, Loïc Pujet:
Cubical synthetic homotopy theory. CPP 2020: 158-171 - [c9]Evan Cavallo
Unifying Cubical Models of Univalent Type Theory. CSL 2020: 14:1-14:17 - [i5]Carlo Angiuli, Evan Cavallo, Anders Mörtberg, Max Zeuner:
Internalizing Representation Independence with Univalence. CoRR abs/2009.05547 (2020)
2010 – 2019
- 2019
- [j6]Benedikt Ahrens
From Signatures to Monads in UniMath. J. Autom. Reason. 63(2): 285-318 (2019) - [j5]Andrea Vezzosi
Cubical agda: a dependently typed programming language with univalence and higher inductive types. Proc. ACM Program. Lang. 3(ICFP): 87:1-87:29 (2019) - 2018
- [c8]Thierry Coquand, Simon Huber, Anders Mörtberg:
On Higher Inductive Types in Cubical Type Theory. LICS 2018: 255-264 - [i4]Thierry Coquand, Simon Huber, Anders Mörtberg:
On Higher Inductive Types in Cubical Type Theory. CoRR abs/1802.01170 (2018) - 2017
- [j4]Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg:
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom. FLAP 4(10): 3127-3170 (2017) - 2016
- [j3]Guillaume Cano, Cyril Cohen
Formalized linear algebra over Elementary Divisor Rings in Coq. Log. Methods Comput. Sci. 12(2) (2016) - [c7]Benedikt Ahrens
Some Wellfounded Trees in UniMath - Extended Abstract. ICMS 2016: 9-17 - [i3]Cyril Cohen, Thierry Coquand, Simon Huber, Anders Mörtberg:
Cubical Type Theory: a constructive interpretation of the univalence axiom. CoRR abs/1611.02108 (2016) - [i2]Benedikt Ahrens, Ralph Matthes, Anders Mörtberg:
From signatures to monads in UniMath. CoRR abs/1612.00693 (2016) - 2015
- [c6]Cyril Cohen
Cubical Type Theory: A Constructive Interpretation of the Univalence Axiom. TYPES 2015: 5:1-5:34 - 2014
- [c5]Cyril Cohen, Anders Mörtberg:
A Coq Formalization of Finitely Presented Modules. ITP 2014: 193-208 - 2013
- [j2]Jónathan Heras
Computing persistent homology within Coq/SSReflect. ACM Trans. Comput. Log. 14(4): 26:1-26:16 (2013) - [c4]Cyril Cohen, Maxime Dénès, Anders Mörtberg:
Refinements for Free! CPP 2013: 147-162 - 2012
- [j1]Thierry Coquand, Anders Mörtberg, Vincent Siles:
A formal proof of Sasaki-Murao algorithm. J. Formaliz. Reason. 5(1): 27-36 (2012) - [c3]Thierry Coquand, Anders Mörtberg, Vincent Siles:
Coherent and Strongly Discrete Rings in Type Theory. CPP 2012: 273-288 - [c2]Jónathan Heras
Towards a Certified Computation of Homology Groups for Digital Images. CTIC 2012: 49-57 - [c1]Maxime Dénès, Anders Mörtberg, Vincent Siles:
A Refinement-Based Approach to Computational Algebra in Coq. ITP 2012: 83-98 - [i1]Jónathan Heras, Thierry Coquand, Anders Mörtberg, Vincent Siles:
Computing Persistent Homology within Coq/SSReflect. CoRR abs/1209.1905 (2012)
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-07-12 20:13 CEST 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: