Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions

DOI10.1016/J.ENTCS.2008.10.019zbMath1286.68091OpenAlexW2150187939MaRDI QIDQ5415645

Andreas Rossberg

Publication date: 13 May 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.10.019

zbMATH Keywords

modulesparametricitycoercionsabstract typesgenerativitysingleton kinds

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Corrigendum: Polymorphic type assignment and CPS conversion
• Type dispatch for named hierarchical types
• Principals in programming languages
• A type system for higher-order modules
• Typed compilation of inclusive subtyping
• Contracts for higher-order functions
• Intensional polymorphism in type-erasure semantics
• Modules, abstract types, and distributed versioning
• Global abstraction-safe marshalling with hash types
• Extensional equivalence and singleton types
• Sound and complete elimination of singleton kinds
• Recursive type generativity

This page was built for publication: Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions