An analysis of ML typability
From MaRDI portal
Recommendations
Cited in
(14)- Type reconstruction in finite rank fragments of the second-order -calculus
- Computing ML equality kinds using abstract interpretation
- Haskell overloading is DEXPTIME-complete
- Strong normalization from weak normalization in typed \(\lambda\)-calculi
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case
- De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case
- Weakly complete problems are not rare
- Domain-free -calculus
- The power of non-determinism in higher-order implicit complexity. Characterising complexity classes using non-deterministic cons-free programming
- scientific article; zbMATH DE number 125891 (Why is no real title available?)
- scientific article; zbMATH DE number 1330133 (Why is no real title available?)
- Type inference for first-class messages with feature constraints
- Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
- The complexity ecology of parameters: An illustration using bounded max leaf number
This page was built for publication: An analysis of ML typability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299012)