{"@context":"https://w3id.org/codemeta/3.0","@type":"SoftwareSourceCode","identifier":"pkg:hackage/data-combinator-gen","name":"data-combinator-gen","description":"This library provides a function to generate a special combinator from any data type (GADTs are not currently supported).\nThis was inspired by the recursion-schemes library where they have a function to automagically generate a base functor. Although, this new base functor data type has custom constructors and to define the *-morphism algebras turns into boring pattern matching.\nSo, this library provides a function called makeCombinator that produces a\nnice combinator to deal with data types as they were defined in terms of Pairs\n( (,) ) and Sums (Either). With this nice combinator we are able to view a\ndata type as its equivalent categorical isomorphism and manipulate it with an\ninterface similar as the either function provided from base.","version":"0.1.0.4","softwareVersion":"0.1.0.4","license":"https://spdx.org/licenses/MIT","codeRepository":"https://github.com/bolt12/data-combinator-gen","issueTracker":"https://github.com/bolt12/f-algebra-gen/issues","url":"https://github.com/bolt12/data-combinator-gen","keywords":["data","library","mit","Propose Tags"],"programmingLanguage":{"@type":"ComputerLanguage","name":"Haskell"},"maintainer":[{"@type":"Person","name":"bolt12"}],"author":[{"@type":"Person","name":"bolt12"}],"copyrightHolder":[{"@type":"Person","name":"bolt12"}],"dateCreated":"2019-05-21","dateModified":"2019-05-26","datePublished":"2019-05-26","copyrightYear":2019,"downloadUrl":"https://hackage.haskell.org/package/data-combinator-gen-0.1.0.4/data-combinator-gen-0.1.0.4.tar.gz","applicationCategory":"hackage","runtimePlatform":"hackage","developmentStatus":"active","sameAs":["https://hackage.haskell.org/package/data-combinator-gen"],"https://www.w3.org/ns/activitystreams#likes":10}