Sciweavers

65 search results - page 3 / 13
» Generic Haskell: Practice and Theory
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Packet Classification Algorithms: From Theory to Practice
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
Yaxuan Qi, Lianghong Xu, Baohua Yang, Yibo Xue, Ju...
ESOP
2000
Springer
13 years 11 months ago
Type Classes with Functional Dependencies
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
Mark P. Jones
POPL
2004
ACM
14 years 8 months ago
Formalization of generics for the .NET common language runtime
We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspects of the implementation: mixed specialization a...
Dachuan Yu, Andrew Kennedy, Don Syme
ATVA
2009
Springer
173views Hardware» more  ATVA 2009»
14 years 2 months ago
Solving Parity Games in Practice
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
Oliver Friedmann, Martin Lange
IFIP
2000
Springer
13 years 11 months ago
Implementing Open Network Technologies in Complex Work Practices: A Case from Telemedicine
New non-desktop technologies may turn out to be of a more open and generic nature than traditional information technologies. These technologies consequently pose novel challenges ...
Margunn Aanestad, Ole Hanseth