Sciweavers

4498 search results - page 134 / 900
» How to Invent Functions
Sort
View
GI
2009
Springer
14 years 2 months ago
Reinventing Haskell Backtracking
: Almost ten years ago, Ralf Hinze has written a functional pearl on how to derive backtracking functionality for the purely functional programming language Haskell. In these notes...
Sebastian Fischer
JOT
2007
121views more  JOT 2007»
13 years 10 months ago
Aspect Oriented Programming in .NET. Based on Attributes
Aspect Oriented Programming proposes an approach to increase code functionality with aspects that are not part of the main code functionality. The current work shows how can be do...
Miguel Katrib Mora, Yamil Hernández Sa&aacu...
CAISE
1999
Springer
14 years 2 months ago
Towards a Classification Framework for Application Granularity in Workflow Management Systems
The support of process enactment through the use of workflow management systems has gained considerable attention within the last few years. We develop a classification framework c...
Jörg Becker, Michael zur Muehlen
DAGSTUHL
2007
13 years 11 months ago
Measuring Ranks via the Complete Laws of Iterated Contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
Wolfgang Spohn
CRYPTO
2012
Springer
219views Cryptology» more  CRYPTO 2012»
12 years 19 days ago
Tamper and Leakage Resilience in the Split-State Model
It is notoriously difficult to create hardware that is immune from side channel and tampering attacks. A lot of recent literature, therefore, has instead considered algorithmic de...
Feng-Hao Liu, Anna Lysyanskaya