Monotone fixed-point types and strong normalization
From MaRDI portal
Recommendations
Cited in
(13)- Non-strictly positive fixed points for classical natural deduction
- Tarski's fixed-point theorem and lambda calculi with monotone inductive types
- Strong Normalization and Equi-(Co)Inductive Types
- From Monomorphic to Polymorphic Well-Typings and Beyond
- Two extensions of System F with (co)iteration and primitive (co)recursion principles
- scientific article; zbMATH DE number 512789 (Why is no real title available?)
- scientific article; zbMATH DE number 1385477 (Why is no real title available?)
- Monotone (co)inductive types and positive fixed-point types
- Efficient lambda encodings for Mendler-style coinductive types in Cedille
- Monotone recursive types and recursive data representations in Cedille
- Some remarks on type systems for course-of-value recursion
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- Paradoxical connectives: proof-theoretic semantics, recursion, and fixed-point operators
This page was built for publication: Monotone fixed-point types and strong normalization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4263804)