Datatype-Generic Termination Proofs

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 pro...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theory of computing systems Ročník 43; číslo 3-4; s. 362 - 393
Hlavní autori: Backhouse, Roland, Doornbos, Henk
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Springer-Verlag 01.12.2008
Springer Nature B.V
Predmet:
Algebra
Allegory
Calculus
Computer programming
Computer Science
Studies
Theorems
Theory of Computation
Relation algebra
Programming methodology
Allegory
Generic programming
Datatype
ISSN:1432-4350, 1433-0490
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-007-9056-z