54 search results - page 5 / 11 » Constructing language processors with algebra combinators |
PEPM
2010
ACM
14 years 7 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
PLILP
1998
Springer
14 years 3 months ago
1998
Springer
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...
CHI
2005
ACM
14 years 11 months ago
2005
ACM
Sign languages have been proven to be natural languages, as capable of expressing human thoughts and emotions as traditional languages are. The distinct visual and spatial nature ...
ICFP
2012
ACM
12 years 1 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
PLDI
2011
ACM
13 years 1 months ago
2011
ACM
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...