Author of the publication

Fairness in Context-Free Grammars under Canonical Derivations.

, and . STACS, volume 182 of Lecture Notes in Computer Science, page 255-266. Springer, (1985)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems., and . CADE, volume 230 of Lecture Notes in Computer Science, page 21-41. Springer, (1986)On Fibring Feature Logics with Concatenation Logics.. LACL, volume 1582 of Lecture Notes in Computer Science, page 200-211. Springer, (1997)Fairness in Context-Free Grammars under Canonical Derivations., and . STACS, volume 182 of Lecture Notes in Computer Science, page 255-266. Springer, (1985)A Proof Theory for First-order Logic with Definiteness., and . FLAP, (2017)Program verification.. International computer science series Addison-Wesley, (1992)An Experimental Implementation of CSP., and . ICDCS, page 126-136. IEEE Computer Society, (1981)Appraising Fairness in Languages for Distributed Programming., , and . POPL, page 189-198. ACM Press, (1987)Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars., , and . Essays in Memory of Amir Pnueli, volume 6200 of Lecture Notes in Computer Science, page 144-166. Springer, (2010)A Compete Proof Rule for Strong Equifair Termination., , and . Logic of Programs, volume 164 of Lecture Notes in Computer Science, page 257-278. Springer, (1983)De Morgan Interpretation of the Lambek-Grishin Calculus., and . Rev. Symb. Log., 13 (4): 845-856 (2020)