Classical vs Quantum Computation (Week 17)
Posted by John Baez
Yay! In this week’s course on Classical vs Quantum Computation, we finally reached the promised land: surface diagrams — closely resembling string worldsheets! — illustrating ‘processes of computation’:

Week 17 (Mar. 8)  2categories from typed λcalculi. For each type, a category of terms of that type, freely generated by rewrite rules. Example: highschool calculus. Confluence and termination. Surface diagrams showing the process of computation.
Supplementary reading:
 Joachim Lambek and Phil Scott, Introduction to HigherOrder Categorical Logic, Cambridge U. Press, 1988. Part 1, Sections 1214: the decision problem for equality; the ChurchRosser property for bounded terms; all terms are bounded.
Last week’s notes are here; next week’s notes are here.
Posted at March 9, 2007 12:17 AM UTC