2025 event planning

[frasertweedale]

We will use this issue to plan and schedule events for 2025.

Talks

Schedule

• 2025-01-16 - 2025 launch event at the Osbourne Hotel
• 2025-02-11 - Regular meetup
  • @frasertweedale - live coding a JSON parser using parser combinators
  • Mentor networking session (hosted by @endgame)
• 2025-03-11 - Regular meetup
  • cancelled due to TC Alfred aftermath
• 2025-04-08 - Regular meetup
  • @donovancrichton - Explicit Substitutions Part 1: STLC and Background (abstract)
  • @theasaurus - An Overview of IT Education in Queensland (abstract)
• 2025-05-13 - Regular meetup
  • @LightAndLight - A "third way" of compiling parametric polymorphism (abstract)
  • @frasertweedale - Two years of the Haskell SRT
• 2025-06-10 - Regular meetup
  • @carlohamalainen - memory related and recursion and things
  • Lightning talks
• 2025-07-08 - Regular meetup
  • Siva Kalyan - Pandoc
  • @rellen - Hakyll
• 2025-08-12 - Regular meetup
  • @donovancrichton - Explicit Substitutions Part 2 (abstract)
  • @endgame - Overview of Nix flake-parts and haskell-flake
• 2025-09-09 - Regular meetup
  • @gwils - Typed Holes and Hole-Driven Development (abstract)
  • @CameronBadman - Gleam's Type-Safe OTP Concurrency: A New Era of Reliable Distributed Programming (abstract)
• 2025-10-14 - Regular meetup
  • @rtpg - Typing at the Edge (abstract)
  • Mike Buhot - Gleam + TypeScript: Full-Stack Type Safety With Inertia-Wisp (abstract)
• 2025-11-11 - Regular meetup
  • @carlohamalainen - serialisation
  • @skalyan91 and T. Mark Ellison - tmefunc: FP for Python
• 2025-12-xx - Social event?
  • TODO

Concrete but unscheduled

These are concrete talk proposals where we have a willing presenter. Please file separate issues for general topic requests.

• Naso Evangelou-Oost - Subtypes and quotient types in Lean 4
• @flatwhatson - Hygienic Macrology in Scheme
• @flatwhatson - Type Reconstruction in Pre-Scheme

Requested topics

• Debugging in Haskell (stack traces, etc)

Venue

• BCC Library Brisbane Square

Hack nights

Would be good to kick of hack night again

Suggested activities / hack night projects

• Migrate applied FP course from waaargonaut to aeson.

[flatwhatson]

I can do (at least) the following topics:

• Hygienic Macrology in Scheme
• Type Reconstruction in Pre-Scheme

[rtpg]

I can give a talk on removing backend/frontend interface mismatch issues without codegen using Typescript (i.e. making sure your backend and frontend stay in sync).

[frasertweedale]

I can give a talk on removing backend/frontend interface mismatch issues without codegen using Typescript (i.e. making sure your backend and frontend stay in sync).

@rtpg does Feb and/or March work?

[frasertweedale]

I can do (at least) the following topics:

* Hygienic Macrology in Scheme
* Type Reconstruction in Pre-Scheme

@flatwhatson Could you present one of these in March or April?

[donovancrichton]

My Abstract for my Feb 25 talk:

Let me know if you want it shorter.

Explicit substitutions are a commonly encountered extension to typed lambda calculi
particularly when working with higher order, or dependently typed variants.
This talk will cover the rationale, syntax and evaluation for explicit substitutions, and 
showcase how they reduce the burden of reasoning about the substitution operation in the meta-theory.

We will undertake a tour of the following concepts that are suitable for beginner functional programmers :
Simply Typed Lambda Calculus, de Bruijn Indices, and typing rule notation.
We will conclude with a mutually inductive presentation
of explicit substitution over a dependent type theory for more advanced attendees.

[LightAndLight]

I can present the following as early as April (at the time of writing, I'd be scheduled for May): A "third way" of compiling parametric polymorphism

[frasertweedale]

I can present the following as early as April (at the time of writing, I'd be scheduled for May): A "third way" of compiling parametric polymorphism

🙏 scheduling you for May!

[rellen]

@frasertweedale here's my abstract for the Hakyll talk:

Hakyll is a powerful and flexible Haskell static site generator library. Websites can be built with a combination of content formats, HTML templates, and CSS, all brought together by an embedded DSL.

We'll take a look at how to work with content and the Hakyll EDSL, what the DSL offers to the personal blogger, and some of the delights and hardships you might find along the way. Then we will look at how the EDSL works, including how Hakyll uses Pandoc to support multiple input/output formats and useful things of developer-focussed content. Finally we'll talk about more trivial things like building and deploying a Hakyll site.

[skalyan91]

@frasertweedale Here’s my abstract:

Pandoc is a Haskell library (and command-line tool) for converting documents among a range of different formats. It works by parsing the input document into an abstract syntax tree, and then generating the output format from this tree. Pandoc comes with a library of parsers and generators for different formats, all written in the Parsec framework.

We will work through a simplified example of Markdown parsing and HTML generation using Parsec parsers similar to the ones defined by Pandoc.

[theasaurus]

@frasertweedale My abstract for April:

IT education - whether that is teaching digital literacy or more traditional computer science skills - has changed a lot in Australia in the last 15 years. Each State has their own curriculum and subjects, and Queensland recently did a refresh of their entire senior system. We'll take a look at what is required to be taught from Prep - 12, along with what the reality of actually being in a QLD school is like.

[donovancrichton]

@frasertweedale My updated abstract for April:

Explicit Substitutions Part 1: STLC and Background

This talk is part 1 of 2 talks on extending lambda calculi with explicit substitutions.

This a beginner friendly talk that will introduce the mathematics behind the Simply Typed Lambda Calculus
(STLC) extensions of which underpin the very foundations of all modern pure functional programming languages (ML, Haskell, Lean, etc). There is a large gap between the STLC on paper, and how it is usually implemented in practice.
Explicit Substitutions give us a way to narrow this gap.

This talk will cover: BNF Grammars, Inference Rules, The STLC, Substitution, β-reduction, α-equivalence, De-Bruijn
Indices, Explicit Substitutions, and finally extending a variant of the STLC with explicit substitutions in
preparation for part 2, which will draw on these concepts as assumed background.

[frasertweedale]

ping @LightAndLight - are you still good for May 13?

[LightAndLight]

Yep!

…

On 22 April 2025 8:54:32 am UTC, Fraser Tweedale ***@***.***> wrote: frasertweedale left a comment (bfpg/talks#51) ping @LightAndLight - are you still good for **May 13**? -- Reply to this email directly or view it on GitHub: #51 (comment) You are receiving this because you were mentioned. Message ID: ***@***.***>

[frasertweedale]

@LightAndLight thanks mate. Could you please provide an abstract by next Tuesday?