Posts by Tag

scala

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Solve CNF with Tarjan

17 minute read

Today I want to describe my journey of writing a purely functional implementation for solving 2-satisfiability problem. Essentially it is a problem of assignment of boolean values to the given boolean formula. It is the special case of common bool...

Back to top ↑

functional programming

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

scala cats

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

cats reader

Back to top ↑

scala reader

Back to top ↑

reader monad

Back to top ↑

kafka

Back to top ↑

fs2-kafka

Back to top ↑

algorythms

Solve CNF with Tarjan

17 minute read

Today I want to describe my journey of writing a purely functional implementation for solving 2-satisfiability problem. Essentially it is a problem of assignment of boolean values to the given boolean formula. It is the special case of common bool...

Back to top ↑

immutability

Solve CNF with Tarjan

17 minute read

Today I want to describe my journey of writing a purely functional implementation for solving 2-satisfiability problem. Essentially it is a problem of assignment of boolean values to the given boolean formula. It is the special case of common bool...

Back to top ↑

collection

Solve CNF with Tarjan

17 minute read

Today I want to describe my journey of writing a purely functional implementation for solving 2-satisfiability problem. Essentially it is a problem of assignment of boolean values to the given boolean formula. It is the special case of common bool...

Back to top ↑

performance

Solve CNF with Tarjan

17 minute read

Today I want to describe my journey of writing a purely functional implementation for solving 2-satisfiability problem. Essentially it is a problem of assignment of boolean values to the given boolean formula. It is the special case of common bool...

Back to top ↑

cats eq

Back to top ↑

cats order

Back to top ↑

cats equality

Back to top ↑

eq typeclass

Back to top ↑

cats writer monad

Back to top ↑

writer monad

Back to top ↑

cats writer

Back to top ↑

cats mtl

Back to top ↑

scala tofu

Back to top ↑

scala architecture

Back to top ↑

scala monad transformers

Back to top ↑

scala applications architecture

Back to top ↑

scala app architecture

Back to top ↑

cats recursions

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

tail recursion

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

cats tailRecM

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

y combinator scala

Write Y Combinator to understand recursions better

35 minute read

Implementation of Y Combinator from scratch (in Scala). It helps to understand structure of recursions. In the post we’ll take a look how to approach recursive functions without self-reference.

Back to top ↑

selection functions

Back to top ↑

selection monad

Back to top ↑

selection functions scala

Back to top ↑