Higher-Ranked Annotation Polymorphic Dependency Analysis

DOI10.1007/978-3-030-44914-8_24OpenAlexW3016786896MaRDI QIDQ5041115

Fabian Thorand, Jurriaan Hage

Publication date: 13 October 2022

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44914-8_24

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• ML
• Haskell
• lens
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
• A theory of type polymorphism in programming
• Dependent Information Flow Types
• Practical type inference for arbitrary-rank types
• Random time evolution and direct integrals: Constants of the motion and the mass operator
• A logic programming language with lambda-abstraction, function variables, and simple unification
• Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
• Information flow inference for ML
• Combinators for bi-directional tree transformations
• Towards automatic resource bound analysis for OCaml

This page was built for publication: Higher-Ranked Annotation Polymorphic Dependency Analysis