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.
Automating grammar comparison
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Framework using abstract grammar transformations, theory-based algorithms, and graph-inspired canonization to detect and explain (in-)equivalence of context-free grammars, evaluated on educational datasets.
citing papers explorer
-
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.
-
Detecting and Explaining (In-)equivalence of Context-Free Grammars
Framework using abstract grammar transformations, theory-based algorithms, and graph-inspired canonization to detect and explain (in-)equivalence of context-free grammars, evaluated on educational datasets.