Alexandra Silva

A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (Extended Version)

2015 · arXiv (Cornell University)

We present a coinductive framework for defining infinitary analogues of equational reasoning and rewriting in a uniform way. We define the relation =^infty, notion of infinitary equational reasoning, and ->^infty, the standard notion of infinitary …

CoCaml: Functional Programming with Regular Coinductive Types

2017 · Fundamenta Informaticae

Functional languages offer a high level of abstraction, which results in programs that are elegant and easy to understand. Central to the development of functional programming are inductive and coinductive types and associated programming constructs, …

Learning nominal automata

2017 · ACM SIGPLAN Notices

We present an Angluin-style algorithm to learn nominal automata, which are acceptors of languages over infinite (structured) alphabets. The abstract approach we take allows us to seamlessly extend known variations of the algorithm to this …

Bases for algebras over a monad.

2020 · arXiv (Cornell University)

One of the fundamental notions of linear algebra is the concept of a basis for a vector space. In the category theoretic formulation of universal algebra, vector spaces are the Eilenberg-Moore algebras over the free …

A Bunched Logic for Conditional Independence

2021

Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle conditional independence. We extend the logic …

A Categorical Framework for Learning Generalised Tree Automata

2020 · arXiv (Cornell University)

Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to …

RFSeek and Ye Shall Find

2025 · arXiv (Cornell University)

Requests for Comments (RFCs) are extensive specification documents for network protocols, but their prose-based format and their considerable length often impede precise operational understanding. We present RFSeek, an interactive tool that automatically extracts visual summaries …