A type system for higher-order modules

DOI10.1145/604131.604151zbMath1321.68167OpenAlexW2053070172MaRDI QIDQ2942929

Derek R. Dreyer, Karl Crary, Robert Harper

Publication date: 11 September 2015

Published in: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

functorstype theorymodularitycomputational effectsabstract data typesgenerativitysingleton types

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Abstract data types; algebraic specification (68Q65)

Related Items (8)

Types for modules ⋮ 1ML with Special Effects ⋮ Path resolution for nested recursive modules ⋮ 1ML – Core and modules united ⋮ A bisimulation for dynamic sealing ⋮ Dynamic Translucency with Abstraction Kinds and Higher-Order Coercions ⋮ An abstract monadic semantics for value recursion ⋮ Lightweight Static Capabilities

Uses Software

• TREX

Cites Work

• Regular expression pattern matching for XML
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A type system for higher-order modules