Andreas Abel

Göteborgs universitet

H-index: 28

Europe-Sweden

About Andreas Abel

Andreas Abel, With an exceptional h-index of 28 and a recent h-index of 18 (since 2020), a distinguished researcher at Göteborgs universitet, specializes in the field of Type Theory, Functional Programming, Verification, Termination.

His recent articles reflect a diverse array of research interests and contributions to the field:

Equivalence of Applicative Functors and Multifunctors

A graded modal dependent type theory with a universe and erasure, formalized

Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda

An Agda Formalisation of Modalities and Erasure in a Dependently Typed Language

On model-theoretic strong normalization for truth-table natural deduction

Cubical Agda: A dependently typed programming language with univalence and higher inductive types

A unified view of modalities in type systems

Failure of normalization in impredicative type theory with proof-irrelevant propositional equality

Andreas Abel Information

University	Göteborgs universitet
Position	Senior Lecturer at the Department of Computer Science and Engineering
Citations(all)	2495
Citations(since 2020)	1036
Cited By	1906
hIndex(all)	28
hIndex(since 2020)	18
i10Index(all)	61
i10Index(since 2020)	31
Email	Access Email
University Profile Page	Göteborgs universitet
Google Scholar	View Google Scholar Profile

Andreas Abel Skills & Research Interests

Type Theory

Functional Programming

Verification

Termination

Top articles of Andreas Abel

Title	Journal	Author(s)	Publication Date
Equivalence of Applicative Functors and Multifunctors	arXiv preprint arXiv:2401.14286	Andreas Abel	2024/1/25
A graded modal dependent type theory with a universe and erasure, formalized	Proceedings of the ACM on Programming Languages	Andreas Abel Nils Anders Danielsson Oskar Eriksson	2023/8/30
Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda	arXiv preprint arXiv:2111.07936	Andreas Abel	2021/11/15
An Agda Formalisation of Modalities and Erasure in a Dependently Typed Language		Oskar Eriksson	2021
On model-theoretic strong normalization for truth-table natural deduction		Andreas Abel	2021
Cubical Agda: A dependently typed programming language with univalence and higher inductive types	Journal of Functional Programming	Andrea Vezzosi Anders Mörtberg Andreas Abel	2021/1
A unified view of modalities in type systems	Proceedings of the ACM on Programming Languages	Andreas Abel Jean-Philippe Bernardy	2020/8/2
Failure of normalization in impredicative type theory with proof-irrelevant propositional equality	Logical Methods in Computer Science	Andreas Abel Thierry Coquand	2020/6/30
Type-preserving compilation via dependently typed syntax in Agda	Abstract of a talk at TYPES, available online at http://www. cse. chalmers. se/~ abela/types20. pdf, slides available online at http://www. cse. chalmers. se/~ abela/talkTYPES2020. pdf	Andreas Abel Massa Marittima	2020/1/16
A Unified View of Modalities in Type Systems (Extended Version)		Andreas Abel JEAN-PHILIPPE BERNARDY	2020
Leibniz equality is isomorphic to Martin-Löf identity, parametrically	Journal of Functional Programming	Andreas Abel Jesper Cockx Dominique Devriese Amin Timany Philip Wadler	2020/1
Elaborating dependent (co) pattern matching: No pattern left behind	Journal of Functional Programming	Jesper Cockx Andreas Abel	2020/1