856 search results - page 47 / 172 » Dependent Types in Practical Programming |
ESOP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We propose a new representation for the domain of Definite Boolean functions. The key idea is to view the set of models of a Boolean function as an incidence relation be...
CPM
2000
Springer
14 years 1 months ago
2000
Springer
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
FSTTCS
1993
Springer
14 years 24 days ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
SAIG
2000
Springer
14 years 8 days ago
2000
Springer
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...
LREC
2010
13 years 10 months ago
2010
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that ther...