Theory of Computing Systems

, Volume 43, Issue 3, pp 362–393

Datatype-Generic Termination Proofs

Article

DOI: 10.1007/s00224-007-9056-z

Cite this article as:
Backhouse, R. & Doornbos, H. Theory Comput Syst (2008) 43: 362. doi:10.1007/s00224-007-9056-z
  • 42 Downloads

Abstract

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.

Keywords

DatatypeGeneric programmingRelation algebraAllegoryProgramming methodology

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.School of Computer Science and Information TechnologyUniversity of NottinghamNottinghamUK
  2. 2.QuestanceGroningenThe Netherlands