Extends GKAT with Hoare and word hypotheses, proving sound and complete axiomatization while preserving nearly linear-time equivalence decidability.
Vasconcelos
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
GPLC is a gradual source probabilistic lambda calculus formalized with probabilistic couplings for static relations, elaborated to a distribution-based target language TPLC, and proven type-safe with conservative extension and gradual guarantee properties.
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.
citing papers explorer
-
GKAT with Hoare Hypotheses
Extends GKAT with Hoare and word hypotheses, proving sound and complete axiomatization while preserving nearly linear-time equivalence decidability.
-
A Gradual Probabilistic Lambda Calculus
GPLC is a gradual source probabilistic lambda calculus formalized with probabilistic couplings for static relations, elaborated to a distribution-based target language TPLC, and proven type-safe with conservative extension and gradual guarantee properties.
-
Simple grammar bisimilarity, with an application to session type equivalence
Single-exponential algorithm for simple grammar bisimilarity yields first polynomial-time equivalence check for context-free session types via linear-valuation conversion.