Past work shows that one can associate a notion of Shannon entropy to a Dirichlet
polynomial, regarded as an empirical distribution. Indeed, entropy can be extracted from any …

Partial functions are a key concept in programming. Without partiality a programming
language has limited expressiveness–it is not Turing-complete, hence, it excludes some …

Matching-Logic-Based Understanding of Polynomial Functors and their Initial/Final Models
Page 1 H. Cheval, L. Leustean, A. Sipos (Eds.): 7th Symposium on Working Formal Methods …

The functorial structure of type constructors is the foundation for many definition and proof
principles in higher-order logic (HOL). For example, inductive and coinductive datatypes can …

Coinduction is the dual of induction. While inductive types are ubiquitous in functional
programming languages, coinductive types, also known as codatatypes, are considerably …

The functorial structure of type constructors is the foundation for many definition and proof
principles in higher-order logic (HOL). For example, inductive and coinductive datatypes can …

Induction and coinduction are both used extensively within mathematics and computer
science. Algebraic formulations of these principles make the duality between them apparent …

Zipping and traversal are two of the best-known list operations. Contrary to what one might
expect, these operations are in no way limited to lists. In this thesis, we generalize the zip …

Merkle trees are ubiquitous in blockchains and other distributed ledger technologies (DLTs).
They guarantee that the involved systems are referring to the same binary tree, even if each …

Authenticated data structures allow several systems to convince each other that they are
referring to the same data structure, even if each of them knows only a part of the data …