The SCEAS System
Navigation Menu

Search the dblp DataBase


Thorsten Altenkirch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thorsten Altenkirch
    Logical Relations and Inductive/Coinductive Types. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:343-354 [Conf]
  2. Thorsten Altenkirch, Bernhard Reus
    Monadic Presentations of Lambda Terms Using Generalized Inductive Types. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:453-468 [Conf]
  3. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Categorical Reconstruction of a Reduction Free Normalization Proof. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1995, pp:182-199 [Conf]
  4. Thorsten Altenkirch, Tarmo Uustalu
    Normalization by Evaluation for lambda-2. [Citation Graph (0, 0)][DBLP]
    FLOPS, 2004, pp:260-275 [Conf]
  5. Michael Abbott, Thorsten Altenkirch, Neil Ghani
    Categories of Containers. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:23-38 [Conf]
  6. Michael Abbott, Thorsten Altenkirch, Neil Ghani
    Representing Nested Inductive Types Using W-Types. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:59-71 [Conf]
  7. Thorsten Altenkirch, Conor McBride
    Generic Programming within Dependently Typed Programming. [Citation Graph (0, 0)][DBLP]
    Generic Programming, 2002, pp:1-20 [Conf]
  8. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:146- [Conf]
  9. Thorsten Altenkirch
    Extensional Equality in Intensional Type Theory. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:412-420 [Conf]
  10. Thorsten Altenkirch, Peter Dybjer, Martin Hofmann, Philip J. Scott
    Normalization by Evaluation for Typed Lambda Calculus with Coproducts. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:303-310 [Conf]
  11. Thorsten Altenkirch, Jonathan Grattage
    A Functional Quantum Programming Language. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:249-258 [Conf]
  12. Thorsten Altenkirch, Martin Hofmann, Thomas Streicher
    Reduction-Free Normalisation for a Polymorphic System. [Citation Graph (0, 0)][DBLP]
    LICS, 1996, pp:98-106 [Conf]
  13. Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride
    Constructing Polymorphic Programs with Quotient Types. [Citation Graph (0, 0)][DBLP]
    MPC, 2004, pp:2-15 [Conf]
  14. Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor McBride
    Derivatives of Containers. [Citation Graph (0, 0)][DBLP]
    TLCA, 2003, pp:16-30 [Conf]
  15. Thorsten Altenkirch
    Representations of First Order Function Types as Terminal Coalgebras. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:8-21 [Conf]
  16. Thorsten Altenkirch
    A Formalization of the Strong Normalization Proof for System F in LEGO. [Citation Graph (0, 0)][DBLP]
    TLCA, 1993, pp:13-28 [Conf]
  17. Thorsten Altenkirch, Thierry Coquand
    A Finitary Subsystem of the Polymorphic lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    TLCA, 2001, pp:22-28 [Conf]
  18. Peter Morris, Thorsten Altenkirch, Conor McBride
    Exploring the Regular Tree Types. [Citation Graph (0, 0)][DBLP]
    TYPES, 2004, pp:252-267 [Conf]
  19. 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]
  20. Thorsten Altenkirch
    Proving Strong Normalization of CC by Modifying Realizability Semantics. [Citation Graph (0, 0)][DBLP]
    TYPES, 1993, pp:3-18 [Conf]
  21. Jeremy Gibbons, Graham Hutton, Thorsten Altenkirch
    When is a function a fold or an unfold? [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
  22. Thorsten Altenkirch, Jonathan Grattage, Juliana K. Vizzotto, Amr Sabry
    An Algebra of Pure Quantum Programming. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:170, n:, pp:23-47 [Journal]
  23. Michael Abbott, Thorsten Altenkirch, Conor McBride, Neil Ghani
    for Data: Differentiating Data Structures. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:65, n:1-2, pp:1-28 [Journal]
  24. 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]
  25. Michael Abbott, Thorsten Altenkirch, Neil Ghani
    Containers: Constructing strictly positive types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:1, pp:3-27 [Journal]
  26. James Chapman, Thorsten Altenkirch, Conor McBride
    Epigram reloaded: a standalone typechecker for ETT. [Citation Graph (0, 0)][DBLP]
    Trends in Functional Programming, 2005, pp:79-94 [Conf]
  27. Wouter Swierstra, Thorsten Altenkirch
    Beauty in the beast. [Citation Graph (0, 0)][DBLP]
    Haskell, 2007, pp:25-36 [Conf]
  28. Thorsten Altenkirch, Conor McBride, Wouter Swierstra
    Observational equality, now! [Citation Graph (0, 0)][DBLP]
    PLPV, 2007, pp:57-68 [Conf]
  29. Juliana K. Vizzotto, Thorsten Altenkirch, Amr Sabry
    Structuring quantum effects: superoperators as arrows [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  30. Constructing Strictly Positive Families. [Citation Graph (, )][DBLP]

  31. Higher-Order Containers. [Citation Graph (, )][DBLP]

  32. PiSigma: Dependent Types without the Sugar. [Citation Graph (, )][DBLP]

  33. Monads Need Not Be Endofunctors. [Citation Graph (, )][DBLP]

  34. Indexed Containers. [Citation Graph (, )][DBLP]

  35. Subtyping, Declaratively. [Citation Graph (, )][DBLP]

  36. From Reversible to Irreversible Computations. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.006secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002