Trying to understand why some type inference used to work in OCaml and not anymore in F#
1 people like thisPosted: 8 years ago by Lasher`
Write a function last : 'a list -> 'a option that returns the last element of a list.
0 people like thisPosted: 6 years ago by DC F#
Find the k'th element of a list. (easy)
0 people like thisPosted: 6 years ago by DC F#
One of the 99 OCaml problems rewritten in F#
0 people like thisPosted: 6 years ago by Vladimir Khorikov
One of the problems from https://ocaml.org/learn/tutorials/99problems.html
0 people like thisPosted: 6 years ago by Vladimir Khorikov
See also https://fslang.uservoice.com/forums/245727-f-language/suggestions/6536829-implement-ocaml-s-new-match-exception-syntax
3 people like thisPosted: 6 years ago by Eirik Tsarpalis
Find the last but one (last and penultimate) elements of a list. (easy)
0 people like thisPosted: 6 years ago by DC F#
f# has Seq.length but we ask that you reimplement it. Bonus for a tail recursive solution.
0 people like thisPosted: 6 years ago by DC F#
One of the 99 OCaml problems rewritten in F#
0 people like thisPosted: 6 years ago by Vladimir Khorikov
Every spot in the puzzle belongs to a (horizontal) row and a (vertical) column, as well as to one single 3x3 square (which we call "square" for short). At the beginning, some of the spots carry a single-digit number between 1 and 9. The problem is to fill the missing spots with digits in such a way that every number between 1 and 9 appears exactly once in each row, in each column, and in each square.
1 people like thisPosted: 5 months ago by Tomas Petricek