7 citations · 12 across the 9 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.PL2022
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions
Dániel Horpácsi, Péter Bereczky, Simon Thompson
We aim to reason about the correctness of behaviour-preserving transformations of Erlang programs. Behaviour preservation is characterised by semantic equivalence. Based upon our e…
cs.LO2022★ 7 cited
Mechanizing Matching Logic In Coq
Péter Bereczky, Xiaohong Chen, Dániel Horpácsi +2
Matching logic is a formalism for specifying, and reasoning about, mathematical structures, using patterns and pattern matching. Growing in popularity, it has been used to define m…