2019 search results - page 246 / 404 » Programming with Shared Data Abstractions |
217
click to vote
POPL
2005
ACM
16 years 3 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
126
click to vote
FMCAD
2009
Springer
15 years 9 months ago
2009
Springer
—Boolean manipulation and existential quantification of numeric variables from linear arithmetic (LA) formulas is at the core of many program analysis and software model checkin...
PPDP
2001
Springer
15 years 7 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
132
click to vote
ESOP
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The pure pattern calculus generalises the pure lambda-calculus by basing computation on pattern-matching instead of beta-reduction. The simplicity and power of the calcul...
101
click to vote
ICIP
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper we present a coherent approach using the hierarchical HMM with shared structures to extract the structural units that form the building blocks of an education/traini...