Andreas Abel

Universitetslektor vid Chalmers, Data- och informationsteknik, Datavetenskap

Visar 17 publikationer

2018

Decidability of Conversion for Type Theory in Type Theory

Andrea Vezzosi, Joakim Öhman, Andreas Abel
Proceedings of the ACM on Programming Languages. Vol. 2 (POPL), p. 23:1-23:29
Artikel i vetenskaplig tidskrift
2017

Normalization by evaluation for sized dependent types

Andreas Abel, Andrea Vezzosi, Theo Winterhalter
Proceedings of the ACM on Programming Languages. Vol. 1 (ICFP), p. 33:1--33:3-
Paper i proceeding
2016

Well-founded recursion with copatterns and sized types

Andreas Abel, B. Pientka
Journal of Functional Programming. Vol. 26
Artikel i vetenskaplig tidskrift
2014

A formalized proof of strong normalization for guarded recursive types

Andreas Abel, Andrea Vezzosi
Lecture Notes in Computer Science. Vol. 8858, p. 140-158
Paper i proceeding
2014

Unnesting of copatterns

A. Setzer, Andreas Abel, B. Pientka et al
Kapitel i bok
2013

Wellfounded recursion with copatterns: a unified approach to termination and productivity

Andreas Abel, Brigitte Pientka
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP
Paper i proceeding
2008

On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory

Andreas Abel, Thierry Coquand, Peter Dybjer
FLOPS 2008, p. 3-13
Paper i proceeding
2008

Verifying a semantic βη-conversion test for martin-löf type theory

Andreas Abel, Thierry Coquand, Peter Dybjer
Lecture Notes in Computer Science, p. 29-56
Paper i proceeding
2007

Normalization by evaluation for Martin-Löf type theory with one universe

Andreas Abel, Klaus Aehlig, Peter Dybjer
Mathematical Foundations of Programming Semantics, New Orleans, LA, USA, April 2007. Ed. M. Fiore. Electronic Notes in Theoretical Computer Science, Elsevier.. Vol. 173, p. 17-40
Paper i proceeding
2007

Untyped algorithmic equality for Martin-Löf's logical framework with surjective pairs

Andreas Abel, Thierry Coquand
Fundamenta Informaticae. Vol. 77 (4), p. 345-395
Artikel i vetenskaplig tidskrift
2007

Normalization by Evaluation for Martin-Löf Type Theory with Equality Judgements

Andreas Abel, Thierry Coquand, Peter Dybjer
Proceedings of 22nd IEEE Annual Symposium on Logic in ComputerScience, Wroclaw, Poland, July 2007., p. 3-12
Artikel i vetenskaplig tidskrift
2005

Connecting a Logical Framework to a First-Order Logic Prover.

Thierry Coquand, Andreas Abel, Ulf Norell
FroCos 2005, p. 285-301
Paper i proceeding
2005

Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs.

Thierry Coquand, Andreas Abel
Proceedings of the 7th International Conference on Typed Lambda Calculi and Applications (TLCA 2005); in: LECTURE NOTES IN COMPUTER SCIENCE , Volume: 3461), p. 23-38
Paper i proceeding
2005

Iteration and coiteration schemes for higher-order and nested datatypes

Andreas Abel, R. Matthes, T. Uustalu
Theoretical Computer Science. Vol. 333 (1-2), p. 3-66
Artikel i vetenskaplig tidskrift
2005

Verifying Haskell Programs Using Constructive Type Theory

Andreas Abel, Marcin Benke, Ana Bove et al
Proceedings of the 2005 ACM SIGPLAN Workshop on Haskell
Paper i proceeding
2004

Termination checking with types

Andreas Abel
RAIRO - Theoretical Informatics and Applications. Vol. 38 (4), p. 277-319
Artikel i vetenskaplig tidskrift
2004

Fixed Points of Type Constructors and Primitive Recursion

Andreas Abel, Ralph Matthes
Lecture Notes in Computer Science. Vol. 3210, p. 190-204
Artikel i vetenskaplig tidskrift

Spara referenser

Om du har installerat Zotero eller Mendeley på din dator kan du direkt ta ut referenser från de publikationer du ser i listan.

Du laddar ner dessa pluginer här:
Zotero
Mendeley

Det finns inga projekt att visa.
Det kan finnas fler projekt där Andreas Abel medverkar, men du måste vara inloggad som anställd på Chalmers för att kunna se dem.