Haskell Hackers: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
(Add cdsmith's project for Haskell Hackers) |
||
Line 46: | Line 46: | ||
victordenisov: | victordenisov: | ||
* Mongodb driver | * Mongodb driver | ||
cdsmith: | |||
* CodeWorld, an educational web-based programming environment for Haskell | |||
[add your ideas]: | [add your ideas]: | ||
* foo | * foo | ||
* bar | * bar |
Revision as of 09:52, 7 September 2016
We assemble to construct software that matters, far from the madding crowd of callbacks, runtime errors and brogrammers. The Noisebrige Haskell Hackers is a community who learns by doing.
Rather than being a meetup focused on talks, this is a recurring hack night where participants learn by actively programming together. Actions speak louder than words, and we strive to make useful contributions to open source, documentation, or personal experiments while making friends with likeminded developers.
Next Meeting
Thursday 9/8/2016.
- 6:00 - Mingle
- 6:30 - Form a circle, announce what you'd like to work on or learn. Find a partner/group and get to work
- ??:00 - bye bye
Possible Hacks
Here's a place to brainstorm prior to the meeting about possible stuff to code.
begriffs:
* Fix issues on https://github.com/begriffs/postgrest * Continue with exemplary CI template https://github.com/begriffs/haskell-circle-example * Experiment with writing example parsers for megaparsec's documentation
epaniagua (e7a):
* Write a tagless final embedding of the simply typed lambda calculus, along with a few evaluation functions like printing, beta reduction, and evaluation for primitive operations on primitive types. Implement Hindley-Milnor type inference for terms. * Write a framework for writing proof assistants along the lines of Coq, though perhaps more modest in scope. To limit scope, maybe focus on the architecture and data structures to be used during proof tree search. * Experiment with packrat parsing or packrat parser generation. * Implement an object language with dependent types, for example dependently typed lambda calculus. * Implement a bijection between inductive types and boolean-valued functions in the spirit of Curry-Howard. * Software for keeping a personal schedule. Input would be a DAG of tasks and a calendar. Output would be a calendar with time scheduled for construing those tasks if feasible, otherwise an explanation of by how much the dag is overcommitted and perhaps a few schedules for feasible subgraphs. * Actually, even just a good data model for the scheduling problem would be a win. * Work through Write Yourself a Scheme in 48h tutorial (https://en.m.wikibooks.org/wiki/Write_Yourself_a_Scheme_in_48_Hours). * Write a gRPC server in Haskell. There are a few libraries, but I haven't tried any of them yet.
victordenisov:
* Mongodb driver
cdsmith:
* CodeWorld, an educational web-based programming environment for Haskell
[add your ideas]:
* foo * bar