Worum es bei uns geht

This group is for developers interested in functional programming. We don't care about the programming language or the platform. We are interested in functional solutions to real-world problems. We only care about the paradigm so be prepared to see discussions about all kind of languages equipped with tools for functional programming (Haskell, F#, Scala, Clojure, Erlang, Elixir, Purescript, Elm, Python, C# or Java8).

For followup discussion join us on gitter: https://gitter.im/cluj-functional-programming/general

We moved our community from G+ so if you want to see our history check out our old place https://plus.google.com/u/0/communities/102726692771621288095

Bevorstehende Events (3)

Proving Hoare logic with Coq.

Benötigt einen Veranstaltungsort

DON'T PANIC Sorry. I just had to use the catchy title. This will be a somewhat free and liberal discussion about what a software property is, and how it can be described and checked. What will you learn? Understanding what a software property is and how to describe it is essential to building better specifications (maybe even verifiable specifications -- see property based testing) for your software. The discussion will only use Hoare logic as an example for some of the fairly basic concepts which are directly applicable to more mundane areas such as type systems or property based testing. Some of the interesting points that I would like to address are: 1. What is [isn't] a software property? 2. A very intuitive understanding of what a logic is. 3. A similarly intuitive understanding of what a semantics is. 4. Viewing typed programming languages as Hoare logic instances (example: the consequence rule explains co/contra variance). 5. Prove a fibonacci program correct (because this IS a FP meetup we must fit fibonacci somehow, somewhere) with Coq (because of the title). 6. [if there is time] Write some javascript code so we come back down to earthly concerns. [there won't be time] Note: This is a proposed meetup and will be scheduled if people show any interest in it. Proposed by: Ometita Radu.

Getting a Fix.

Benötigt einen Veranstaltungsort

Why is Haskell a good language to write DSLs? I will show how rich the DSL support is in Haskell and how it helps you understand the depth of what a DSL truly is. We will start by providing a bit of context on what recursion is (specifically explicit recursion), then I will introduce the simple Fix data combinator and what we can accomplish by moving recursion at the level of types. 1. Introduction: What is an AST? What are pure functions? What is termination / total functions? 2. Defining a DSL with explicit recursion at data level. 3. Abstracting away recursion over ASTs by using a data Fix point. 4. Some recursion schemes: folds, unfolds and one more. 5. Inductive types and bounded recursion. 6. Infinite streams and processing. 7. Fancy words: you just learned about coinductive (recursive) types and corecursion (stream processing) over codata (streams).

Trees all the way down.

Benötigt einen Veranstaltungsort

Why is Haskell a good language to write DSLs? I will show how rich the DSL support is in Haskell and how it helps you understand the depth of what a DSL truly is. Like there are two types of people the ones that understand binary and the ones that don't, there are also two types of trees. 1. Review of enums (sum types), records (product types) and duals. 2. Review of the data level Fix point combinator. 3. Enums and records projected onto trees, with a pinch of Fix. Lets discuss the two... 4. Build a syntax for your language with free monads. 5. Build an interpreter for your language with cofree comonads. 6. But if you think about it an interpreter is just an annotation.. or more..

Vergangene Events (37)

Opinionated web development with Elm

DevNest

Fotos (18)