 | 2011 |
|---|
| 45 |       | Thorsten Altenkirch,
Peter Morris,
Fredrik Nordvall Forsberg,
Anton Setzer:
A Categorical Semantics for Inductive-Inductive Definitions.
CALCO 2011: 70-84 |
| 44 | | Andreas Abel,
Thorsten Altenkirch:
A Partial Type Checking Algorithm for Type: Type.
Electr. Notes Theor. Comput. Sci. 229(5): 3-17 (2011) |
| 2010 |
|---|
| 43 | | Thorsten Altenkirch,
Paul Levy,
Sam Staton:
Higher-Order Containers.
CiE 2010: 11-20 |
| 42 | | Thorsten Altenkirch,
Nils Anders Danielsson,
Andres Löh,
Nicolas Oury:
PiSigma: Dependent Types without the Sugar.
FLOPS 2010: 40-55 |
| 41 | | Thorsten Altenkirch,
James Chapman,
Tarmo Uustalu:
Monads Need Not Be Endofunctors.
FOSSACS 2010: 297-311 |
| 40 | | Nils Anders Danielsson,
Thorsten Altenkirch:
Subtyping, Declaratively.
MPC 2010: 100-118 |
| 39 | | Thorsten Altenkirch,
Tarmo Uustalu:
Preface.
Fundam. Inform. 102(2): (2010) |
| 2009 |
|---|
| 38 |  | Thorsten Altenkirch,
Todd D. Millstein:
Proceedings of the 3rd ACM Workshop Programming Languages meets Program Verification, PLPV 2009, Savannah, GA, USA, January 20, 2009
ACM 2009 |
| 37 | | Thorsten Altenkirch,
Peter Morris:
Indexed Containers.
LICS 2009: 277-285 |
| 36 | | Peter Morris,
Thorsten Altenkirch,
Neil Ghani:
A Universe of Strictly Positive Families.
Int. J. Found. Comput. Sci. 20(1): 83-107 (2009) |
| 35 | | Thorsten Altenkirch,
James Chapman:
Big-step normalisation.
J. Funct. Program. 19(3-4): 311-333 (2009) |
| 2008 |
|---|
| 34 | | Alexander S. Green,
Thorsten Altenkirch:
From Reversible to Irreversible Computations.
Electr. Notes Theor. Comput. Sci. 210: 65-74 (2008) |
| 2007 |
|---|
| 33 | | Thorsten Altenkirch,
Conor McBride:
Types for Proofs and Programs, International Workshop, TYPES 2006, Nottingham, UK, April 18-21, 2006, Revised Selected Papers
Springer 2007 |
| 32 | | Peter Morris,
Thorsten Altenkirch,
Neil Ghani:
Constructing Strictly Positive Families.
CATS 2007: 111-121 |
| 31 | | Wouter Swierstra,
Thorsten Altenkirch:
Beauty in the beast.
Haskell 2007: 25-36 |
| 30 | | Thorsten Altenkirch,
Conor McBride,
Wouter Swierstra:
Observational equality, now!
PLPV 2007: 57-68 |
| 29 | | Thorsten Altenkirch,
Jonathan Grattage,
Juliana Kaizer Vizzotto,
Amr Sabry:
An Algebra of Pure Quantum Programming.
Electr. Notes Theor. Comput. Sci. 170: 23-47 (2007) |
| 2006 |
|---|
| 28 | | Juliana Kaizer Vizzotto,
Thorsten Altenkirch,
Amr Sabry:
Structuring quantum effects: superoperators as arrows.
Mathematical Structures in Computer Science 16(3): 453-468 (2006) |
| 2005 |
|---|
| 27 | | Thorsten Altenkirch,
Jonathan Grattage:
A Functional Quantum Programming Language.
LICS 2005: 249-258 |
| 26 | | James Chapman,
Thorsten Altenkirch,
Conor McBride:
Epigram reloaded: a standalone typechecker for ETT.
Trends in Functional Programming 2005: 79-94 |
| 25 | | Juliana Kaizer Vizzotto,
Thorsten Altenkirch,
Amr Sabry:
Structuring quantum effects: superoperators as arrows
CoRR abs/quant-ph/0501151: (2005) |
| 24 | | Michael Abbott,
Thorsten Altenkirch,
Conor McBride,
Neil Ghani:
for Data: Differentiating Data Structures.
Fundam. Inform. 65(1-2): 1-28 (2005) |
| 23 | | Michael Abbott,
Thorsten Altenkirch,
Neil Ghani:
Containers: Constructing strictly positive types.
Theor. Comput. Sci. 342(1): 3-27 (2005) |
| 2004 |
|---|
| 22 | | Thorsten Altenkirch,
Tarmo Uustalu:
Normalization by Evaluation for lambda-2.
FLOPS 2004: 260-275 |
| 21 | | Michael Abbott,
Thorsten Altenkirch,
Neil Ghani:
Representing Nested Inductive Types Using W-Types.
ICALP 2004: 59-71 |
| 20 | | Michael Abbott,
Thorsten Altenkirch,
Neil Ghani,
Conor McBride:
Constructing Polymorphic Programs with Quotient Types.
MPC 2004: 2-15 |
| 19 | | Peter Morris,
Thorsten Altenkirch,
Conor McBride:
Exploring the Regular Tree Types.
TYPES 2004: 252-267 |
| 2003 |
|---|
| 18 | | Michael Abbott,
Thorsten Altenkirch,
Neil Ghani:
Categories of Containers.
FoSSaCS 2003: 23-38 |
| 17 | | Michael Abbott,
Thorsten Altenkirch,
Neil Ghani,
Conor McBride:
Derivatives of Containers.
TLCA 2003: 16-30 |
| 2002 |
|---|
| 16 | | Thorsten Altenkirch,
Conor McBride:
Generic Programming within Dependently Typed Programming.
Generic Programming 2002: 1-20 |
| 15 | | Andreas Abel,
Thorsten Altenkirch:
A predicative analysis of structural recursion.
J. Funct. Program. 12(1): 1-41 (2002) |
| 2001 |
|---|
| 14 | | Thorsten Altenkirch,
Peter Dybjer,
Martin Hofmann,
Philip J. Scott:
Normalization by Evaluation for Typed Lambda Calculus with Coproducts.
LICS 2001: 303-310 |
| 13 | | Thorsten Altenkirch,
Thierry Coquand:
A Finitary Subsystem of the Polymorphic lambda-Calculus.
TLCA 2001: 22-28 |
| 12 | | Thorsten Altenkirch:
Representations of First Order Function Types as Terminal Coalgebras.
TLCA 2001: 8-21 |
| 11 | | Jeremy Gibbons,
Graham Hutton,
Thorsten Altenkirch:
When is a function a fold or an unfold?
Electr. Notes Theor. Comput. Sci. 44(1): 146-160 (2001) |
| 1999 |
|---|
| 10 | | Thorsten Altenkirch,
Wolfgang Naraschewski,
Bernhard Reus:
Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers
Springer 1999 |
| 9 | | Thorsten Altenkirch,
Bernhard Reus:
Monadic Presentations of Lambda Terms Using Generalized Inductive Types.
CSL 1999: 453-468 |
| 8 | | Thorsten Altenkirch:
Extensional Equality in Intensional Type Theory.
LICS 1999: 412-420 |
| 7 | | Andreas Abel,
Thorsten Altenkirch:
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types.
TYPES 1999: 21-40 |
| 1998 |
|---|
| 6 | | Thorsten Altenkirch:
Logical Relations and Inductive/Coinductive Types.
CSL 1998: 343-354 |
| 1996 |
|---|
| 5 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System.
ISTCS 1996: 146 |
| 4 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Reduction-Free Normalisation for a Polymorphic System.
LICS 1996: 98-106 |
| 1995 |
|---|
| 3 | | Thorsten Altenkirch,
Martin Hofmann,
Thomas Streicher:
Categorical Reconstruction of a Reduction Free Normalization Proof.
Category Theory and Computer Science 1995: 182-199 |
| 1993 |
|---|
| 2 | | Thorsten Altenkirch:
A Formalization of the Strong Normalization Proof for System F in LEGO.
TLCA 1993: 13-28 |
| 1 | | Thorsten Altenkirch:
Proving Strong Normalization of CC by Modifying Realizability Semantics.
TYPES 1993: 3-18 |
Data released under the ODC-BY 1.0 license — See also our legal information page