Thorsten Altenkirch
Thorsten Altenkirch
Professor of Computer Science, University of Nottingham
Verified email at - Homepage
TitleCited byYear
A functional quantum programming language
T Altenkirch, J Grattage
20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), 249-258, 2005
Containers: constructing strictly positive types
M Abbott, T Altenkirch, N Ghani
Theoretical Computer Science 342 (1), 3-27, 2005
Monadic presentations of lambda terms using generalized inductive types
T Altenkirch, B Reus
International Workshop on Computer Science Logic, 453-468, 1999
Observational equality, now!
T Altenkirch, C McBride, W Swierstra
PLPV 7, 57-68, 2007
Categories of containers
M Abbott, T Altenkirch, N Ghani
International Conference on Foundations of Software Science and Computation …, 2003
Indexed containers
T Altenkirch, N Ghani, P Hancock, C McBride, P Morris
Journal of Functional Programming 25, 2015
Generic programming within dependently typed programming
T Altenkirch, C McBride
Generic Programming, 1-20, 2003
Constructions, inductive types and strong normalization
T Altenkirch
University of Edinburgh, 1993
A formalization of the strong normalization proof for System F in LEGO
T Altenkirch
International Conference on Typed Lambda Calculi and Applications, 13-28, 1993
Categorical reconstruction of a reduction free normalization proof
T Altenkirch, M Hofmann, T Streicher
International Conference on Category Theory and Computer Science, 182-199, 1995
Normalization by evaluation for typed lambda calculus with coproducts
T Altenkirch, P Dybjer, M Hofmann, P Scott
Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, 303-310, 2001
Monads need not be endofunctors
T Altenkirch, J Chapman, T Uustalu
International Conference on Foundations of Software Science and …, 2010
A predicative analysis of structural recursion
A Abel, T Altenkirch
Journal of Functional Programming 12 (1), 1-41, 2002
Homotopy type theory: Univalent foundations of mathematics
V Voevodsky
Institute for Advanced Study (Princeton), The Univalent Foundations Program …, 2013
Why dependent types matter
T Altenkirch, C McBride, J McKinna
Manuscript, available online, 235, 2005
Extensional equality in intensional type theory
T Altenkirch
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
Type theory in type theory using quotient inductive types
T Altenkirch, A Kaposi
ACM SIGPLAN Notices 51 (1), 18-29, 2016
Beauty in the beast
W Swierstra, T Altenkirch
Proceedings of the ACM SIGPLAN workshop on Haskell workshop, 25-36, 2007
Subtyping, declaratively
NA Danielsson, T Altenkirch
International Conference on Mathematics of Program Construction, 100-118, 2010
A user’s guide to ALF
T Altenkirch, V Gaspes, B Nordström, B von Sydow
Chalmers University of Technology, Sweden, 1994
The system can't perform the operation now. Try again later.
Articles 1–20