4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.PL2020★ 1 cited
A Comparison of Big-step Semantics Definition Styles
Péter Bereczky, Dániel Horpácsi, Simon Thompson
Formal semantics provides rigorous, mathematically precise definitions of programming languages, with which we can argue about program behaviour and program equivalence by formal m…
cs.PL2020★ 4 cited
A Proof Assistant Based Formalisation of Core Erlang
Péter Bereczky, Dániel Horpácsi, Simon Thompson
Our research is part of a wider project that aims to investigate and reason about the correctness of scheme-based source code transformations of Erlang programs. In order to formal…