Sciweavers

108 search results - page 4 / 22
» Types for Hereditary Permutators
Sort
View
CORR
2007
Springer
91views Education» more  CORR 2007»
13 years 7 months ago
On types of growth for graph-different permutations
János Körner, Gábor Simonyi, Bl...
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 7 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
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 ...
Zachary Snow, David Baelde, Gopalan Nadathur
ICISS
2009
Springer
13 years 5 months ago
On Some Weaknesses in the Disk Encryption Schemes EME and EME2
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...
Cuauhtemoc Mancillas-López, Debrup Chakrabo...
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
13 years 7 months ago
The Skew and Relative Derangements of Type B
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...
William Y. C. Chen, Jessica C. Y. Zhang
TLCA
2007
Springer
14 years 1 months ago
Higher-Order Logic Programming Languages with Constraints: A Semantics
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...
James Lipton, Susana Nieva