Sciweavers

642 search results - page 7 / 129
» Once Upon a Type
Sort
View
ESOP
2009
Springer
13 years 11 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
ITP
2010
178views Mathematics» more  ITP 2010»
13 years 9 months ago
Developing the Algebraic Hierarchy with Type Classes in Coq
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
Bas Spitters, Eelis van der Weegen
ACSC
2007
IEEE
13 years 11 months ago
Cross-Layer Verification of Type Flaw Attacks on Security Protocols
Security protocols are often specified at the application layer; however, application layer specifications give little detail regarding message data structures at the presentation...
Benjamin W. Long, Colin J. Fidge, David A. Carring...
JCS
2007
120views more  JCS 2007»
13 years 7 months ago
Dynamic types for authentication
We propose a type and effect system for authentication protocols built upon a tagging scheme that formalizes the intended semantics of ciphertexts. The main result is that the val...
Michele Bugliesi, Riccardo Focardi, Matteo Maffei
EUSFLAT
2003
13 years 8 months ago
Self-dual types of cycle-transitivity
A general framework for studying the transitivity of reciprocal relations is presented. The key feature is the cyclic evaluation of transitivity: triangles (i.e. any three points)...
Bernard De Baets, Hans De Meyer, Bart De Schuymer