Type inference for pure type systems
From MaRDI portal
Recommendations
Cites work
Cited in
(23)- scientific article; zbMATH DE number 3982838 (Why is no real title available?)
- scientific article; zbMATH DE number 910819 (Why is no real title available?)
- Type Inference for Correspondence Types
- Type inference with non-structural subtyping
- scientific article; zbMATH DE number 1231454 (Why is no real title available?)
- scientific article; zbMATH DE number 7577586 (Why is no real title available?)
- Pure type systems with explicit substitution
- Domain-free pure type systems
- Introduction to generalized type systems
- Type systems equivalent to data-flow analyses for imperative languages
- scientific article; zbMATH DE number 177779 (Why is no real title available?)
- Expansion postponement for normalising pure type systems
- Specifying type systems
- scientific article; zbMATH DE number 1953289 (Why is no real title available?)
- scientific article; zbMATH DE number 1231477 (Why is no real title available?)
- Sound and complete type inference for closed effect rows
- Variants of the basic calculus of constructions
- Type inference for set theory
- Stratified type inference for generalized algebraic data types
- Principal Type Schemes for the Strict Type Assignment System
- Principal type inference for GADTs
- Symbolic abstract data type inference
- Type inference in polymorphic type discipline
This page was built for publication: Type inference for pure type systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1271309)