Sciweavers

120 search results - page 6 / 24
» Generative type abstraction and type-level computation
Sort
View
CADE
2004
Springer
14 years 7 months ago
Automatic Generation of Classification Theorems for Finite Algebras
Abstract. Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this ha...
Simon Colton, Andreas Meier, Volker Sorge, Roy L. ...
SAIG
2000
Springer
13 years 11 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor
MFCS
2000
Springer
13 years 11 months ago
XML Grammars
Abstract. XML documents are described by a document type definition (DTD). An XML-grammar is a formal grammar that captures the syntactic features of a DTD. We investigate properti...
Jean Berstel, Luc Boasson
GD
2004
Springer
14 years 24 days ago
Computing Radial Drawings on the Minimum Number of Circles
A radial drawing is a representation of a graph in which the vertices lie on concentric circles of finite radius. In this paper we study the problem of computing radial drawings ...
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta,...
ECCC
2007
144views more  ECCC 2007»
13 years 7 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III