Wellfounded Trees and Dependent Polynomial Functors (2004)

Cached

Download Links

by Nicola Gambino , Martin Hyland
Venue:OF LECTURE NOTES IN COMPUTER SCIENCE
Citations:26 - 4 self

Active Bibliography

38 Wellfounded Trees in Categories – Ieke Moerdijk, Erik Palmgren, Ieke Moerdijk (utrecht - 1999
COMPLICIAL SETS – Dominic Verity - 2004
Towards a Categorical Axiomatics of Bisimulation – Gian Luca Cattani, A. John Power, Glynn Winskel - 1999
CATEGORICAL LOGIC AND PROOF THEORY EPSRC INDIVIDUAL GRANT REPORT – GR/R95975/01 – Nicola Gambino
7 ∂ for Data: Differentiating Data Structures – Michael Abbott, Neil Ghani, Thorsten Altenkirch, Conor Mcbride
9 On the Role of Category Theory in the Area of Algebraic Specifications – H. Ehrig, M. Große-Rhode, U. Wolter - 1996
Part II Local Realizability Toposes and a Modal Logic for – unknown authors
20 Developing Theories of Types and Computability via Realizability – Lars Birkedal - 2000
4 A 2-categories companion – Stephen Lack
9 On Property-Like Structures – G. M. Kelly, Stephen Lack - 1997
9 Cofibrantly generated natural weak factorisation systems – Richard Garner - 2007
29 Combining effects: sum and tensor – Martin Hyland, Gordon Plotkin, John Power
CMCS 2010 Categorifying Computations into Components via Arrows as Profunctors – Kazuyuki Asada, Ichiro Hasuo
18 A Categorical Axiomatics for Bisimulation – John Power, Glynn Winskel, Gian Luca Cattani, Gian Luca Cattani - 1998
6 Representing Nested Inductive Types Using W-types – Michael Abbott, Thorsten Altenkirch, Neil Ghani
7 First steps in synthetic guarded domain theory: step-indexing in the topos of trees – Lars Birkedal, Rasmus Ejlers Møgelberg, Jan Schwinghammer, Kristian Støvring
7 Derivatives of containers – Michael Abbott, Thorsten Altenkirch, Neil Ghani, Conor Mcbride - 2003
2 When Is a Container a Comonad? – Danel Ahman, James Chapman, Tarmo Uustalu
Small Induction Recursion – Peter Hancock, Conor Mcbride, Lorenzo Malatesta, Thorsten Altenkirch