Representations of first order function types as terminal coalgebras

Authors:
Thorsten Altenkirch
Affiliations:
School of Computer Science and Information Technology, University of Nottingham, UK
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 2
Cited 8

Nested Datatypes

MPC '98 Proceedings of the Mathematics of Program Construction
Generalizing generalized tries

Journal of Functional Programming

CPS translating inductive and coinductive types

PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Monotone Inductive and Coinductive Constructors of Rank 2

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The worker/wrapper transformation

Journal of Functional Programming
(Co-) iteration for higher-order nested datatypes

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Reasoning about codata

CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Type fusion

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Concrete stream calculus: An extended study

Journal of Functional Programming
Adjoint folds and unfolds-An extended study

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that function types which have only initial algebras for regular functors in the domains, i.e. first order function types, can be represented by terminal coalgebras for certain nested functors. The representation exploits properties of ωop-limits and local ω-colimits.