|
|
| www. Paul Taylor. EU |
| pt 25 @ Paul Taylor. EU |
I am an Honorary Senior Research Fellow in the Theory Group in the School of Computer Science at the University of Birmingham.
Induction, recursion, replacement and the ordinals are studied categorically using well founded coalgebras. See the simple proof of the order-theoretic fixed point theorem that MathOverflow has censored!
Abstract Stone Duality is a revolutionary direct axiomatisation of general topology and constructive real analysis that is inherently computable.
Practical Foundations of Mathematics relates category theory and type theory to the idioms of mathematics (Cambridge University Press, 1999, ISBN 0-521-63107-6).
Commutative diagrams, proof trees and boxes and other TeX macros. My right-justified end-of-proof square is the only one that works.
Classical (Scott) and stable domain theory, also called analytic or polynomial functors, shapes, containers, or multiadjoints.
Proofs and Types by Jean-Yves Girard, which I translated, is out of print but downloadable.
Translations of various historical journal papers.
Introduction to Algorithms and Reasoned Programming: a first year computer science course.
Undergraduate algebra and other course notes that I wrote when I was a graduate student.