Cited in
(17)- Combining proofs and programs in a dependently typed language
- Logic in Access Control (Tutorial Notes)
- The locally nameless representation
- Noninterference in a predicative polymorphic calculus for access control
- Security-typed programming within dependently typed programming
- Secure distributed programming with value-dependent types
- Secure distributed programming with value-dependent types
- Cayenne
- Ynot
- Aglet
- DKAL
- Fable
- G2C
- Binder
- F*
- G2C: cryptographic protocols from goal-driven specifications
- A Classical Realizability Model for a Semantical Value Restriction
This page was built for software: AURA
