Complexity of kernel Fun subtype checking

DOI10.1145/232627.232643zbMath1345.68082OpenAlexW2029530526MaRDI QIDQ2817692

Giorgio 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

polymorphismtype theorysubtypingtype checking

Mathematics Subject Classification ID

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

Related Items (1)

Subtyping recursion and parametric polymorphism in kernel Fun

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