Skip to main content
0 votes
1 answer
111 views

Is it possible to obtain an array with O(1) read and write access (like Haskell's STArray) using a read only array (such as Haskell's Data.Array.Array)? Or is there a wrapper around pure functions ...
Vladimir's user avatar
1 vote
1 answer
47 views

You can put together the following code by collecting some snippets from Type-Driven Development with Idris's Chapter 8: data Vect : Nat -> Type -> Type where Nil : Vect Z a (::) : a -> ...
Enlico's user avatar
  • 30.4k
Best practices
0 votes
1 replies
100 views

I have a vector of key-value pairs, where keys can be duplicate, or rather, I have an iterator that I eventually collect to that vector. I need to get a HashMap with those keys, but vectors of values ...
Ibolit's user avatar
  • 9,840
Best practices
3 votes
4 replies
135 views

When writing modules, i am always struggling trying to identify the related dependencies of the functions, properties, etc... That's why i am now trying to code using only pure functions, and to ...
iTelemarked's user avatar
0 votes
1 answer
140 views

I have a C# application with multiple layers (controllers, services, domain logic, and background workers). Error handling has become inconsistent because many methods contain their own try/catch ...
Mikias Gebresilasie's user avatar
0 votes
0 answers
59 views

I want to make my mutually recursive functions stack-safe, but because they have different signatures - one traverses a list and other a tree(?) of sorts - I'm not clear how to go about this. Here's ...
joel's user avatar
  • 8,162
1 vote
2 answers
167 views

Here is the question from Mitchell Wand's Essentials of Programming Language: Exercise 1.19 [⋆ ⋆] (list-set lst n x) returns a list like lst, except that the n-th element, using zero-based indexing, ...
YCH817's user avatar
  • 123
Advice
0 votes
2 replies
139 views

Suppose a scenario where: you need to execute an expensive operation which can fail or succeed. the result of the operation is modeled by using a result object Result<T>. The result object ...
Enrico Massone's user avatar
Best practices
5 votes
3 replies
156 views

I had a nice idea of using applicative for nondeterministic financial modelling. Or maybe it is a simple case of sentization. So the basic example is to define newtype ValueRange. newtype ValueRange a ...
Dominik G's user avatar
  • 614
0 votes
1 answer
98 views

The task Given the following string¹ one ' two 'three four the required function should split it in 3 tokens (one, two three, and four), in agreement with how the bash shell does: $ function ...
Enlico's user avatar
  • 30.4k
0 votes
1 answer
137 views

tl;dr Ideally, I'd want the following "hello world" is split in "hello" and " world" " world" is split in "" and " world" "hello "...
Enlico's user avatar
  • 30.4k
4 votes
1 answer
125 views

The following program assumes that /path/to/mypipe is a named pipe, e.g. created via mkfifo /path/to/mypipe, with no readers/writers waiting yet, runs two threads, of which the main thread keeps ...
Enlico's user avatar
  • 30.4k
3 votes
2 answers
200 views

tldr; how does one deal with logic that depends on data that are too heavy to fetch up-front when subscribing to the functional core, imperative shell line of thought? Years ago I was inspired by Gary ...
oligofren's user avatar
  • 23.4k
3 votes
2 answers
111 views

If in a terminal I enter mkfifo /tmp/pipe echo hello > /tmp/pipe (which blocks) and in another I run the haskell program main = readFile "/tmp/foobar" >>= putStr then I see it ...
Enlico's user avatar
  • 30.4k
2 votes
1 answer
90 views

I'm reading the paper Selective Applicative Functors. So far I've read from page 16 out 29, and I think I've understood the gist of this abstraction, but I'm having some trouble with some basic ...
Enlico's user avatar
  • 30.4k

15 30 50 per page
1
2 3 4 5
1283