Table of Contents
1 (ninth RacketCon)
2 Saturday, 09:30–10:30 Aaron Turon: Governing Rust
2.1 pre-1.0
- internal project for improving performance and security
2.2 1.0
- strives for eager consensus
- accommodate external groups
- address "why wasn't I consulted" problem
- define stakeholders and decision makers
- create rfc system
- goal is to understand trade-offs
- schedule a final review
- there needs to be an end to rational addition
- the goal needs to get to a consensus but an outcome
- balance is between shipping and consensus
2.3 post-1.0
- set up a roadmap
- expand the audience
- lower the barrier to entry as a tension with existing systems programmers
- "Hack without Fear"
- "Magic" as balanced against Rust goals
- setup on-boarding
- track issues to allow new contributors
- https://rust-lang.github.io/rustc-guide/
- teams: design
- working groups: implementation
- on-boarding, documentation, triage, planning
- need to ensure that people have space to move to leadership and ownership
- example: https://github.com/rust-lang/rust/issues/50547
- contribution as more than code: https://medium.com/open-source-communities/maintainer-vs-community-97edc28387ad
- https://www.rust-lang.org/governance
3 10:50–11:50
3.1 Phil Hagelberg: In Production: creating physical objects with Racket
3.2 Conor Finegan: ADQC: From Normalcy to Adequacy
4 14:00–15:00
4.1 Bradley M. Kuhn: Conservancy and Racket: What We Can Do Together!
4.2 Greg Hendershott: Racket and Emacs: Fight!
5 15:20–16:20
5.1 Eric Griffis: Algebraic Racket in Action
5.2 Vlad Kozin: #lang wishful thinking (will! it be so)
6 16:40–17:40
6.1 Andrew Blinn: Fructure: A Structured Editing Engine in Racket
6.2 John Clements: Computational models and one big problem with the stepper
7 Sunday, 09:30–10:30 Matthew Flatt: State of Racket
8 2017 Keynote: Dan Friedman & Will Byrd: Reasoned Schemers
- https://github.com/webyrd/CodeFromTheReasonedSchemer2ndEd
- http://webyrd.net/scheme-2013/papers/HemannMuKanren2013.pdf
(run* (q) (conde [(== q 5)] [(== q 6)]))
(define my-append (l s) (cond [(null? l) s] [(cons (car l) (my-append (cdr l) s)]))
8.1 Three Rules: Simply-typed Lambda Calculus
- var
- abs
- app
8.2 Quines/Twines
http://matt.might.net/articles/i-love-you-in-racket/
(run 99 (q) (evalo q '(I love you)))