Abstract

Introduction CL (Clausal Language) is an extremely simple, yet powerful, programming and specification language which is coupled with its own proof system. CL has a precise characterization of both its definable functions and provable properties. The former are exactly the unary primitive recursive functions and the latter correspond exactly to the \Pi 2 -theorems of I \Sigma 1 -arithmetic which is a rather simple fragment of the well-known Peano arithmetic (see [9]). The fact that the functions of CL are over natural numbers and that their properties are proved in Peano arithmetic is extremely important for its intended application in teaching at the introductory levels of undegraduate studies. We use CL in three courses: Declarative programming, Program verification, and Specification of programs and data. Our experience (and the marks we get from students in teacher evaluations)

Citations