Abstract: The dynamic denotational semantics of the algorithmic language L is defined. The recursive domain equations containing the function space constructor are not used here. The semantic definitions help to clarify some good mathematical properties of algorithmic language L and may be used to advocate a semantic declarative style with better readability and applicability.