Sciweavers

99 search results - page 4 / 20
» Building Compilers by Combining Algebras
Sort
View
PLILP
1998
Springer
13 years 10 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
TLCA
2007
Springer
14 years 12 days ago
Initial Algebra Semantics Is Enough!
Initial algebra semantics is a cornerstone of the theory of modern functional programming languages. For each inductive data type, it provides a fold combinator encapsulating struc...
Patricia Johann, Neil Ghani
CN
1998
105views more  CN 1998»
13 years 6 months ago
WebL - A Programming Language for the Web
In this paper we introduce a programming language for Web document processing called WebL. WebL is a high level, object-oriented scripting language that incorporates two novel fea...
Thomas Kistler, Hannes Marais
XIMEP
2005
ACM
126views Database» more  XIMEP 2005»
13 years 12 months ago
Purely Relational FLWORs
We report on a compilation procedure that derives relational algebra plans from arbitrarily nested XQuery FLWOR blocks. While recent research was able to develop relational encodi...
Torsten Grust
HICSS
1997
IEEE
120views Biometrics» more  HICSS 1997»
13 years 10 months ago
Building the 4 Processor SB-PRAM Prototype
The SB-PRAM is a massively parallel, uniform memory access (UMA) shared memory computer. The main ideas of the design are multithreading on instruction level, hashing of the addre...
Peter Bach, Michael Braun, Arno Formella, Jör...