Sciweavers

2206 search results - page 3 / 442
» On the power of coercion abstraction
Sort
View
LFP
1990
73views more  LFP 1990»
13 years 7 months ago
Computing with Coercions
d Abstract) V. Breazu-Tannen C. A. Gunter A. Scedrov University of Pennsylvania This paper relates two views of the operational semantics of a language with multiple
Val Tannen, Carl A. Gunter, Andre Scedrov
CSFW
2010
IEEE
13 years 9 months ago
A Game-Based Definition of Coercion-Resistance and Its Applications
Coercion-resistance is one of the most important and intricate security requirements for voting protocols. Several definitions of coercion-resistance have posed in the literature,...
Ralf Küsters, Tomasz Truderung, Andreas Vogt
JSC
2002
84views more  JSC 2002»
13 years 5 months ago
A Constructive Algebraic Hierarchy in Coq
We describe a framework of algebraic structures in the proof assistant Coq. We have developed this framework as part of the FTA project in Nijmegen, in which a constructive proof ...
Herman Geuvers, Randy Pollack, Freek Wiedijk, Jan ...
ICTCS
2005
Springer
13 years 11 months ago
A Typed Semantics of Higher-Order Store and Subtyping
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
Jan Schwinghammer
POPL
2010
ACM
14 years 3 months ago
Threesomes, With and Without Blame
Abstract. The blame calculus of Wadler and Findler gives a high-level semantics to casts in higher-order languages. The coercion calculus of Henglein, on the other hand, provides a...
Jeremy G. Siek, Philip Wadler