Benedikt Ahrens

Dr.

20152023

Research activity per year

Filter
Conference contribution

Search results

  • 2022

    Implementing a category-theoretic framework for typed abstract syntax

    Ahrens, B., Matthes, R. & Mörtberg, A., 17 Jan 2022, CPP '22: Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs. Popescu, A. & Zdancewic, S. (eds.). Association for Computing Machinery (ACM), p. 307-323 17 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    30 Downloads (Pure)
  • Semantics for two-dimensional type theory

    Ahrens, B., North, P. R. & Van Der Weide, N., 4 Aug 2022, LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery (ACM), (LICS: Logic in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • 2020

    A Higher Structure Identity Principle

    Ahrens, B., Randall North, P., Shulman, M. & Tsementzis, D., 11 Apr 2020, (Accepted/In press) 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020). IEEE Computer Society Press, 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2019

    Bicategories in univalent foundations

    Ahrens, B., Frumin, D., Maggesi, M. & van der Weide, N., 1 Jun 2019, 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019). Geuvers, H. (ed.). Schloss Dagstuhl, p. 5:1-5:17 17 p. 5. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 131).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    2 Citations (Scopus)
    76 Downloads (Pure)
  • Modular specification of monads through higher-order presentations

    Ahrens, B., Hirschowitz, A., Lafont, A. & Maggesi, M., 1 Jun 2019, 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019). Geuvers, H. (ed.). Schloss Dagstuhl, p. 6:1-6:19 19 p. 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 131).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    2 Citations (Scopus)
    50 Downloads (Pure)
  • 2018

    Heterogeneous substitution systems revisited

    Ahrens, B. & Matthes, R., 16 Feb 2018, 21st International Conference on Types and Proofs and Programs - TYPES 2015 - Postproceedings. Uustalu, T. (ed.). Schloss Dagstuhl, Vol. 69. p. 2:1 - 2:23 23 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 69).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    1 Citation (Scopus)
    51 Downloads (Pure)
  • High-level signatures and initial semantics

    Ahrens, B., Hirschowitz, A., Lafont, A. & Maggesi, M., 21 Aug 2018, 27th EACSL Annual Conference on Computer Science Logic 2018 (CSL 2018). Ghica, D. R. & Jung, A. (eds.). Schloss Dagstuhl, p. 4:1 - 4:22 22 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 119).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    2 Citations (Scopus)
    58 Downloads (Pure)
  • 2017

    Categorical structures for type theory in univalent foundations

    Ahrens, B., Lumsdaine, P. L. & Voevodsky, V., 1 Aug 2017, 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Goranko, V. & Dam, M. (eds.). Schloss Dagstuhl, Vol. 82. p. 8:1–8:16 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 82).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    2 Citations (Scopus)
    40 Downloads (Pure)
  • Displayed Categories

    Ahrens, B. & Lumsdaine, P. L., 3 Sept 2017, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017). Miller, D. (ed.). Schloss Dagstuhl, Vol. 84. p. 5:1–5:16 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 84).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
    3 Citations (Scopus)
    67 Downloads (Pure)
  • 2016

    Some wellfounded trees in UniMath

    Ahrens, B. & Mörtberg, A., 6 Jul 2016, Mathematical Software - ICMS 2016 : 5th International Conference, Berlin, Germany, July 11-14, 2016, Proceedings. Greuel, G-M., Koch, T., Paule, P. & Sommese, A. (eds.). Springer Verlag, Vol. 9725. p. 9-17 (Lecture Notes in Computer Science ; vol. 9725).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)
  • 2015

    Non-wellfounded trees in homotopy type theory

    Ahrens, B., Capriotti, P. & Spadotti, R., 1 Jul 2015, 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015). Altenkirch, T. (ed.). Schloss Dagstuhl, Vol. 38. p. 17-30 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 38).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    4 Citations (Scopus)
  • Terminal Semantics for Codata Types in Intensional Martin-Löf Type Theory

    Ahrens, B. & Spadotti, R., 1 Oct 2015, 20th International Conference on Types for Proofs and Programs (TYPES 2014). Herbelin, H., Letouzey, P. & Sozeau, M. (eds.). Schloss Dagstuhl, Vol. 39. p. 1-26 (Leibniz International Proceedings in Informatics (LIPIcs); vol. 39).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access