Proof of equivalence of semantic methods for a selected domain-specific language

This paper focuses on the formal semantics of programming languages, with a specific focus on Domain-Specific Languages (DSLs). It introduces the Robot DSL, characterized by total semantic functions, an infinite network size, and an obstacle-free environment. The study explores denotational and natural semantics, aiming to define and prove their equivalence. This work contributes to the understanding of programming languages with unique features, laying the groundwork for future developments in language design and formal semantics.