Tommi Höynälänmaa <tommi.hoynalan...@gmail.com> writes: > I present here an application of the Hungarian notation for languages using > Lisp-style syntax.
Would you happen to have some references to non-trivial code bases using this notation? It seems interesting, so I would like to see how it looks in real-world projects. > [..] > Pairs are prefixed by p, lists by l Every list can be considered a pair, right? So l- is for proper lists, and p- for the rest? But for example SRFI-1 talks about three different types of lists, but still considers them "lists". Could you go into bit more details when to use p- and when l-? > [..] > Procedures having no side effects and having boolean return value are suffixed > by ?. So unless the procedure has ->bool in it, it should not end in ?? I fairly often write predicates that return either #f or non-#f value but not limited to booleans. Example would be: --8<---------------cut here---------------start------------->8--- (define (env-var-set? var) (getenv var)) --8<---------------cut here---------------end--------------->8--- This returns #f if variable is not set, and the (string) value otherwise. Based on the wording above, this procedure would be misnamed under this notation, since the name ends with ? despite not returning boolean value? Have a nice day, Tomas -- There are only two hard things in Computer Science: cache invalidation, naming things and off-by-one errors.
