The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andreas Abel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andreas Abel
    Semi-continuous Sized Types and Termination. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:72-88 [Conf]
  2. Andreas Abel, Ralph Matthes
    Fixed Points of Type Constructors and Primitive Recursion. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:190-204 [Conf]
  3. Andreas Abel
    Polarized Subtyping for Sized Types. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:381-392 [Conf]
  4. Andreas Abel, Ralph Matthes, Tarmo Uustalu
    Generalized Iteration and Coiteration for Higher-Order Nested Datatypes. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:54-69 [Conf]
  5. Andreas Abel, Thierry Coquand, Ulf Norell
    Connecting a Logical Framework to a First-Order Logic Prover. [Citation Graph (0, 0)][DBLP]
    FroCos, 2005, pp:285-301 [Conf]
  6. Andreas Abel, Frank Wolff
    Betrachtungen zur "Schaffung" oder "Abbildung" von Realitäten beispielhaft anhand eines E-Commerce-Projektes. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung (2), 2001, pp:770-775 [Conf]
  7. Andreas Abel
    Towards Generic Programming with Sized Types. [Citation Graph (0, 0)][DBLP]
    MPC, 2006, pp:10-28 [Conf]
  8. Andreas Abel
    Termination and Productivity Checking with Continuous Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2003, pp:1-15 [Conf]
  9. Andreas Abel, Thierry Coquand
    Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. [Citation Graph (0, 0)][DBLP]
    TLCA, 2005, pp:23-38 [Conf]
  10. Andreas Abel
    Specification and Verification of a Formal System for Structurally Recursive Functions. [Citation Graph (0, 0)][DBLP]
    TYPES, 1999, pp:1-20 [Conf]
  11. Andreas Abel, Thorsten Altenkirch
    A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types. [Citation Graph (0, 0)][DBLP]
    TYPES, 1999, pp:21-40 [Conf]
  12. Andreas Abel, Ralph Matthes
    (Co-)Iteration for Higher-Order Nested Datatypes. [Citation Graph (0, 0)][DBLP]
    TYPES, 2002, pp:1-20 [Conf]
  13. Andreas Abel, Claus Rautenstrauch
    Private Währungen im Internet - Fachkonzept und Einsatzpotenziale. [Citation Graph (0, 0)][DBLP]
    Wirtschaftsinformatik (1), 2003, pp:325-344 [Conf]
  14. Andreas Abel, Klaus Aehlig, Peter Dybjer
    Normalization by Evaluation for Martin-Löf Type Theory with One Universe. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:17-39 [Journal]
  15. Andreas Abel, Thorsten Altenkirch
    A predicative analysis of structural recursion. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2002, v:12, n:1, pp:1-41 [Journal]
  16. Andreas Abel
    A Third-Order Representation of the lambda-mu-Calculus. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:58, n:1, pp:- [Journal]
  17. Andreas Abel, Ralph Matthes, Tarmo Uustalu
    Iteration and coiteration schemes for higher-order and nested datatypes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:1-2, pp:3-66 [Journal]
  18. Andreas Abel, Thierry Coquand, Peter Dybjer
    Normalization by Evaluation for Martin-Lof Type Theory with Typed Equality Judgements. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:3-12 [Conf]
  19. Andreas Abel
    Strong Normalization and Equi-(Co)Inductive Types. [Citation Graph (0, 0)][DBLP]
    TLCA, 2007, pp:8-22 [Conf]
  20. Andreas Abel, Marcin Benke, Ana Bove, John Hughes, Ulf Norell
    Verifying haskell programs using constructive type theory. [Citation Graph (0, 0)][DBLP]
    Haskell, 2005, pp:62-73 [Conf]
  21. Andreas Abel, Thierry Coquand
    Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:77, n:4, pp:345-395 [Journal]

  22. Mixed Inductive/Coinductive Types and Strong Normalization. [Citation Graph (, )][DBLP]


  23. Syntactic Metatheory of Higher-Order Subtyping. [Citation Graph (, )][DBLP]


  24. Typed Applicative Structures and Normalization by Evaluation for System Fomega. [Citation Graph (, )][DBLP]


  25. On the Algebraic Foundation of Proof Assistants for Intuitionistic Type Theory. [Citation Graph (, )][DBLP]


  26. Towards Normalization by Evaluation for the betaeta-Calculus of Constructions. [Citation Graph (, )][DBLP]


  27. Weak beta-theta-Normalization and Normalization by Evaluation for System F. [Citation Graph (, )][DBLP]


  28. Verifying a Semantic beta-eta-Conversion Test for Martin-Löf Type Theory. [Citation Graph (, )][DBLP]


  29. A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance. [Citation Graph (, )][DBLP]


  30. Semi-continuous Sized Types and Termination [Citation Graph (, )][DBLP]


  31. Normalization for the Simply-Typed Lambda-Calculus in Twelf. [Citation Graph (, )][DBLP]


  32. Preface. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002