Lightweight static capabilities
From MaRDI portal
Publication:2866337
Recommendations
Cites work
- scientific article; zbMATH DE number 1692889 (Why is no real title available?)
- scientific article; zbMATH DE number 3902022 (Why is no real title available?)
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 50149 (Why is no real title available?)
- scientific article; zbMATH DE number 65535 (Why is no real title available?)
- scientific article; zbMATH DE number 1531624 (Why is no real title available?)
- scientific article; zbMATH DE number 1759364 (Why is no real title available?)
- A Substructural Type System for Delimited Continuations
- A bisimulation for type abstraction and recursion
- A type system for higher-order modules
- Deciding type equivalence in a language with singleton kinds
- Do we need dependent types?
- Faking it Simulating dependent types in Haskell
- Monadic encapsulation of effects: a revised approach (extended version)
- Phantom types and subtyping
- Singleton, union, and intersection types for program extraction
- Tagless staged interpreters for typed languages
- Transparent modules with fully syntatic signatures
- Types for modules
This page was built for publication: Lightweight static capabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866337)