894 search results - page 49 / 179 » Typed Contracts for Functional Programming |
120
click to vote
MPC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
107
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
121
click to vote
JFP
2008
15 years 2 months ago
2008
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
123
click to vote
ECOOP
1998
Springer
15 years 6 months ago
1998
Springer
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
135
click to vote
CRYPTO
2010
Springer
15 years 3 months ago
2010
Springer
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...