<html><head><meta http-equiv="Content-Type" content="text/html; charset=utf-8"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class="">Looks nice.<div class=""><br class=""></div><div class="">I’ve been wondering about how to balance between higher-order functions, generator/list comprehension syntax, and standard imperative loops.</div><div class="">It seems to me that the first is more natural for most verification languages, whereas the last may be most natural to programmers/spec authors.</div><div class="">Are comprehensions a good middle-ground? Are they even more confusing to programmers?</div><div class=""><br class=""></div><div class="">-Karthik</div><div class=""><div><br class=""><blockquote type="cite" class=""><div class="">On 17 Feb 2018, at 23:04, Adam Chlipala <<a href="mailto:adamc@csail.mit.edu" class="">adamc@csail.mit.edu</a>> wrote:</div><br class="Apple-interchange-newline"><div class="">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" class="">
<div text="#000000" bgcolor="#FFFFFF" class="">
One small suggestion for Poly1305: I've created <a moz-do-not-send="true" href="https://github.com/HACS-workshop/hacspec/pull/6" class="">a PR</a>
that redoes polynomial evaluation with comprehensions, in a
different way. I expect this version should be easier to translate
to backends we care about.<br class="">
<br class="">
What do you think?<br class="">
</div>
_______________________________________________<br class="">Hacspec mailing list<br class=""><a href="mailto:Hacspec@moderncrypto.org" class="">Hacspec@moderncrypto.org</a><br class="">https://moderncrypto.org/mailman/listinfo/hacspec<br class=""></div></blockquote></div><br class=""></div></body></html>