default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Abel 0001
Person information
- affiliation: Chalmers University, Sweden
- affiliation: Gothenburg University, Sweden
- affiliation: LMU München
Other persons with the same name
- Andreas Abel 0002 — Saarland University, Germany
- Andreas Abel 0003 — Münster, Germany
- Andreas Abel 0004 — IRI GmbH, Dresden, Germany
- Andreas Abel 0005 — Technical University Dresden, Faculty of Electrical Engineering, Germany
- Andreas Abel 0006 — Goggle
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i9]Andreas Abel:
Equivalence of Applicative Functors and Multifunctors. CoRR abs/2401.14286 (2024)- [i8]Andreas Abel:
foetus - Termination Checker for Simple Functional Programs. CoRR abs/2407.06924 (2024) - 2023
- [j23]Andreas Abel
, Nils Anders Danielsson, Oskar Eriksson:
A Graded Modal Dependent Type Theory with a Universe and Erasure, Formalized. Proc. ACM Program. Lang. 7(ICFP): 920-954 (2023) - 2021
- [j22]Andrea Vezzosi, Anders Mörtberg, Andreas Abel:
Cubical Agda: A dependently typed programming language with univalence and higher inductive types. J. Funct. Program. 31: e8 (2021) - [i7]Andreas Abel:
Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda. CoRR abs/2111.07936 (2021) - 2020
- [j21]Andreas Abel, Jesper Cockx, Dominique Devriese, Amin Timany, Philip Wadler:
Leibniz equality is isomorphic to Martin-Löf identity, parametrically. J. Funct. Program. 30: e17 (2020) - [j20]Jesper Cockx, Andreas Abel:
Elaborating dependent (co)pattern matching: No pattern left behind. J. Funct. Program. 30: e2 (2020) - [j19]Andreas Abel, Thierry Coquand:
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality. Log. Methods Comput. Sci. 16(2) (2020) - [j18]Andreas Abel, Jean-Philippe Bernardy:
A unified view of modalities in type systems. Proc. ACM Program. Lang. 4(ICFP): 90:1-90:28 (2020) - [c49]Andreas Abel:
On Model-Theoretic Strong Normalization for Truth-Table Natural Deduction. TYPES 2020: 1:1-1:21
2010 – 2019
- 2019
- [j17]Andreas Abel, Guillaume Allais, Aliya Hameer, Brigitte Pientka, Alberto Momigliano, Steven Schäfer, Kathrin Stark:
POPLMark reloaded: Mechanizing proofs by logical relations. J. Funct. Program. 29: e19 (2019) - [j16]Andrea Vezzosi, Anders Mörtberg, Andreas Abel:
Cubical agda: a dependently typed programming language with univalence and higher inductive types. Proc. ACM Program. Lang. 3(ICFP): 87:1-87:29 (2019) - [c48]Brigitte Pientka, David Thibodeau, Andreas Abel, Francisco Ferreira, Rébecca Zucchini:
A Type Theory for Defining Logics and Proofs. LICS 2019: 1-13 - [c47]Andreas Abel, Christian Sattler:
Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus. PPDP 2019: 3:1-3:12 - [i6]Brigitte Pientka, Andreas Abel, Francisco Ferreira, David Thibodeau, Rébecca Zucchini:
Cocon: Computation in Contextual Type Theory. CoRR abs/1901.03378 (2019) - [i5]Andreas Abel, Christian Sattler:
Normalization by Evaluation for Call-by-Push-Value and Polarized Lambda-Calculus. CoRR abs/1902.06097 (2019) - [i4]Brigitte Pientka, David Thibodeau, Andreas Abel, Francisco Ferreira, Rébecca Zucchini:
A Type Theory for Defining Logics and Proofs. CoRR abs/1905.02617 (2019) - [i3]Andreas Abel, Thierry Coquand:
Failure of Normalization in Impredicative Type Theory with Proof-Irrelevant Propositional Equality. CoRR abs/1911.08174 (2019) - 2018
- [j15]Jesper Cockx, Andreas Abel:
Elaborating dependent (co)pattern matching. Proc. ACM Program. Lang. 2(ICFP): 75:1-75:30 (2018) - [j14]Andreas Abel, Joakim Öhman, Andrea Vezzosi:
Decidability of conversion for type theory in type theory. Proc. ACM Program. Lang. 2(POPL): 23:1-23:29 (2018) - [e3]Andreas Abel, Fredrik Nordvall Forsberg, Ambrus Kaposi:
23rd International Conference on Types for Proofs and Programs, TYPES 2017, May 29-June 1, 2017, Budapest, Hungary. LIPIcs 104, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-071-2 [contents] - 2017
- [j13]Andreas Abel, Stephan Adelsberger, Anton Setzer:
Interactive programming in Agda - Objects and graphical user interfaces. J. Funct. Program. 27: e8 (2017) - [j12]Andreas Abel, Andrea Vezzosi, Théo Winterhalter:
Normalization by evaluation for sized dependent types. Proc. ACM Program. Lang. 1(ICFP): 33:1-33:30 (2017) - 2016
- [j11]Andreas Abel, Brigitte Pientka:
Well-founded recursion with copatterns and sized types. J. Funct. Program. 26: e2 (2016) - [c46]Andreas Abel:
Compositional Coinduction with Sized Types. CMCS 2016: 5-10 - [i2]Francesco Mazzoli, Andreas Abel:
Type checking through unification. CoRR abs/1609.09709 (2016) - 2015
- [c45]Brigitte Pientka, Andreas Abel:
Well-Founded Recursion over Contextual Objects. TLCA 2015: 273-287 - 2014
- [c44]Andreas Abel, Andrea Vezzosi:
A Formalized Proof of Strong Normalization for Guarded Recursive Types. APLAS 2014: 140-158 - [c43]Anton Setzer, Andreas Abel, Brigitte Pientka, David Thibodeau:
Unnesting of Copatterns. RTA-TLCA 2014: 31-45 - [c42]Andreas Abel:
Programming and Reasoning with Infinite Structures Using Copatterns and Sized Types. Software Engineering (Workshops) 2014: 148-150 - [c41]Andrea Vezzosi, Andreas Abel:
A Categorical Perspective on Pattern Unification (Extended Abstract). UNIF 2014: 69-73 - [c40]Andreas Abel, James Chapman:
Normalization by Evaluation in the Delay Monad: A Case Study for Coinduction via Copatterns and Sized Types. MSFP 2014: 51-67 - 2013
- [c39]Andreas Abel, Brigitte Pientka:
Wellfounded recursion with copatterns: a unified approach to termination and productivity. ICFP 2013: 185-196 - [c38]Andreas Abel, Brigitte Pientka, David Thibodeau, Anton Setzer:
Copatterns: programming infinite structures by observations. POPL 2013: 27-38 - [e2]Matthew Might, David Van Horn, Andreas Abel, Tim Sheard:
Proceedings of the 7th Workshop on Programming languages meets program verification, PLPV 2013, Rome, Italy, January 22, 2013. ACM 2013, ISBN 978-1-4503-1860-0 [contents] - 2012
- [j10]Andreas Abel, Gabriel Scherer:
On Irrelevance and Algorithmic Equality in Predicative Type Theory. Log. Methods Comput. Sci. 8(1) (2012) - [c37]Andreas Abel:
Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types. FICS 2012: 1-11 - 2011
- [j9]Andreas Abel, Thierry Coquand, Miguel Pagano:
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance. Log. Methods Comput. Sci. 7(2) (2011) - [c36]Andreas Abel:
Irrelevance in Type Theory with a Heterogeneous Equality Judgement. FoSSaCS 2011: 57-71 - [c35]Andreas Abel, Brigitte Pientka:
Higher-Order Dynamic Pattern Unification for Dependent Types and Records. TLCA 2011: 10-26 - [c34]Andreas Abel, Nicolai Kraus:
A Lambda Term Representation Inspired by Linear Ordered Logic. LFMTP 2011: 1-13 - 2010
- [c33]Andreas Abel:
Towards Normalization by Evaluation for the betaeta-Calculus of Constructions. FLOPS 2010: 224-239 - [c32]Andreas Abel:
MiniAgda: Integrating Sized and Dependent Types. PAR@ITP 2010: 18-33 - [c31]Andreas Abel, Brigitte Pientka:
Explicit Substitutions for Contextual Type Theory. LFMTP 2010: 5-20 - [c30]Andreas Abel:
MiniAgda: Integrating Sized and Dependent Types. PAR 2010: 14-28
2000 – 2009
- 2009
- [j8]Andreas Abel:
Implementing a normalizer using sized heterogeneous types. J. Funct. Program. 19(3-4): 287-310 (2009) - [j7]Andreas Abel:
Type-based termination of generic programs. Sci. Comput. Program. 74(8): 550-567 (2009) - [c29]Andreas Abel:
Typed Applicative Structures and Normalization by Evaluation for System Fomega. CSL 2009: 40-54 - [c28]Andreas Abel, Thierry Coquand, Miguel Pagano:
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance. TLCA 2009: 5-19 - [e1]Andreas Abel, Christian Urban:
Proceedings of the International Workshop on Logical Frameworks and Metalanguages: Theory and Practice, LFMTP@LICS 2008, Pittsburgh, PA, USA, June 23, 2008. Electronic Notes in Theoretical Computer Science 228, Elsevier 2009 [contents] - 2008
- [j6]Andreas Abel:
Semi-Continuous Sized Types and Termination. Log. Methods Comput. Sci. 4(2) (2008) - [j5]Andreas Abel:
Polarised subtyping for sized types. Math. Struct. Comput. Sci. 18(5): 797-822 (2008) - [c27]Andreas Abel, Dulma Rodriguez:
Syntactic Metatheory of Higher-Order Subtyping. CSL 2008: 446-460 - [c26]Andreas Abel, Thierry Coquand, Peter Dybjer:
On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory. FLOPS 2008: 3-13 - [c25]Andreas Abel:
Weak beta-theta-Normalization and Normalization by Evaluation for System F. LPAR 2008: 497-511 - [c24]Andreas Abel, Thierry Coquand, Peter Dybjer:
Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type Theory. MPC 2008: 29-56 - [c23]Andreas Abel, Christian Urban:
Preface. LFMTP@LICS 2008: 1 - [c22]Andreas Abel, Thorsten Altenkirch:
A Partial Type Checking Algorithm for Type: Type. MSFP@ICALP 2008: 3-17 - [i1]Andreas Abel:
Semi-continuous Sized Types and Termination. CoRR abs/0804.0876 (2008) - 2007
- [b1]Andreas Abel:
Type-based termination: a polymorphic lambda-calculus with sized higher-order types. Ludwig Maximilians University Munich, 2007, ISBN 978-3-938363-04-1, pp. 1-203 - [j4]Andreas Abel, Thierry Coquand:
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. Fundam. Informaticae 77(4): 345-395 (2007) - [c21]Andreas Abel:
Mixed Inductive/Coinductive Types and Strong Normalization. APLAS 2007: 286-301 - [c20]Andreas Abel, Thierry Coquand, Peter Dybjer:
Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements. LICS 2007: 3-12 - [c19]Andreas Abel:
Strong Normalization and Equi-(Co)Inductive Types. TLCA 2007: 8-22 - [c18]Andreas Abel, Klaus Aehlig, Peter Dybjer:
Normalization by Evaluation for Martin-Löf Type Theory with One Universe. MFPS 2007: 17-39 - 2006
- [c17]Andreas Abel:
Semi-continuous Sized Types and Termination. CSL 2006: 72-88 - [c16]Andreas Abel:
Polarized Subtyping for Sized Types. CSR 2006: 381-392 - [c15]Andreas Abel:
Implementing a Normalizer Using Sized Heterogeneous Types. MSFP@MPC 2006 - [c14]Andreas Abel:
Towards Generic Programming with Sized Types. MPC 2006: 10-28 - 2005
- [j3]Andreas Abel, Ralph Matthes, Tarmo Uustalu:
Iteration and coiteration schemes for higher-order and nested datatypes. Theor. Comput. Sci. 333(1-2): 3-66 (2005) - [c13]Andreas Abel, Thierry Coquand, Ulf Norell:
Connecting a Logical Framework to a First-Order Logic Prover. FroCoS 2005: 285-301 - [c12]Andreas Abel, Marcin Benke, Ana Bove, John Hughes, Ulf Norell:
Verifying haskell programs using constructive type theory. Haskell 2005: 62-73 - [c11]Andreas Abel, Thierry Coquand:
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. TLCA 2005: 23-38 - 2004
- [j2]Andreas Abel:
Termination checking with types. RAIRO Theor. Informatics Appl. 38(4): 277-319 (2004) - [c10]Andreas Abel, Ralph Matthes:
Fixed Points of Type Constructors and Primitive Recursion. CSL 2004: 190-204 - [c9]Andreas Abel:
Normalization for the Simply-Typed Lambda-Calculus in Twelf. LFM@IJCAR 2004: 3-16 - 2003
- [c8]Andreas Abel, Ralph Matthes:
Primitive Recursion for Rank-2 Inductive Types. FICS 2003: 1-3 - [c7]Andreas Abel, Ralph Matthes, Tarmo Uustalu:
Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. FoSSaCS 2003: 54-69 - [c6]Andreas Abel:
Termination and Productivity Checking with Continuous Types. TLCA 2003: 1-15 - [c5]Andreas Abel, Claus Rautenstrauch:
Private Währungen im Internet - Fachkonzept und Einsatzpotenziale. Wirtschaftsinformatik (1) 2003: 325-344 - 2002
- [j1]Andreas Abel, Thorsten Altenkirch:
A predicative analysis of structural recursion. J. Funct. Program. 12(1): 1-41 (2002) - [c4]Andreas Abel, Ralph Matthes:
(Co-)Iteration for Higher-Order Nested Datatypes. TYPES 2002: 1-20 - 2001
- [c3]Andreas Abel:
A Third-Order Representation of the lambda-mu-Calculus. MERLIN 2001: 97-114
1990 – 1999
- 1999
- [c2]Andreas Abel:
Specification and Verification of a Formal System for Structurally Recursive Functions. TYPES 1999: 1-20 - [c1]Andreas Abel, Thorsten Altenkirch:
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types. TYPES 1999: 21-40
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-09-07 02:03 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:
