Sciweavers

120 search results - page 5 / 24
» Functional Encryption for Regular Languages
Sort
View
POPL
2006
ACM
14 years 6 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
DEBU
2007
83views more  DEBU 2007»
13 years 6 months ago
Regular Expression Matching for Multi-script Databases
Modern database systems mostly support representation and retrieval of data belonging to different scripts and different languages. But the database functions are mostly designed ...
Sudeshna Sarkar
JUCS
2002
119views more  JUCS 2002»
13 years 6 months ago
Error-Correction, and Finite-Delay Decodability
: When the words of a language are communicated via a noisy channel, the language property of error-detection ensures that no word of the language can be transformed to another wor...
Stavros Konstantinidis
ICFP
2010
ACM
13 years 7 months ago
Regular, shape-polymorphic, parallel arrays in Haskell
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
Gabriele Keller, Manuel M. T. Chakravarty, Roman L...
WCRE
2003
IEEE
13 years 11 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse