—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For m...
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...