Principal type inference for GADTs

DOI10.1145/2837614.2837665MaRDI QIDQ2828286zbMATH OpenOpenAlexFDO

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

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)

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; zbMATH DE number 5994829
• Type inference for pure type systems
• scientific article; zbMATH DE number 2086682
• Practical type inference for arbitrary-rank types
• Type Inference for Correspondence Types

Cited in

(7)

• Principal Type Inference for GHC-Style Multi-parameter Type Classes
• Migrating gradual types
• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• Ambivalent types for principal type inference with GADTs
• GADTs Meet Subtyping
• Complete and decidable type inference for GADTs
• 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)