Giter Club home page Giter Club logo

f-algebra-gen's Introduction

Armando Santos 🚀

Haskell Consultant at Well-Typed

🎓 Background:
Holding a Master’s in Computer Engineering from the University of Minho, I've honed my skills around Formal Methods in Software Engineering and Distributed Systems. The intricacies of algebra of programming, abstract mathematics, and elegant library design captivate me.

🔍 Professional Highlights:
Beyond consulting, I'm deeply involved in the Functional Programming community with several contributions to open-source. My recent engagement with the netowrking team at IOG (Cardano blockchain company), has honed my expertise in meshing functional programming with real-time distributed systems.

🛠 Passions & Learning:
My dedication extends beyond just functional programming. I deeply care about program correctness and am passionate about crafting elegant, correct, and composable programs using Denotational Design. Currently, I'm expanding my toolkit by diving into Agda, pushing the boundaries of my understanding in program correctness.

🔗 Let's Connect:
Twitter 🐦 | LinkedIn 🌐

f-algebra-gen's People

Contributors

bolt12 avatar

Stargazers

avatar avatar avatar avatar avatar avatar avatar avatar avatar avatar

Watchers

avatar avatar avatar avatar

f-algebra-gen's Issues

Question about the doc 

...
makeCombinator ''List

This example will generate the following code:

makeCombinator ''ListF
...

Should both of these be List or ListF? Or did you mean the first one to be makeBaseFunctor ''List from recursion-schemes?

Support pattern matching on field types

The way the combinator is generated now, given a type data T a = T (Maybe a) it generates something like:

t f (T a) = f a

but since the Maybe is explicit in the type constructor field, the generator should be smart enough to unfold the Maybe constructors on the pattern matching and generate something like:

t f (T Nothing) = f ()
t f (T (Just a)) = f a

It's easy to see the usefulness and application of cases like this one on larger scale application where, if you have a type that's made by composition of other types (E.g: see https://www.reddit.com/r/haskell/comments/br9z8q/ann_datacombinatorgen10/eojjb5f/) the cardinality grows exponentially and the pattern matching becomes horrendous.

I'm looking to make this possible on the next version of data-combinator-gen but I'm having trouble figuring out the best way to do it. Any help is welcome :)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.