@inproceedings{eada59d1445c4a8a94b6fc3b0bba2b8e,

title = "Deliverables: A Categorial Approach to Program Development in Type Theory",

abstract = "We describe a method for formally developing functional programs using the “propositions as types” paradigm. The idea is that a function together with its proof of correctness forms a morphism in a category whose objects are input/output specifications. The functionproof pairs, called “deliverables”, can be combined by the operations of a cartesian closed category, indeed by the same operations which are usually used to combine functions. The method has been implemented using the Lego proof assistant and tried on some examples.",

keywords = "Type Theory, Function Component, Correctness Proof, True Predicate, Elimination Rule",

author = "James McKinna and Burstall, {Rod M.}",

note = "Conference code: 18",

year = "1993",

doi = "10.1007/3-540-57182-5_3",

language = "English",

isbn = "9783540571827",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "32--67",

booktitle = "Mathematical Foundations of Computer Science 1993. MFCS 1993",

}