Skip to content
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 12: Jason Hemann #12

Open
rrnewton opened this issue Aug 20, 2015 · 31 comments
Open

Talk 12: Jason Hemann #12

rrnewton opened this issue Aug 20, 2015 · 31 comments

Comments

@rrnewton
Copy link
Contributor

No description provided.

@cgswords
Copy link

Love the 10-foot font

@samth
Copy link

samth commented Aug 21, 2015

Use of Racket is implied by the (), you don't have to have it on the slides. :)

@samth
Copy link

samth commented Aug 21, 2015

Syntax highlighting would be nice.

@cgswords
Copy link

  • We can probably get rid of slide 2...
  • Love the fake repl
  • Maybe call valof 'eval' for those schemers?

@cgswords
Copy link

6 minutes in, we're finishing up background

@samth
Copy link

samth commented Aug 21, 2015

More visuals, less text.

@laurmcarter
Copy link

Re syntax highlighting, color distinction between bound variables and quoted data would be nice.

@cgswords
Copy link

That bulleted list of the type inferencer, program generator, CL reducer, could make sweet visuals

@laurmcarter
Copy link

... or just distinguishing quoted data, for that matter.

@ccshan
Copy link

ccshan commented Aug 21, 2015

I'm confused about the organization of the introduction. You talk about miniKanren, then microKanren, then back to miniKaren on the next (book cover) slide -- why move back and forth, and more importantly, what is the goal of your talk?

@cgswords
Copy link

I feel like this entire constraint discussion could have happened before introducing microkanren.

@ccshan
Copy link

ccshan commented Aug 21, 2015

For syntax highlighting, you could follow the typesetting of the Reasoned Schemer book?

@cgswords
Copy link

Yes, you go through why miniKanren hurts for constraints, and then you could lead into microkanren and talk about adding constraints to it!

@ccshan
Copy link

ccshan commented Aug 21, 2015

Is the headline "tiny implementation of logic programming now features tiny implementation of constraints"? (Because tiny is teachable) Then put the desiderata slide as FIRST slide.

@cgswords
Copy link

🎆 ^^^^^^ what ken said

@samth
Copy link

samth commented Aug 21, 2015

Agree 100% with @ccshan and @cgswords.

@samth
Copy link

samth commented Aug 21, 2015

Never use a fixed-width font for text.

@cgswords
Copy link

Okay we're getting into the good things, and we're already at 10 minutes (the Constraint Recipe slide). That intro should tighten up.

@samth
Copy link

samth commented Aug 21, 2015

How did the font get so small?

@ccshan
Copy link

ccshan commented Aug 21, 2015

Maybe one way to demonstrate the pedagogical success of microKanren is to jump right into explaining it (without going through miniKanren - just say that it is too big).

@cgswords
Copy link

@ccshan "I'm not even going to bother explaining miniKanren; it's just too big. I'm going to show you some microKanren, and you'll have no problem understanding it" ?

@cgswords
Copy link

The syntax-rule could get a nice picture to explain it.

@cgswords
Copy link

The same for your call/fresh. A little logic puzzle diagram could be cute? Or some sort of reasoning as we move through the constraints there.

@ccshan
Copy link

ccshan commented Aug 21, 2015

The claim of "extensible" makes me want a list of extensions that have been made. I assume: booleans (subsuming SAT solver), numbers (subsuming some kind of SMT), etc.

@samth
Copy link

samth commented Aug 21, 2015

Complicated macros on your slide seem unnecessary. Also, why does S0 need to be unhygenic?

@ccshan
Copy link

ccshan commented Aug 21, 2015

Put "120 lines" claim on the first slide too.

@cgswords
Copy link

Using the System, example 1, hits 20 minutes

@cgswords
Copy link

Write a pretty-printer, use it, sell it as a front-end?

@samth
Copy link

samth commented Aug 21, 2015

I feel like match could be used usefully somehow in the type inference example.

@cgswords
Copy link

@samth are you proposing generating match expanders for mK constraints? Because that's a neat idea.

@ccshan
Copy link

ccshan commented Aug 21, 2015

Time: 22:22

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

5 participants