59 citations · 92 across the 9 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.PL2023★ 2 cited
Explicit Refinement Types
Jad Elkhaleq Ghalayini, Neel Krishnaswami
We present λert, a type theory supporting refinement types with explicit proofs. Instead of solving refinement constraints with an SMT solver like DML and Liquid Haskell, our syste…
cs.PL2023★ 10 cited
flap: A Deterministic Parser with Fused Lexing
Jeremy Yallop, Ningning Xie, Neel Krishnaswami
Lexers and parsers are typically defined separately and connected by a token stream. This separate definition is important for modularity and reduces the potential for parsing ambi…