Lightweight static capabilities
DOI10.1016/J.ENTCS.2006.10.039zbMATH Open1277.68052OpenAlexW2098252947MaRDI QIDQ2866337FDOQ2866337
Authors: Oleg Kiselyov, Chung-Chieh Shan
Publication date: 13 December 2013
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.2006.10.039
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Substructural Type System for Delimited Continuations
- Title not available (Why is that?)
- Tagless staged interpreters for typed languages
- Phantom types and subtyping
- Title not available (Why is that?)
- Deciding type equivalence in a language with singleton kinds
- Title not available (Why is that?)
- A bisimulation for type abstraction and recursion
- Singleton, union, and intersection types for program extraction
- Faking it Simulating dependent types in Haskell
- Transparent modules with fully syntatic signatures
- A type system for higher-order modules
- Types for modules
- Title not available (Why is that?)
- Monadic encapsulation of effects: a revised approach (extended version)
- Do we need dependent types?
Cited In (1)
Uses Software
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)