- Exploring the Regular Tree Types Peter Morris, Thorsten Altenkirch and Conor McBride
- Subtyping, Declaratively An Exercise in Mixed Induction and Coinduction
- Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS
- Indexed Containers Thorsten Altenkirch Peter Morris
- Monads Need Not Be Endofunctors Thorsten Altenkirch1
- The Quantum IO Monad Thorsten Altenkirch and Alexander S. Green
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Under consideration for publication in J. Functional Programming 1 Big-Step Normalisation
- : A Core Language for Dependently Typed Programming Thorsten Altenkirch Nicolas Oury
- Shor in Haskell The Quantum IO Monad
- Dependent Types for Distributed Arrays Wouter Swierstra and Thorsten Altenkirch
- From reversible to irreversible computations Alexander S. Green 1,2
- Constructing Strictly Positive Families Peter Morris and Thorsten Altenkirch
- Tait in one big step Thorsten Altenkirch and James Chapman
- Indexed Containers Thorsten Altenkirch1
- Epigram Reloaded: A Standalone Typechecker for ETT
- QPL 2005 Preliminary Version An Algebra of Pure Quantum Programming
- Why Dependent Types Matter Thorsten Altenkirch Conor McBride
- QML: Quantum data and control Thorsten Altenkirch and Jonathan Grattage
- A Compiler for a Functional Quantum Programming
- Constructing Strictly Positive Types Michael Abbott a, Thorsten Altenkirch b, Neil Ghani c
- Constructing Polymorphic Programs with Quotient Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3
- Fundamenta Informaticae XX (2005) 129 1 for Data: Differentiating Data Structures
- Normalization by evaluation for 2 Thorsten Altenkirch1
- Categories of Containers Michael Abbott1, Thorsten Altenkirch2, and Neil Ghani1
- Normalization by evaluation for typed lambda calculus with coproducts
- When is a function a fold or an unfold? Jeremy Gibbons
- Constructing Strictly Positive Families Peter Morris Thorsten Altenkirch Neil Ghani
- A functional quantum programming language Thorsten Altenkirch and Jonathan Grattage
- : Dependent Types without the Sugar Thorsten Altenkirch1
- A Partial Type Checking Algorithm for Type : Type
- Generic Programming with Dependent Types Thorsten Altenkirch, Conor McBride and Peter Morris
- Derivatives of Containers Michael Abbott1, Thorsten Altenkirch2, Neil Ghani1, and Conor McBride3
- Generic Programming for Dependent Types Constructing Strictly Positive Families
- Normalization by hereditary substitutions Chantal Keller
- Representations of first order function types as terminal coalgebras
- Representing Nested Inductive Types using W-types
- From High School to University Algebra Thorsten Altenkirch
- Higher Order Containers Thorsten Altenkirch1
- Beauty in the Beast A Functional Semantics for the Awkward Squad
- GENERIC PROGRAMMING DEPENDENTLY TYPED PROGRAMMING
- Observational Equality, Now! Thorsten Altenkirch Conor McBride Wouter Swierstra
- Under consideration for publication in Math. Struct. in Comp. Science Relative monads formalised
- Extensional Equality in Intensional Type Theory Thorsten Altenkirch
- Towards Observational Type Theory Thorsten Altenkirch and Conor McBride
- Programming + Verification = Progification Thorsten Altenkirch
- Termination Checking Nested Inductive and Coinductive Types Thorsten Altenkirch and Nils Anders Danielsson
- -calculus and types Lecture notes
- A categorical semantics for inductive-inductive definitions
