Extends logical relations to recursive session types for PSNI, proves soundness/completeness via biorthogonality with observation-index stratification, and gives an IFC refinement type system with secrecy polymorphism.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.PL 2verdicts
UNVERDICTED 2representative citing papers
Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations.
citing papers explorer
-
Logical Relations for Session-Typed Concurrency
Extends logical relations to recursive session types for PSNI, proves soundness/completeness via biorthogonality with observation-index stratification, and gives an IFC refinement type system with secrecy polymorphism.
-
Implementing Grassroots Logic Programs with Multiagent Transition Systems and AI
Derives correct deterministic semantics for multiagent logic programs from abstract ones and uses them as specs for AI-generated Dart implementations.