Symbolic abstract data type inference

DOI10.1145/2837614.2837645MaRDI QIDQ2828291zbMATH OpenOpenAlexWikidataFDO

Authors Michael Emmi, Constantin Enea

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.2837645

zbMATH Keywords

concurrencylinearizabilityrefinement

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Type inference, abstract interpretation and strictness analysis
• scientific article; zbMATH DE number 3911685
• Type inference for pure type systems
• A semantics for static type inference
• Reasoning about algebraic data types with abstractions
• Type inference in mathematics
• Type inference in polymorphic type discipline
• scientific article; zbMATH DE number 4080882
• scientific article; zbMATH DE number 4145878
• A Rewriting Semantics for Type Inference

Cited in

(1)

• Stratified type inference for generalized algebraic data types

This page was built for publication: Symbolic abstract data type inference

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