1017 search results - page 166 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
157
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Despite the extensiveness of recent investigations on static typing for XML, parametric polymorphism has rarely been treated. This well-established typing discipline can also be u...
LACL
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
104
click to vote
TYPES
1998
Springer
15 years 1 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
70
Voted
CAP
2010
14 years 4 months ago
2010
How much of existing computer algebra libraries is amenable to automatic parallelization? This is a difficult topic, yet of practical importance in the era of commodity multicore ...
ECOOP
1998
Springer
15 years 1 months ago
1998
Springer
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...