omelkonian/presentations
My presentations.
2023-2026: Formal Methods @input-output-hk, 2019-2023: PhD @ University of Edinburgh, Interests: Programming Languages, Type Theory, Formal Verification
My presentations.
Formally verified analysis of Homer's Iliad.
Mechanising the metatheory of the Verse Calculus in Agda.
Set up your GitHub Actions workflow with a specific version of Agda (+ stdlib + libraries from git repos)
Formalization of the UTxO abstract model for (bitcoin-style) blockchain transactions.
My personal webpage
A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of small languages.
Prototyping an Agda backend to generate training data for machine learning.
Relational utilities for Agda:
My profile README.
AlgoRhythm: A Haskell library for algorithmic music composition.
An Agda backend for visualizing lemma dependencies.
Irrelevance utitilites for the Agda standard library.
Separation logic for UTXO-based blockchain ledgers
Meta-grammar utilities for multi-dimensional Dyck languages.
Rustic skeleton for developing a new Agda backend.
Rust backend for Agda.
Simple extension of Agda's standard library for personal use.
A mechanized model of Magic: The Gathering rules.
Several grammars for automatic music composition using Probabilistic Temporal Graph Grammars (PTGG).
Sources of the EuroProofNet web site.
Formalization of the Bitcoin Modelling Language (BitML).
Formal model of Bitcoin transactions in Agda
Investigating different ways of modelling a minimal process calculus in Agda.
Parser and pretty-printer for the Rust language
Rustic lenses library for Agda, equipped with automatic generic deriving.
Separation logic for *UTXO*-based blockchain ledgers
Lifting bash functions to executable bash scripts.
Compiling Agda code to readable Haskell