论文标题
budge：一种编程语言和定理供奉献者
Budge: a programming language and a theorem prover
论文作者
论文摘要
我们提出了一种基于Gödel编号和主要分解的简单编程语言，并通过明确的范围循环增强，可以轻松进行程序组成。此外，我们将提出一个允许表达正式系统和合作的定理宣传员。定理供奉献很简单，因为它仅依赖替代规则，并设置了得出定理的平等。最后，我们将代表定理示意剂中的编程语言。我们将展示两者的语法和语义，然后提供一些示例程序及其评估。
We present a simple programming language based on Gödel numbering and prime factorization, enhanced with explicit, scoped loops, allowing for easy program composition. Further, we will present a theorem prover that allows expressing and working with formal systems. The theorem prover is simple as it relies merely on a substitution rule and set equality to derive theorems. Finally, we will represent the programming language in the theorem prover. We will show the syntax and semantics of both, and then provide a few example programs and their evaluation.
