Pages that link to "Item:Q2639842"
From MaRDI portal
The following pages link to Inductive types and type constraints in the second-order lambda calculus (Q2639842):
Displayed 23 items.
- Strong normalization results by translation (Q636353) (← links)
- On modal logics of partial recursive functions (Q817692) (← links)
- Structures definable in polymorphism (Q1273075) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Iteration and coiteration schemes for higher-order and nested datatypes (Q1770412) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- Logic of subtyping (Q2500487) (← links)
- Corecursion and Non-divergence in Session-Typed Processes (Q2811932) (← links)
- Modular Dependent Induction in Coq, Mendler-Style (Q2829276) (← links)
- Mixed Inductive/Coinductive Types and Strong Normalization (Q3498444) (← links)
- Dual Calculus with Inductive and Coinductive Types (Q3636828) (← links)
- Implementing a normalizer using sized heterogeneous types (Q3638918) (← links)
- Two extensions of system F with (co)iteration and primitive (co)recursion principles (Q3653093) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q4580223) (← links)
- A realizability interpretation of Church's simple theory of types (Q4593235) (← links)
- Termination checking with types (Q4659886) (← links)
- The Recursion Scheme from the Cofree Recursive Comonad (Q5166625) (← links)
- Classical Logic with Mendler Induction (Q5283417) (← links)
- Mtac: A monad for typed tactic programming in Coq (Q5371944) (← links)
- Unifying structured recursion schemes (Q5371980) (← links)
- Compositional Coinduction with Sized Types (Q5739446) (← links)
- Least and greatest fixed points in intuitionistic natural deduction (Q5958300) (← links)