Basic category theory for models of syntax, Course notes for (2002)
by
R. L. Crole
| Venue: | Summer School on Generic Programming, SSGP'02 |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Crole02basiccategory,
author = {R. L. Crole},
title = {Basic category theory for models of syntax, Course notes for},
booktitle = {Summer School on Generic Programming, SSGP'02},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. These notes form the basis of four lectures given at the Summer
Citations
| 278 | Lambda-calculus notation with nameless dummies, a tool for automatic formula manipulation - Bruijn - 1972 |
| 130 | Abstract Syntax and Variable Binding - Fiore - 1999 |
| 127 | A new approach to abstract syntax involving binders - GABBAY, PITTS - 1999 |
| 117 | Primitive recursion for higher-order abstract syntax - Schürmann, Despeyroux, et al. - 2001 |
| 49 | Five axioms of alpha conversion - Gordon, Melham |
| 37 | Higher-order abstract syntax in Coq - Despeyroux, Felty, et al. - 1995 |
| 32 | Combining higher order abstract syntax with tactical theorem proving and (co)induction - Ambler, Crole, et al. - 2002 |
| 29 | A mechanisation of name-carrying syntax up to alpha-conversion - Gordon - 1994 |
| 1 | Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. Revised lectures from an - Backhouse, Crole, et al. - 2000 |
