Principal type inference for GADTs

DOI10.1145/2837614.2837665zbMATH Open1347.68076OpenAlexW2255732237MaRDI QIDQ2828286FDOQ2828286

Authors: Sheng Chen, Martin Erwig 

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

Recommendations

• Ambivalent types for principal type inference with GADTs
• Complete and decidable type inference for GADTs
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• Principal type schemes for an extended type theory
• scientific article
• Type inference for pure type systems
• scientific article; zbMATH DE number 2086682
• Practical type inference for arbitrary-rank types
• Type Inference for Correspondence Types

zbMATH Keywords

type inferenceGADTchoice typetype reconciliationvariational unification

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Cited In (7)

• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• Complete and decidable type inference for GADTs
• Ambivalent types for principal type inference with GADTs
• GADTs Meet Subtyping
• Migrating gradual types
• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• A lean specification for gadts: System F with first-class equality proofs

This page was built for publication: Principal type inference for GADTs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828286)