Thorsten Altenkirch


I am Reader (Associate Professor) at the School of Computer Science of the University of Nottingham. Jointly with Graham Hutton I am chairing the Functional Programming Laboratory. We are organizing the weekly FP lunch and the FP seminar.

Dependently Typed Programming 2010 (July 9 - 10)

Conor and I are organizing another workshop on dependently typed programming to take place in Edinburgh as part of FLOCS. In the tradition of TYPES workshops we will try to accomodate everybody who wants to talk - please let us know by 16 April.

FICS 2010

The 7th Workshop on Fixed Points in Computer Science is going to take place in Brno (Czech Republic), August 21-22 as a satellite workshop of MFCS and CSL.

WGP 2010

The ACM SIGPLAN 6th Workshop on Generic Programming, 2010 is going to take place in Baltimore in September 2010 (colocated with ICFP).

TLDI 2011

The The Sixth ACM SIGPLAN Workshop on Types in Language Design and Implementation will take place in January 2011 in Austin, Texas (in conjunction with POPL 2011). Please consider to submit a paper!

How to contact me ?

Recent talks

Drafts and Publications

Final year projects

Here is my entry in the Student guidebook:

Keywords: Constructive Logic, Type Theory, Category Theory, Lambda calculus, Quantum Computing, Certified Correct Programs

Thorsten Altenkirch's main research interest is the application of constructive logic in Computer Science. Constructive logic diverges from classical logic in the rejection of the principle of the excluded middle. As a consequence of this, a constructive proof of the existence of a certain object (e.g. a number) can be turned into a computer program to calculate this object.

An example of a constructive logic is Type Theory, introduced by the Swedish philosopher Per Martin-Löf. Type Theory is at the same time a programming language and a logic: propositions correspond to types and proofs to programs. Current research centers on theoretical aspects of Type Theory but also on the construction of elegant and efficient implementations of type theoretic languages. An example of this is the Epigram system, currently under development in Nottingham, which we use to develop programs which are correct by construction.

Dr. Altenkirch's research covers applications of Category Theory as a formalism to concisely express abstract properties of mathematical constructions in Computer Science and the investigation of typed lambda calculi as a foundation of (functional) programming languages and Type Theory. He is interested in the computational nature of the physical universe and the practical exploitation of this nature, which is reflected in a research project on Quantum Computation. He is also fascinated by the development of the philosophical foundations of logic in a time when computing science replaces natural science as the prime application of abstract reasoning.

Current Research grants

Previous Research grants

PhD students

Former Students

Current Students

Current Teaching

I am currently teaching the following modules:

G52MC2
Mathematics for Computer Scientists 2
G53POP
Principles of Programming Languages
G53CFR, G54CFR
Computer Aided Formal Reasoning
G53NSC, G54NSC
Non Standard Computation (this year presented by Alex Green)

Previous Teaching

G51CSA
Computer Systems Architecture
G51MCS
Mathematics for Computer Scientists
G51MAL
Machines and their languages
G53GEM (with Natasha Alecina)
Gems of theoretical Computer Science

Midlands Graduate School

October/November 2000
A Taste of Intuitionistic Type Theory
February/March 2002
A Taste of Proof Theory
March 2003
Intuitionistic Logic
March/April 2004
Lambda calculus and types
April 2007
Material for Dependently Typed Programming (DEP)
April 2008
Material for the COQ course
March/April 2009
Material for the Category Theory course

Misc


Last modified: Sun Jan 8 15:09:01 GMT 2006