Permissions and uncontrollable propositions in DSDL3: non-monotonicity and algorithms
Abstract
References
Index Terms
- Permissions and uncontrollable propositions in DSDL3: non-monotonicity and algorithms
Recommendations
Propositions as [Types]
Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational ...
Propositions as sessions
ICFP '12Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line ...
Propositions as sessions
ICFP '12: Proceedings of the 17th ACM SIGPLAN international conference on Functional programmingContinuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line ...
Comments
Information & Contributors
Information
Published In
Sponsors
- BNVKI
- JURIX: Dutch Foundation for Legal Knowledge and Information Systems
- NWO: Dutch Orgartisation for Scientific Research
- SIKS: Dutch Research School of Information and Knowledge Systems
- KNAW: Koninklijke Nederlandse Academie van Wetenschappen
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0