Wellfounded Trees and Dependent Polynomial Functors

Gambino, N orcid.org/0000-0002-4257-3590 and Hyland, M (2004) Wellfounded Trees and Dependent Polynomial Functors. In: Lecture Notes in Computer Science. TYPES 2003: International Workshop on Types for Proofs and Programs, 30 Apr - 04 May 2003, Torino, Italy. Springer Nature , pp. 210-225. ISBN 978-3-540-22164-7

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Springer-Verlag Berlin Heidelberg 2004. This is an author produced version of a conference paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Type Theory; Natural Transformation; Monoidal Category; Left Adjoint; Forgetful Functor
Dates:
  • Published: 2004
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 25 Feb 2020 15:17
Last Modified: 26 Feb 2020 15:17
Status: Published
Publisher: Springer Nature
Identification Number: 10.1007/978-3-540-24849-1_14
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)