scientific article; zbMATH DE number 1385477
From MaRDI portal
Publication:4720069
Recommendations
- Monotone (co)inductive types and positive fixed-point types
- scientific article; zbMATH DE number 1342219
- Tarski's fixed-point theorem and lambda calculi with monotone inductive types
- Two extensions of System F with (co)iteration and primitive (co)recursion principles
- Type fixpoints, iteration vs. recursion
Cited in
(17)- Iteration and coiteration schemes for higher-order and nested datatypes
- Tarski's fixed-point theorem and lambda calculi with monotone inductive types
- Executable relational specifications of polymorphic type systems using Prolog
- Type fixpoints, iteration vs. recursion
- scientific article; zbMATH DE number 4202427 (Why is no real title available?)
- Two extensions of System F with (co)iteration and primitive (co)recursion principles
- scientific article; zbMATH DE number 1342219 (Why is no real title available?)
- Termination checking with types
- Monotone (co)inductive types and positive fixed-point types
- Efficient lambda encodings for Mendler-style coinductive types in Cedille
- Martin Hofmann's Case for Non-Strictly Positive Data Types
- Classical Logic with Mendler Induction
- Inductive-data-type systems
- Least and greatest fixed points in intuitionistic natural deduction
- The Yoneda reduction of polymorphic types
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Parameter-free polymorphic types
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4720069)
