2 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.PL2022★ 2 cited
ZK-SecreC: a Domain-Specific Language for Zero Knowledge Proofs
Dan Bogdanov, Joosep Jääger, Peeter Laud +6
We present ZK-SecreC, a domain-specific language for zero-knowledge proofs. We present the rationale for its design, its syntax and semantics, and demonstrate its usefulness on the…
cs.PL2020
Equational Reasoning for MTL Type Classes
Härmel Nestra
Ability to use definitions occurring in the code directly in equational reasoning is one of the key strengths of functional programming. This is impossible in the case of Haskell t…
cs.PL2017
Alignment Elimination from Adams' Grammars
Härmel Nestra
Adams' extension of parsing expression grammars enables specifying indentation sensitivity using two non-standard grammar constructs --- indentation by a binary relation and alignm…