Complexity of kernel fun subtype checking

DOI10.1145/232627.232643MaRDI QIDQ2817692zbMATH OpenOpenAlexFDO

Authors G. Ghelli

Publication date 1 September 2016

Published in Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 (Search for Journal in Brave)

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

zbMATH Keywords

polymorphismsubtypingtype checkingtype theory

Mathematics Subject Classification ID

Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Subtyping recursion and parametric polymorphism in kernel Fun
• Higher-order subtyping
• Some complexity bounds for subtype inequalities
• scientific article; zbMATH DE number 922624
• scientific article; zbMATH DE number 1342218

Cited in

(1)

• Subtyping recursion and parametric polymorphism in kernel Fun

This page was built for publication: Complexity of kernel fun subtype checking

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