Logan Brown

Just some dude who is interested in data, the cases we can make with it, and the way we compute it.

Posts by Tag

Blog

What really is B.I.

5 minute read

B.I. is . . . uhh, Brinkman index? Brain Injury? Biological Indicator? I’ve waited 4 years to get enough experience to write this blog post.

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Simple Haskell: Random Number Game

10 minute read

This is the first problem in a series of simple problems, written in Haskell. I regularly use rosettacode.org to find out different ways haskell solves probl...

Back to Top ↑

Programming

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Simple Haskell: Random Number Game

10 minute read

This is the first problem in a series of simple problems, written in Haskell. I regularly use rosettacode.org to find out different ways haskell solves probl...

Back to Top ↑

Learning

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Simple Haskell: Random Number Game

10 minute read

This is the first problem in a series of simple problems, written in Haskell. I regularly use rosettacode.org to find out different ways haskell solves probl...

Back to Top ↑

Literature Review

Back to Top ↑

Scala

Back to Top ↑

Functional Programming

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Simple Haskell: Random Number Game

10 minute read

This is the first problem in a series of simple problems, written in Haskell. I regularly use rosettacode.org to find out different ways haskell solves probl...

Back to Top ↑

Haskell

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Simple Haskell: Random Number Game

10 minute read

This is the first problem in a series of simple problems, written in Haskell. I regularly use rosettacode.org to find out different ways haskell solves probl...

Back to Top ↑

Error Handling

Simple Haskell: Parsing Logs (Part I)

11 minute read

Sane, efficient, and legible error handling can rank pretty high on the difficulty charts when writing a new application. Getting an answer to “Should this f...

Back to Top ↑

Parsing

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Back to Top ↑

Attoparsec

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Back to Top ↑

Streaming

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Back to Top ↑

Conduit

Simple Haskell: Parsing Logs (Part II)

13 minute read

Regular expressions are probably one of the most useful tools any programmer can know, but they can be brittle, especially when they get long, or if composit...

Back to Top ↑

Business Intelligence

What really is B.I.

5 minute read

B.I. is . . . uhh, Brinkman index? Brain Injury? Biological Indicator? I’ve waited 4 years to get enough experience to write this blog post.

Back to Top ↑