PRSafe: Primitive Recursive Function based Domain Specific Language using LLVM

General Purpose programming languages such as C++, Python suffer from resource management and input errors because they are Turing-complete. The goal of this paper is to introduce a prototype functional Domain Specific Language that is Non-Turing complete called PRSafe. The design of PRSafe is based on the memory and input properties of Primitive Recursive Functions (PRFs). Hence, all computations must terminate. For the language implementation, we use the Lex and Bison softwares for lexing and parsing respectively and LLVM compiler infrastructure for code generation and optimization. PRSafe is designed such that syntactically and semantically, it prohibits the creation of Turing-complete programs. It is eventually intended to be a mathematically verifiable compiler with better user-friendly error-diagnostics for e BPF programs than the eBPF verifier.