All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

Implementing Profunctor Equipment in Haskell: A Toy Implementation for Programmers

By

g0xA52A2A

15d ago· 4 min readenInsight

Summary

The article discusses a toy implementation of profunctor equipment in Haskell, building on previous work. The author aims to make the concept more accessible to programmers by using Haskell's type system for compiler verification, while acknowledging that a full implementation would require a dependently typed language. The implementation is restricted to a single category with endo-functors and endo-profunctors to provide basic intuitions.

Key quotes

· 2 pulled
The advantage of this encoding is that it can be verified by the compiler, and I still trust the compiler more than I trust the AI.
A more adequate implementation would require a full-blown dependently typed language, but if we restrict ourselves to just a single category and work only with endo-functors and endo-profunctors, we can get at least some intuitions.
Snippet from the RSS feed
Previously: Profunctor Equipment. To make things more palatable for programmers, I decided to provide a toy implementation of some of the equipments in Haskell. The advantage of this encoding is th…

You might also wanna read