207 search results - page 15 / 42 » Elementary Strong Functional Programming |
BIRTHDAY
2000
Springer
14 years 1 days ago
2000
Springer
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
FOAL
2007
ACM
13 years 11 months ago
2007
ACM
We consider the problem of adding aspects to a strongly typed language which supports type classes. We show that type classes as supported by the Glasgow Haskell Compiler can mode...
CAV
2009
Springer
14 years 8 months ago
2009
Springer
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
ANOR
2005
13 years 7 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...