Theory of Computing Systems

, Volume 43, Issue 3, pp 362-393

First online:

Datatype-Generic Termination Proofs

  • Roland BackhouseAffiliated withSchool of Computer Science and Information Technology, University of Nottingham Email author 
  • , Henk DoornbosAffiliated withQuestance

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Datatype-generic programs are programs that are parameterised by a datatype. We review the allegorical foundations of a methodology of designing datatype-generic programs. The notion of F-reductivity, where F parametrises a datatype, is reviewed and a number of its properties are presented. The properties are used to give concise, effective proofs of termination of a number of datatype-generic programming schemas. The paper concludes with a concise proof of the well-foundedness of a datatype-generic occurs-in relation.


Datatype Generic programming Relation algebra Allegory Programming methodology