# Tagging solutions. Something missing?

Regarding Tagging solutions | Exercism's Docs I see assorted arithmetic operations but nothing about power or exponentiation. Am I missing something @ErikSchierboom ? Or is it implied in multiplication. But then, why have multiplication as that’s just lots of addition.

If they’re not there, it just because C# doesn’t have them as explicit operators. It’s fine to add them if your language does.

Also, are `paradigm:stack-oriented` or `paradigm:concatenative` permissible or do we die a death of a thousand qualifications and sub-qualifications?

We probably don’t want to list all paradigms, but I think these are fine to add :)

When you say “construct:constant” do you mean `const int a = 1;` or do you mean `1`?

In the case of

``````: is_question \ s -- b
s:trim 1 s:rsub "?" s:=
;
``````

the question mark is a constant.

8th does have a `const`:

``````ok> help const

G:const \ x -- y

Generally used in the case where a container item is compiled into a word, and the container itself is not to be
modified.  Has the effect of clone nip.

``````

but it would seem to be different from C#'s.

And then there’s assgnment. In one sense, `dup` is an assignment insofar as it duplicates the top element on the stack and then assigns the duplicate to an address in the stack. In the other sense, that of assigning a value to a var, well we have a different notation for that: `var` and `var,` to declare and `!` and `@` to store and recall.

Essentially, I’m struggling with categories derived from C# and trying to fit FORTH into them; sometimes it’s square peg in round hole.

cc: @iHiD

Is this sufficient or do you want it formatted in a particular way?

``````--hello-world
construct:colon-definition
construct:string
uses:informal SED
--two-fer
technique:boolean-logic
construct:colon-definition
construct:if
construct:boolean
construct:null
construct:string
uses:informal SED
uses:string-format
--bob
technique:boolean-logic
technique:regular-expression
construct:logical-and
construct:logical-not
construct:colon-definition
construct:if
construct:boolean
construct:number
construct:string
construct:int
construct:array
uses:informal SED
--leap
technique:boolean-logic
construct:colon-definition
construct:if
construct:divide
construct:boolean
construct:number
construct:int
uses:informal SED
--triangle
technique:boolean-logic
construct:colon-definition
construct:if
construct:subtract
construct:boolean
construct:number
construct:int
uses:informal SED
uses:r-stack
--collatz-conjecture
technique:bit-manipulation
technique:recursion
construct:colon-definition
construct:if
construct:bitwise-and
construct:multiply
construct:subtract
construct:boolean
construct:null
construct:number
construct:int
uses:informal SED
--armstrong-numbers
technique:boolean-logic
technique:higher-order-functions
technique:type-conversion
construct:explicit-conversion
construct:lambda
construct:variable
construct:colon-definition
construct:exponentiation
construct:boolean
construct:null
construct:number
construct:string
construct:int
construct:array
uses:informal SED
--isogram
technique:boolean-logic
technique:higher-order-functions
technique:regular-expression
technique:sorting
construct:explicit-conversion
construct:lambda
construct:colon-definition
construct:boolean
construct:string
construct:array
uses:informal SED
--acronym
technique:higher-order-functions
technique:regular-expression
construct:explicit-conversion
construct:lambda
construct:colon-definition
construct:string
construct:array
uses:informal SED
--gigasecond
construct:explicit-conversion
construct:colon-definition
construct:date-time
uses:informal SED
--trinary
technique:higher-order-functions
construct:colon-definition
construct:break
construct:if
construct:multiply
construct:subtract
construct:exponentiation
construct:boolean
construct:number
construct:string
construct:int
uses:informal SED
uses:r-stack
--darts
construct:colon-definition
construct:if
construct:exponentiation
construct:boolean
construct:number
construct:int
construct:float
uses:informal SED
--series
technique:boolean-logic
technique:higher-order-functions
construct:colon-definition
construct:if
construct:number
construct:string
construct:int
construct:array
uses:r-stack
--atbash-cipher
technique:boolean-logic
technique:higher-order-functions
technique:regular-expression
construct:explicit-conversion
construct:colon-definition
construct:if
construct:subtract
construct:boolean
construct:number
construct:string
construct:int
uses:informal SED
--resistor-color
technique:boolean-logic
construct:indexer
construct:colon-definition
construct:number
construct:string
construct:int
construct:array
uses:informal SED
--etl
technique:higher-order-functions
construct:explicit-conversion
construct:lambda
construct:colon-definition
construct:string
construct:array
construct:dictionary
uses:informal SED
--pop-count
I’m differentiating between formal and informal SEDs. A formal stack effect diagram actually uses the word `SED` and is detected by SED-checking tools. An informal SED is just a `\ before -- after` .