Abstract
This special issue of Mathematical Structures in Computer Science is devoted to recent work in subtyping. When subtyping was first proposed, it presented a new vehicle for understanding programming languages, together with challenging theoretical issues. The papers in this special issue include a new approach to the decidability of subtyping, a metatheoretic investigation of transitivity of coercive subtyping for parametrised dependent types, and applications of subtyping to the classic programming language concerns of flow analysis and typing for distributed systems. We believe that the scope of the papers demonstrates convincingly that the theory and practice of subtyping continue to be extended in novel and interesting ways.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
