2 papers
cs.PL2025
Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)
Steven Schaefer, Nathan Varner, Pedro H. Azevedo de Amorim +1
We present Dependent Lambek Calculus, a domain-specific dependent type theory for verified parsing and formal grammar theory. In , linear types are used as a syn…
cs.PL2025
Notions of Stack-manipulating Computation and Relative Monads (Extended Version)
Yuchen Jiang, Runze Xue, Max S. New
Monads provide a simple and concise interface to user-defined computational effects in functional programming languages. This enables equational reasoning about effects, abstractio…