Boxy types

DOI10.1145/1159803.1159838zbMath1321.68133OpenAlexW2154717882MaRDI QIDQ5501473

Stephanie Weirich, Dimitrios Vytiniotis, Simon L. Peyton Jones

Publication date: 3 August 2015

Published in: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1159803.1159838

zbMATH Keywords

type inferenceimpredicativityhigher-rank types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (6)

Explicit effect subtyping ⋮ Heterogeneous binary random-access lists ⋮ A lean specification for gadts: System F with first-class equality proofs ⋮ Selective strictness and parametricity in structural operational semantics, inequationally ⋮ Formal polytypic programs and proofs ⋮ Recasting ML\(^{\text F}\)

This page was built for publication: Boxy types