Stratified type inference for generalized algebraic data types

DOI10.1145/1111037.1111058MaRDI QIDQ5348926zbMATH OpenOpenAlexFDO

Authors François Pottier, Yann Régis-Gianas

Publication date 21 August 2017

Published in Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.9415

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Abstract data types; algebraic specification (68Q65)

Recommendations

• A type inference algorithm for a stratified polymorphic type discipline
• A Framework for Extended Algebraic Data Types
• Reasoning about algebraic data types with abstractions
• Practical type inference for arbitrary-rank types
• Type inference with non-structural subtyping
• Type inference, abstract interpretation and strictness analysis
• Type inference for pure type systems
• Computer Science Logic
• Symbolic abstract data type inference

Cited in

(8)

• Recasting ML\(^{\text F}\)
• Ambivalent types for principal type inference with GADTs
• Type directed compilation of row-typed algebraic effects
• The essence of ornaments
• A lean specification for gadts: System F with first-class equality proofs
• GADTs, functoriality, parametricity: pick two
• GADTs are not (even partial) functors
• Transposing G to \(\text{C}^{\sharp}\): expressivity of generalized algebraic data types in an object-oriented language

This page was built for publication: Stratified type inference for generalized algebraic data types

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