In this paper, an algorithm language L is suggested both as a tool to
express algorithm and as a model language for semantic study The concr
ete syntax, abstract syntax and static semantics oft are presented at
length. The design principle oft is also described, and the comparison
with PASCAL is demonstrated by a couple of examples.