Type inference with recursive type equations
From MaRDI portal
Recommendations
- Type inference with recursive types: Syntax and semantics
- Type inference for bimorphic recursion
- Polymorphic type reconstruction using type equations
- A complete type inference system for subtyped recursive types
- Type introduction for equational rewriting
- Type introduction for equational rewriting
- Fix-point equations for well-founded recursion in type theory
- Interpretations of recursively defined types
- A Rewriting Semantics for Type Inference
- scientific article; zbMATH DE number 1231454
Cited in
(11)- Type introduction for equational rewriting
- Isomorphisms of generic recursive polynomial types
- Positive recursive type assignment
- scientific article; zbMATH DE number 978248 (Why is no real title available?)
- scientific article; zbMATH DE number 1377611 (Why is no real title available?)
- Type inference for bimorphic recursion
- A syntactic approach to eta equality in type theory
- Decidability properties of recursive types.
- Interpretations of recursively defined types
- Type inference with recursive types: Syntax and semantics
- Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
This page was built for publication: Type inference with recursive type equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771055)