Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Abstract. Tweakable enciphering schemes are a certain type of blockcipher mode of operation which provide security in the sense of a strong pseudo-random permutation. It has been p...
By introducing the notion of relative derangements of type B, also called signed relative derangements, which are defined in terms of signed permutations, we obtain a type B anal...
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...