How the Symbol Management Problem decomposes into two parts: Redundancy

When you have two or more terms that mean the same thing.
The redundancy problem can be solved through term reconciliation, essentially denoting, in a machine-readable-form, that a certain term in one vocabulary means the same thing as a certain term in another. Collision
When you have the same term that means two or more things.
The collision problem is solved through namespaces, which, when fully-qualified URIs, are by design impossible to collide

Naming booleans Use affirmative statement that evaluates to either true or false

// Same order, erase the dot and you got yourself a variable name.
bool userIsActive = user.isActive;

// Order changed, statement suddenly became a question.
// Also have to bother about moving words around.
bool isUserActive = user.IsActive;

https://en.wikipedia.org/wiki/Naming_convention_(programming)#Positional_notation https://en.wikipedia.org/wiki/Propositional_calculus

show intention

Would the name change if the implementation changes?
Would the name change if the usage changes? If so, it's probably not a very good name.

context

types

hungarian notation
propsitional notation
composite word scheme

tool

See

quality-without-a-name

tool

See

Links