Compositional System Security with Interface-Confined Adversaries
Electronic Notes in Theoretical Computer Science (ENTCS)
A Unified Display Proof Theory for Bunched Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order dynamic pattern unification for dependent types and records
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Towards concurrent type theory
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
LF in LF: mechanizing the metatheories of LF in twelf
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Studia Logica
| Hi-index | 0.00 |
The logical framework LF is a constructive type theory of dependent functions that can elegantly encode many other logical systems. Prior work has studied the benefits of extending it to the linear logical framework LLF, for the incorporation linear logic features into the type theory affords good representations of state change. We describe and argue for the usefulness of an extension of LF by features inspired by hybrid logic, which has several benefits. For one, it shows how linear logic features can be decomposed into primitive operations manipulating abstract resource labels. More importantly, it makes it possible to realize a metalogical framework capable of reasoning about stateful deductive systems encoded in the style familiar front prior work with LLF, taking advantage of familiar methodologies used for metatheoretic reasoning in LF.