MPC
2010
Springer
13 years 6 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
MPC
2010
Springer
13 years 6 months ago
2010
Springer
MPC
2010
Springer
13 years 8 months ago
2010
Springer
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
MPC
2010
Springer
13 years 8 months ago
2010
Springer
MPC
2010
Springer
13 years 8 months ago
2010
Springer
MPC
2010
Springer
13 years 8 months ago
2010
Springer
MPC
2010
Springer
13 years 9 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
MPC
2010
Springer
13 years 9 months ago
2010
Springer
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
MPC
2010
Springer
13 years 9 months ago
2010
Springer
MPC
2010
Springer
13 years 9 months ago
2010
Springer
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...