403 search results - page 44 / 81 » Contracts for higher-order functions |
132
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. In the first part of this article we introduce the notion of a backwardforward conditioning (BFC) system that generalises the notion of zero-class admissibiliy introduce...
150
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
165
click to vote
ICASSP
2009
IEEE
16 years 25 days ago
2009
IEEE
Sound field reproduction methods like higher order Ambisonics which are based on orthogonal expansions always introduce a limitation of the spatial bandwidth of the secondary sou...
159
click to vote
TAPSOFT
1993
Springer
15 years 10 months ago
1993
Springer
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
160
click to vote
ASIACRYPT
2006
Springer
15 years 9 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...