Towards an object-oriented progification language

To support formal verification of object-oriented programs we have proposed elsewhere an encoding in the type-theoretic proofchecker Lego. By treating programs and proofs uniformly, the encoding provides object-oriented proving principles — including inheritance of proofs — as analogues to object-oriented programming principles. Though the encoding is suitable for implementing ideas, it is not convenient for developing large verified programs. Here we propose a portmanteau language hopefully better suited to both ends: programming and verification. Although the language could be translated rigorously to λ-terms of the Lego-encoding we sketch the translation informally. We shall argue, along the way, that object-oriented verification can be regarded as a kind of generalized object-oriented programming.