Higher-ranked annotation polymorphic dependency analysis
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3874579 (Why is no real title available?)
- scientific article; zbMATH DE number 1738290 (Why is no real title available?)
- scientific article; zbMATH DE number 2161330 (Why is no real title available?)
- A logic programming language with lambda-abstraction, function variables, and simple unification
- A theory of type polymorphism in programming
- Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
- Dependent information flow types
- Higher-order unification and matching
- Information flow inference for ML
- Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
- Practical type inference for arbitrary-rank types
- Random time evolution and direct integrals: Constants of the motion and the mass operator
- Towards automatic resource bound analysis for OCaml
- Type reconstruction in finite rank fragments of the second-order -calculus
Cited in
(3)
This page was built for publication: Higher-ranked annotation polymorphic dependency analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041115)