3 papers
cs.LO2026
Strict Equality in Higher Identity Types: Axioms, Completeness, Decidability
Keri D'Angelo, Liron Cohen, Luke Serafin +1
Reasoning about higher identity types uses two equalities, strict equality and equivalence of cells witnessed by a path. Strict equality is a congruence for every operation on cell…
cs.FL2023
A Coalgebraic Approach to Reducing Finitary Automata
Keri D'Angelo, Alexandra Silva, Gerco van Heerdt +1
Compact representations of automata are important for efficiency. In this paper, we study methods to compute reduced automata, in which no two states accept the same language. We d…
cs.IT2023
Abstract Huffman Coding and PIFO Tree Embeddings
Keri D'Angelo, Dexter Kozen
Algorithms for deriving Huffman codes and the recently developed algorithm for compiling PIFO trees to trees of fixed shape (Mohan et al. 2022) are similar, but work with different…