Translating dependency into parametricity

DOI10.1145/1016850.1016868MaRDI QIDQ5178029zbMATH OpenOpenAlexFDO

Authors Stephen Tse, Steve Zdancewic

Publication date 9 March 2015

Published in Proceedings of the ninth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

DCCdependencyHaskellinformation flowlambda calculuslogical relationsmonadsnoninterferenceparametricitypolymorphismprotection contextssecuritytranslation

Mathematics Subject Classification ID

Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• Noninterference for free
• scientific article; zbMATH DE number 2087549
• Access control in a core calculus of dependency
• Access control in a core calculus of dependency
• Parametricity and dependent types

Cited in

(9)

• Noninterference in a predicative polymorphic calculus for access control
• Access control in a core calculus of dependency
• Parametric Polymorphism — Universally
• Noninterference for free
• Proving Noninterference by a Fully Complete Translation to the Simply Typed lambda-calculus
• Universal properties for universal types in bifibrational parametricity
• Access control in a core calculus of dependency
• On the relations between monadic semantics
• Arrows for secure information flow

This page was built for publication: Translating dependency into parametricity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178029)