Archive for the ‘haskell’ Category

Sample Terms for Practical Type Inference for Arbitrary Rank Types

I’ve been heads down following from my past work on Model Driven Architecture, Ontology and Logic(s). The questions that arise naturally in the course of studying these topics lead me to closely examine quantification and type systems. Higher rank types provide both a mechanism for polymorphism and high assurance in the subjects that motivated my study.

Down the Rabbit-Hole with Monad Transformers

Down the Rabbit-Hole with Monad Transformers describes my experience with type families that caused me to learn monad transformers.

High Assurance Functional RDF in Haskell

Higher Assurance Functional RDF in Haskell describes the results of my recent code writing project. The purpose of the project is to demonstrate each of the capabilities suggested by the title above in a working solution and to develop a set of practices to deliver such a solution.