Homotopical patch theory*. (13th September 2016)

• Record Type: Journal Article
• Authors: ANGIULI, CARLO; MOREHOUSE, EDWARD; LICATA, DANIEL R.; HARPER, ROBERT
• Is Part Of: Journal of functional programming. Volume 26(2016)
• Publication Date: 2016-09-13
• Subjects: Functional programming (Computer science) -- Periodicals
• DOI: 10.1017/S0956796816000198
• Languages: English
• ISSNs: 0956-7968

Abstract

Abstract: Homotopy type theory is an extension of Martin-Löf type theory, based on a correspondence with homotopy theory and higher category theory. In homotopy type theory, the propositional equality type is proof-relevant, and corresponds to paths in a space. This allows for a new class of datatypes, called higher inductive types, which are specified by constructors not only for points but also for paths. In this paper, we consider a programming application of higher inductive types. Version control systems such as Darcs are based on the notion of patches—syntactic representations of edits to a repository. We show how patch theory can be developed in homotopy type theory. Our formulation separates formal theories of patches from their interpretation as edits to repositories. A patch theory is presented as a higher inductive type. Models of a patch theory are given by maps out of that type, which, being functors, automatically preserve the structure of patches. Several standard tools of homotopy theory come into play, demonstrating the use of these methods in a practical programming context.