
</a>.
</li>
<li>
If
the
value
is
a
Typed
Literal
and
the
type
is
a
CURIE,
expand
it
to
an
IRI
using
the
<a class="tref internalDFN" title="transformation_map" href="#dfn-transformation_map">
transformation
map
</a>.
</li>
<li>
If
the
final
value
is
an
IRI,
ensure
that
it
is
surrounded
by
angle
brackets.
</li>
</ol>
</li>
<li>
Output
each
sorted
key-value
pair
without
any
extraneous
whitespace.
If
the
value
is
an
associative
array,
perform
this
algorithm,
starting
at
step
#1,
recursively
on
the
sub-tree.
</