136 search results - page 21 / 28 » Typed Logical Variables in Haskell |
182
Voted
ICLP
2011
Springer
14 years 6 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
207
Voted
UC
2010
Springer
15 years 1 months ago
2010
Springer
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
217
click to vote
POPL
2005
ACM
16 years 3 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...
143
Voted
PEPM
2009
ACM
16 years 7 days ago
2009
ACM
We show that a wide class of bidirectional data-flow analyses and program optimizations based on them admit declarative descriptions in the form of type systems. The salient feat...
127
Voted
APLAS
2000
ACM
15 years 7 months ago
2000
ACM
We have implemented Kima, an automated error correction system for concurrent logic programs. Kima corrects near-misses such as wrong variable occurrences in the absence of explici...