Sciweavers

251 search results - page 19 / 51
» Pure Type Systems without Explicit Contexts
Sort
View
HASKELL
2006
ACM
14 years 1 months ago
Polymorphic variants in Haskell
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
Koji Kagawa
CASES
2007
ACM
13 years 11 months ago
A self-maintained memory module supporting DMM
The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management (DMM); however, it is a challeng...
Weixing Ji, Feng Shi, Baojun Qiao
CADE
2001
Springer
14 years 8 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
DAGSTUHL
2006
13 years 9 months ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos
CRYPTO
2009
Springer
105views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Privacy-Enhancing Auctions Using Rational Cryptography
Abstract. We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, ou...
Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Tr...