-
Notifications
You must be signed in to change notification settings - Fork 2
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Talk 5: Cameron Swords #5
Comments
You'll get this from everyone, but on grey background red parens are invisible. Was that on purpose to de-emphasize the parens? |
Visible parentheses please. |
Another word choice one -- I might vote for "seminal" over iconic. |
|
Include the full author list (for example, Findler & Felleisen). |
I like the rubric of monitoring strategies -- are these your names (semi, async, temporal...) or someone else's? |
Did you say Haskell was "semi eager" monitoring? I was having trouble understanding which of these compose with the others, if any. |
Re: Parens -- wow, what a showcase in how horrible projectors are. They looked great on the TV. |
Word choice? Avoid "slave". |
I might have missed it. Was "best effort" explained? |
Future contracts sound cool -- do those actually work / work well in Racket? "If it gets an error, it brings the whole threadpool to a stop" -- really? Shouldn't an error inside a future not do anything until the future is forced? |
|
|
|
One of the parens in your oval-of-strategies stood out to me. Talk about picayune complaints, but ))) the 1st and 2nd were closer than the 3rd. |
(actually several of the 'v' contract values should be 'v_c' in the last set of slides) |
raise & catch -- PLUS spawn. How do raise and catch interact with spawn? Spawn is for future creation, right? In that case exceptions are lazy, observed at the point of the force. On the slides after that though, I saw |
"maintains the tree's aspmytotic guarantees"? Minor nitpick -- the things with asymptotic guarantees are functions over the trees (the ADT methods) not the data itself, right? |
I don't understand why the last slide has that (albeit very pretty looking) table of the 4 strategies and their differences. It feels a little 'heavy' for a takeaway snapshot IMHO. |
Dan: "should you be using monads"? I.e. you're passing the strategies all over the place... should that threaded through by a monad? Cameron: the point is to have explicit control. (This sounds like an argument for default/optional arguments or whatever.) |
Ryan Scott: one thing that was incredible to me is that you have these different eval strategies but you can use them in tandem. |
bst — property you’re checking is NOT balanced say something about properties: faithfulness, blah pointer to point at screen get rid of two slides for ‘building the separation’ just present it with syntax that’s it! Nice slide (Strategy Strategy) Ouch. Had to slip important slide better explanation of tree fullness… can say less detail but more high level intuition about collection of contracts communicating together to establish global invariants when asked questions: if they are way out there, don’t speculate too much. ok to say “will talk later…” composing strategies. good point. dan’s point I think is that you can hide the management of strategies in a monadic interface your answers are too rambling though… give them to the point, concise you never said you have an implementation. Say it and highlight composable strategies: i haven’t seen two that don’t compose. not a good answer. |
I think the bst contract had a typo in the last line. |
Thank you everyone for your feedback! |
No description provided.
The text was updated successfully, but these errors were encountered: