Sciweavers

894 search results - page 49 / 179
» Typed Contracts for Functional Programming
Sort
View
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
14 years 2 months ago
Inferring Type Isomorphisms Generically
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...
Frank Atanassow, Johan Jeuring
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 8 months ago
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems
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 ...
Frédéric Blanqui, Colin Riba
JFP
2008
135views more  JFP 2008»
13 years 8 months ago
Hoare type theory, polymorphism and separation
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. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
ECOOP
1998
Springer
14 years 27 days ago
On Object Extension
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...
Luigi Liquori
CRYPTO
2010
Springer
228views Cryptology» more  CRYPTO 2010»
13 years 9 months ago
On Generalized Feistel Networks
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 ...
Viet Tung Hoang, Phillip Rogaway