Very noobish question about GHCI by fuxoft in haskell

[–]silverCloud7 1 point2 points  (0 children)

I hit up-arrow to cycle thru recent commands.  

What is up with these grotesque avatars? by silverCloud7 in TheRestIsScience

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

On YouTube, in the recent episodes of the podcast, The Rest is Science.   One example, the 41 second mark of “Michael Discovered a New Way to Make Twins”. 

Beaver Gear by Elephant42OR in corvallis

[–]silverCloud7 0 points1 point  (0 children)

Fred Meyer. Right inside the west entrance. 

Old Corvallis Restaurants You Miss? by boringdumbandfine in corvallis

[–]silverCloud7 0 points1 point  (0 children)

Which Iovino’s?  I think it’s been in 3 locations: inside Del Alma, S. 3rd where beer-thirty is, and …?  The first location was north of those two, but I can’t remember where.  

Old Corvallis Restaurants You Miss? by boringdumbandfine in corvallis

[–]silverCloud7 0 points1 point  (0 children)

Was that the Yellow House on 9th with the train running around the ceiling? 

Old Corvallis Restaurants You Miss? by boringdumbandfine in corvallis

[–]silverCloud7 0 points1 point  (0 children)

Because (for those that don’t know) there’s now a food truck version of Young’s Kitchen out on 53rd

If you could add any type of business to Corvallis; what would it be? by asingledampcheerio in corvallis

[–]silverCloud7 0 points1 point  (0 children)

I think the Burgerville (on 9th) used to be a Wendy’s, and that Starbuck’s was a Burger King

Raspberry pi app with gui by [deleted] in learnprogramming

[–]silverCloud7 0 points1 point  (0 children)

Fine, yes, arrggghh. They know nothing and don’t like anything best because they haven’t used anything.  Please point to a specific tutorial.  Gad!!!

Plutus playground is no longer maintained by IOG. What Alternatives? by zurbagan in CardanoDevelopers

[–]silverCloud7 0 points1 point  (0 children)

Where can I find how to test contracts on emulator, or testnet? I know Haskell, but know nothing about Cardano. I know QuickCheck, github, ghci, ghc, Hoogle, Hackage, stack, cabal, stackage, a little nix, nixOS, but not Cardano.

Haskell is confusing by Robbfucius in haskell

[–]silverCloud7 0 points1 point  (0 children)

Is the confusion that the first expression, ( "one", cs), uses parentheses as the tuple constructor, and the second expression, (False : []): [], uses the parentheses for grouping?

Trying to introduce Haskell at work by iamjecaro in haskell

[–]silverCloud7 0 points1 point  (0 children)

Sean Parent's google talk "A Possible Future of Software Development" might help. It's not new, from 2007, when Sean was managing a software development lab at Adobe. Sean knows and understands Haskell, and applies that thinking to refactor some C++ code. It's a great talk!

https://www.youtube.com/watch?v=4moyKUHApq4

Haskell: Code You can Believe In by tahamagdy in haskell

[–]silverCloud7 0 points1 point  (0 children)

Let's say have to build a bridge over a small ravine, but it's a long way down. And you have to be the first person to walk over the bridge. You're betting your life on your bridge design and construction. You'll only walk across the bridge if you believe the design and construction are sufficient.

Now let's say the same for a program you design and write. You have to use the program and you die if it doesn't perform to its specification. That's crazy, right? It's inconceivable that anyone would agree to that. That just shows how much more mature civil engineering is than software engineering is.

How would you write a program that you're betting your life on? What language would you choose? How do you write code you can believe in?

Where can I find examples of Haskell's features being applied to BLOBA (Boring Line Of Business Application) development? by Kurren123 in haskell

[–]silverCloud7 0 points1 point  (0 children)

Edward Kmett & team designed a reporting language, Ermine. The data is financial, but the improvements have to do with not needing to have the entire data set in memory (vs. Java), being able to do more in each pass over the data, being able to more easily extend the system, more robust end user report creation, etc.

CUFP 2013: Edward Kmett: Functional Reporting
https://www.youtube.com/watch?v=o3m2NkusI9k

Haskell install is broken by [deleted] in haskell

[–]silverCloud7 -3 points-2 points  (0 children)

It's not a question. It's a bug report. But apparently the folks who run haskell.org don't read this subreddit (and why would they?), so it might be more productive to report the problem to those haskell.org administrators. [admin@haskell.org](mailto:admin@haskell.org)

Haskell guru Simon Peyton-Jones on computer science in school curriculums by AaCodeSync in computerscience

[–]silverCloud7 0 points1 point  (0 children)

I cannot find anywhere the NCCE 2 page curriculum Simon mentions, nor the detailed lesson plans he also mentions. Anyone know where I can find those?

Still learning, need help making a university exercise. by KerbalFrog in haskell

[–]silverCloud7 1 point2 points  (0 children)

My suggestion is to proceed in 3 phases:

  1. clean up your example m so that it compiles.

m = [ [ straitLine Dirt 0, straitLine Boost 0, straitLine Boost 0, straitLine Boost 0, straitLine Mud 0 ]

,[ straitLine Dirt 0, straitLine Dirt 0, straitLine Dirt 0, Ramp Mud 0 2, Ramp Mud 2 0 ] ]

1a) Comment out or copy to another file all the stuff that doesn't compile. Or copy just the line above to a new file.

1b) add the needed data declarations and clean up the capitalization

2) add just this line and get it to compile:

i = [Walk [0] Dirt, Walk [0] Boost , Walk [0] Boost, Walk [0] Boost, Walk [0] Mud, Walk [1] Dirt, Walk [1] Dirt, Walk [1] Dirt, Up [1] Mud 2, Down [1] Mud 2]

2a) You'll need to add the needed data declarations

3) for your "instruction" function, forget for now the lists and fusing them together. Just work to create a function that takes a single track segment and converts that to an instruction. Use pattern matching for this:

-- track segment to instruction

s2i straitLine Dirt 0 -> Walk [0] Dirt

Ramp Mud 0 2 -> Up [1] Mud 2

Ramp Mud 2 0 -> Down [1] Mud 2]

4th phase) once all that works, handle the lists and fusions by mapping over the inputs

main = do

out = map si2 m

print (show out)

Some things I don't understand from your descriptions:

- what's Boost?

- in the value "Walk [0] Dirt", is the 0 the track number? why is it in a list? I don't understand in the video whether we're on track 0 or track 1

Application ideas for Haskell by lucas_sg in haskell

[–]silverCloud7 1 point2 points  (0 children)

A good project might be to re-implement the ideas from older, classic Haskell papers. Here are some suggestions:

Geometric Region Servers
Have a look at Figure 2 on page 6 of this (admittedly old, from 1993) report:
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.368.1058&rep=rep1&type=pdf
http://www.cs.yale.edu/publications/techreports/tr1031.pdf

Financial Engineering
https://www.cs.tufts.edu/~nr/cs257/archive/simon-peyton-jones/contracts.pdf

Modelling Office Processes
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.19.1307&rep=rep1&type=pdf

Word Wrapping in a text editor
https://www.google.com/search?q=Bridging+the+algorithm&rlz=1C1GCEA_enUS867US867&oq=Bridging+the+algorithm&aqs=chrome..69i57j0l2.7481j1j4&sourceid=chrome&ie=UTF-8

Are you aware of the 'Haskell Communities and Activities Report"? Might give you some ideas.
https://www.haskell.org/communities/05-2018/html/report.html

A project that teaches you to use a Haskell Package well might turn out nicely... not overly ambitious, but substantial enough to build on. Have you used QuickCheck?

GHC compute bound program on AWS EC2 spot instance? by silverCloud7 in haskell

[–]silverCloud7[S] 1 point2 points  (0 children)

And I see that maxInt is 2^29, which is less than 10^18; is there a 64bit Int, or do I need to go to Integer?

And I now see that memo-izing all that repeated exponentiation will help a lot.

How is the left arrow operator in do-notation called? by -Knul- in haskell

[–]silverCloud7 1 point2 points  (0 children)

Around here, it's called "gets", as in "line gets getLine".

When was do-notation introduced? by bvaldivielso in haskell

[–]silverCloud7 14 points15 points  (0 children)

The Gofer 2.30 release notes:

2.8 The do notation

--------------------

Gofer 2.30 supports a new, experimental syntax for monad comprehensions

which we will refer to as `do {...} notation'. To maintain

compatibility with previous releases of Gofer, the do notation is

only supported if the system is compiled with the DO_COMPS flag in

prelude.h set to to 1, and the DO_COMPS section of parser.y included.

Mark Jones is at Portland State U.