3 citations · 5 across the 4 of their papers we have counts for
4 papers
Nominal techniques as an Agda library
Murdoch J. Gabbay, Orestis Melkonian
Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal…
Learning Structure-Aware Representations of Dependent Types
Konstantinos Kogkalidis, Orestis Melkonian, Jean-Philippe Bernardy
Agda is a dependently-typed programming language and a proof assistant, pivotal in proof formalization and programming language theory. This paper extends the Agda ecosystem into m…
Reconciling Event Structures with Modern Multiprocessors
Evgenii Moiseenko, Anton Podkopaev, Ori Lahav +2
Weakestmo is a recently proposed memory consistency model that uses event structures to resolve the infamous "out-of-thin-air" problem. Although it has been shown to have important…
Having Fun in Learning Formal Specifications
I. S. W. B. Prasetya, Craig Q. H. D. Leek, Orestis Melkonian +11
There are many benefits in providing formal specifications for our software. However, teaching students to do this is not always easy as courses on formal methods are often experie…