Logical relations and inductive/coinductive types

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate a λ calculus with positive inductive and coinductive types, which we call λ μ,ν, using logical relations. We show that parametric theories have the strong categorical properties, that the representable functors and natural transformations have the expected properties. Finally we apply the theory to show that terms of functorial type are almost canonical and that monotone inductive definitions can be reduced to positive in some cases.

Cite

CITATION STYLE

APA

Altenkirch, T. (1999). Logical relations and inductive/coinductive types. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1584, pp. 343–354). Springer Verlag. https://doi.org/10.1007/10703163_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free