Automated transformation of BMF programs

Transformation is key to any program improvement process and a key to successful transformation is the medium in which it takes place. BMF (Bird-Meertens Formalism)is a medium specialised for program improvement via incremental ransformation. While much theoretical work exists, there has, to date, been a paucity of actual implementations employing BMF in an automated process of program improvement. In this paper we describe such an implementation, targeted to distributed architectures

Generic Theorem Proving Using HOL2P: A Category Theory Inspired Approach

Abstract Integrating formal program verification into mainstream software development has proven to be quite challenging, due to the level of abstract mathematical machinery needed. Although there have been some successes, most existing methods do not adequately support the mechanical verification of generic programs. This thesis seeks to fill this gap by presenting a formalisation and implementation of a category theory inspired approach to generic program specification. Theorems to simplify verification of generic programs are developed along with a formal framework for reasoning. The result is theorem proving support based on type quantification and type operator variables in HOL, HOL2P. This is demonstrated by the verification the Yoenda Lemma

Dynamic Order-Sorted Term-Rewriting Systems

This thesis considers the problems of order-sorted equational logic and its operational interpretation, order-sorted term rewriting