A framework for type inference with subtyping
From MaRDI portal
Publication:5348899
DOI10.1145/289423.289448zbMath1369.68153OpenAlexW2081992169MaRDI QIDQ5348899
Publication date: 21 August 2017
Published in: Proceedings of the third ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/289423.289448
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (4)
Non-structural subtype entailment in automata theory ⋮ Type inference and strong static type checking for Promela ⋮ HM(X) type inference is CLP(X) solving ⋮ Simplifying subtyping constraints: a theory
This page was built for publication: A framework for type inference with subtyping
