Relative Content

Tag Archive for control-structures

Is this a valid design pattern for a Haskell main function?

After developing several Haskell applications I’ve found myself rigorously segregating impure code and failable (partial) functions from their pure & total counterparts. These efforts have noticeably reduced maintenance cost associated with the applications. I have found myself over time relying on the same high level main structure to enforce this segregation.

Is this a valid design pattern for a Haskell main function?

After developing several Haskell applications I’ve found myself rigorously segregating impure code and failable (partial) functions from their pure & total counterparts. These efforts have noticeably reduced maintenance cost associated with the applications. I have found myself over time relying on the same high level main structure to enforce this segregation.

Is this a valid design pattern for a Haskell main function?

After developing several Haskell applications I’ve found myself rigorously segregating impure code and failable (partial) functions from their pure & total counterparts. These efforts have noticeably reduced maintenance cost associated with the applications. I have found myself over time relying on the same high level main structure to enforce this segregation.

Is this a valid design pattern for a Haskell main function?

After developing several Haskell applications I’ve found myself rigorously segregating impure code and failable (partial) functions from their pure & total counterparts. These efforts have noticeably reduced maintenance cost associated with the applications. I have found myself over time relying on the same high level main structure to enforce this segregation.

How to choose between different ways to write some code?

I would like to validate point in a two-dimensional rectangular Cartesian coordinate. I found following regular expression solution on stackoverflow ^(-?d+(.d+)?),s*(-?d+(.d+)?)$
. Another solution is using little PHP controls: