Sciweavers

62 search results - page 2 / 13
» Lightweight Family Polymorphism
Sort
View
HASKELL
2008
ACM
13 years 6 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
HASKELL
2007
ACM
13 years 9 months ago
A lightweight interactive debugger for haskell
This paper describes the design and construction of a Haskell source-level debugger built into the GHCi interactive environment. We have taken a pragmatic approach: the debugger i...
Simon Marlow, José Iborra, Bernard Pope, An...
ENTCS
2007
100views more  ENTCS 2007»
13 years 5 months ago
Lightweight Static Capabilities
We describe a modular programming style that harnesses modern type systems to verify safety conditions in practical systems. This style has three ingredients: (i) A compact kernel...
Oleg Kiselyov, Chung-chieh Shan
IACR
2011
243views more  IACR 2011»
12 years 5 months ago
Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers
The block cipher family for lightweight devices, KTANTAN, is analyzed in this paper. We propose a new cryptanalysis method which improves results of Meet-in-the-Middle attacks on K...
Bo Zhu, Guang Gong
OOPSLA
1995
Springer
13 years 8 months ago
Subtypes vs. Where Clauses: Constraining Parametric Polymorphism
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
Mark Day, Robert Gruber, Barbara Liskov, Andrew C....