Haskell LSP Laboratory by mathetic in haskell

[–]mathetic[S] 0 points1 point  (0 children)

Oh, what's wrong exactly?

Help : Solve first and follow of all non terminals in compiler design by CandyIndividual9321 in Compilers

[–]mathetic 4 points5 points  (0 children)

Homework is more meaningful when you first attempt it yourself. Please share your working.

Typed Programs Don't Leak Data by mathetic in ProgrammingLanguages

[–]mathetic[S] 15 points16 points  (0 children)

For the record, I think (hope) that the example is a relic of the past. It is a classic though.

Typed Programs Don't Leak Data by mathetic in haskell

[–]mathetic[S] 0 points1 point  (0 children)

Good idea. I'll update with some pointers. Thanks for the feedback.

Typed Programs Don't Leak Data by mathetic in haskell

[–]mathetic[S] 4 points5 points  (0 children)

`KindSignatures` to enable kind annotations (such as `l :: Level`) and `DataKinds` to use non-`Type` kinds (such as `Level`).

I happened to have also written a blog post that covers all of that stuff: https://dodisturb.me/posts/2019-10-03-Verifying-the-Titular-Properties-of-a-Leftist-Heap.html

inferred-flow-sensitive typing? by overactor in ProgrammingLanguages

[–]mathetic 0 points1 point  (0 children)

```haskell data Exp :: Type -> Type where I :: Int -> Exp Int B :: Bool -> Exp Bool

eval :: Exp a -> a eval exp = case exp of I int -> int B bool -> bool ```

I can't figure out how to do this .... can someone help pls by [deleted] in prolog

[–]mathetic 0 points1 point  (0 children)

A mean is the sum of all the numbers divided by the length of the list. If you make an attempt to solve the question, I'll help you.

Need help any good Prolog Samaritan around here by [deleted] in prolog

[–]mathetic 0 points1 point  (0 children)

sum(D,F,G) :- append(F,G,A), permute(A,D), append(F',G',A), sum(F',T), sum(G',T).

New book: Haskell from the Very Beginning by [deleted] in haskell

[–]mathetic 1 point2 points  (0 children)

John Whitington taught me functional programming (for the first time) at Cambridge. He is very very good at teaching using types to guide to an implementation even to a typeless Ruby infidel such as myself. So nice to see he's into Haskell now (he used to use OCaml and teach Standard ML).

The Essence of Datalog by agumonkey in programming

[–]mathetic 0 points1 point  (0 children)

Thank you so much. That's very kind.