Adaptive Pattern Matching on Binary Data

Gustafsson, P; Sagonas, K

dc.contributor.author	Gustafsson, P	en
dc.contributor.author	Sagonas, K	en
dc.date.accessioned	2014-03-01T02:49:38Z
dc.date.available	2014-03-01T02:49:38Z
dc.date.issued	2004	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34648
dc.subject	Binary Data	en
dc.subject	Data Format	en
dc.subject	Functional Programming	en
dc.subject	Network Protocol	en
dc.subject	Pattern Matching	en
dc.title	Adaptive Pattern Matching on Binary Data	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-540-24725-8_10	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-24725-8_10	en
heal.publicationDate	2004	en
heal.abstract	Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approach to extend pattern matching to terms without (much of a) structure such as binaries which is the kind of data format that net- work applications typically manipulate. After introducing a notation for match-	en
heal.journalName	European Symposium on Programming	en
dc.identifier.doi	10.1007/978-3-540-24725-8_10	en