Updatable, single entry, one-short thunks and lambda

[Joachim Breitner]

Dear list,

in the literature, the code and the comments, I often find these
notions:
 * updatable
 * single-entry
 * one-shot
applied to thunks, functions, closures and lambda expressions on
various levels

I have the impression that these are indeed plain synonyms (resp.
antinyms) when it comes to thunks and other closures, and indicate
whether a dynamic instance of this closure is going to be entered once
or more than once, while "one-shot", when applied to a lambda
expression (or, by extension function argument), indicates that this
lambda expression is _called_ at most once for every _evaluation_ of
it.

Is that about right, or are there more pitfalls around?

Greetings,
Joachim


-- 
Joachim “nomeata” Breitner
  mail at joachim-breitner.de • https://www.joachim-breitner.de/
  XMPP: nomeata at joachim-breitner.de • OpenPGP-Key: 0xF0FBF51F
  Debian Developer: nomeata at debian.org

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: This is a digitally signed message part
URL: <http://mail.haskell.org/pipermail/ghc-devs/attachments/20160317/11f310e5/attachment.sig>