These are word's examples related to are. Click on any word to go to its word's detail page. Or, go to the definition of are.
Assume there are eight electoral districts with three voters each.
In such situations there are minimal incentives for strategic voting and maximal for sincere voting.
Slots are initialized with their default value unless a user value is specified.
No memory is allocated for width and height, as their values are computed each time they are accessed.
The template instantiator and the prettyprinter are reusable components.
From now on terms of the -calculus are considered module -equivalence.
Indeed, we are currently working on adding just such syntactic sugar: lambdas, let-bindings, donotation for monads, etc.
The programs are faithful translations of each other, in that they each represent the same solution to the given problem.
One or more states are start states, unless the automaton is empty.
The flattening and unflattening functions are mutually recursive.
Only if both lists are blocked will the output list be blocked.
Entries in sub-directories are not, however, considered to form part of the directory contents.
Tokens in normal form are quoted strings ("foo").
Note that allocations are the same for every run, so allocation numbers are accurate.
There are sound justifications for these choices that go beyond our desire for a simple implementation.
