Skip Ribbon Commands

Skip to main content

Start

Staff

Andreas Abel

Senior Lecturer, Logic and Types division, Department of Computer Science and Engineering.

andreas.abel@cse.gu.se +46 31 772 17 31 Find me http://orcid.org/0000-0003-0420-4492

Link to personal page

Publications

Latest publications

2018
Decidability of Conversion for Type Theory in Type Theory

Author: Andrea Vezzosi; Joakim Öhman; Andreas Abel

Published: 2018

Published in:

Publication type: Journal article
2017
Normalization by evaluation for sized dependent types

Author: Andreas Abel; Andrea Vezzosi; Theo Winterhalter

Published: 2017

Published in:

Publication type: Paper in proceedings
2016
Well-founded recursion with copatterns and sized types

Author: Andreas Abel; B. Pientka

Published: 2016

Published in: Journal of Functional Programming

Publication type: Journal article
2014
Unnesting of copatterns

Author: A. Setzer; Andreas Abel; B. Pientka; D. Thibodeau

Published: 2014

Published in:

Publication type: Book chapter
A formalized proof of strong normalization for guarded recursive types

Author: Andreas Abel; Andrea Vezzosi

Published: 2014

Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Publication type: Paper in proceedings
2013
Wellfounded recursion with copatterns: a unified approach to termination and productivity

Author: Andreas Abel; Brigitte Pientka

Published: 2013

Published in:

Publication type: Paper in proceedings
2008
Verifying a semantic βη-conversion test for martin-löf type theory

Author: Andreas Abel; Thierry Coquand; Peter Dybjer

Published: 2008

Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Publication type: Paper in proceedings
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory

Author: Andreas Abel; Thierry Coquand; Peter Dybjer

Published: 2008

Published in:

Publication type: Paper in proceedings
2007
Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs

Author: Andreas Abel; Thierry Coquand

Published: 2007

Published in: Fundamenta Informaticae

Publication type: Journal article
Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements

Author: Andreas Abel; Thierry Coquand; Peter Dybjer

Published: 2007

Published in:

Publication type: Journal article
Normalization by evaluation for Martin-Löf type theory with one universe

Author: Andreas Abel; Klaus Aehlig; Peter Dybjer

Published: 2007

Published in:

Publication type: Paper in proceedings
2005
Verifying Haskell Programs Using Constructive Type Theory

Author: Andreas Abel; Marcin Benke; Ana Bove; John Hughes; Ulf Norell

Published: 2005

Published in:

Publication type: Paper in proceedings
Connecting a Logical Framework to a First-Order Logic Prover.

Author: Thierry Coquand; Andreas Abel; Ulf Norell

Published: 2005

Published in:

Publication type: Paper in proceedings
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs.

Author: Thierry Coquand; Andreas Abel

Published: 2005

Published in:

Publication type: Paper in proceedings
Iteration and coiteration schemes for higher-order and nested datatypes

Author: Andreas Abel; R. Matthes; T. Uustalu

Published: 2005

Published in: Theoretical Computer Science

Publication type: Journal article
2004
Termination checking with types

Author: Andreas Abel

Published: 2004

Published in: RAIRO - Theoretical Informatics and Applications

Publication type: Journal article
Fixed Points of Type Constructors and Primitive Recursion

Author: Andreas Abel; Ralph Matthes

Published: 2004

Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Publication type: Journal article

Go to Chalmers publication library

Published: Sun 25 Aug 2013. Modified: Mon 26 Nov 2018