A Domain-specific Language for Gabriel- Zisman

Sammanfattning

In this thesis, a domain-specific language (DSL) in the functional programminglanguage Haskell is being developed for representing the mathematical structureof simplicial sets, which are collections of n-dimensional geometric objects builtfrom points. As the central component, the Gabriel–Zisman algorithm is beingimplemented, a procedure operating on simplicial sets that systematically fills gapsin a certain class of composite shapes by filling their hollow constituents. Thisalgorithm will enable researchers to explore computer-instances of simplicial setsand to automate the algorithm showing whether filling these constituent parts issufficient to complete the composite structure. Completing this task will enablethe DSL to support a broader range of algorithms and modelling tasks, potentiallydefining more complex fillings and other relevant mathematical structures