What is it about?
In a declarative programming language like Haskell, the developer describes the desired solution using equations, without too much concern for the operational details of obtaining solutions. Not all recursive equations can be solved by “normal“ Haskell, for example when they describe finite sets. We explore a language extension (implemented as a library) that allows that.
Featured Image
Photo by Max Harlynking on Unsplash
Why is it important?
Declarative programming is where Functional Programming can shine, and our approach allows to apply these idioms to a wider range of problems.
Perspectives
In writing this paper, my understanding of declarativety, purity and laziness has refined.
Joachim Breitner
Read the Original
This page is a summary of: More Fixpoints! (Functional Pearl), Proceedings of the ACM on Programming Languages, August 2023, ACM (Association for Computing Machinery),
DOI: 10.1145/3607853.
You can read the full text:
Resources
Contributors
The following have contributed to this page
