-
blog :: Brent -> [String]
Species definition clarification and exercises
-
blog :: Brent -> [String]
New Haskell diagrams library
-
blog :: Brent -> [String]
Gobby, Haskell, and patch theory
-
blog :: Brent -> [String]
Patch theory, part II: some basics
-
blog :: Brent -> [String]
Diagrams 0.6
-
blog :: Brent -> [String]
What’s the right way to QuickCheck floating-point routines?
-
blog :: Brent -> [String]
Typed type-level programming: status report
-
blog :: Brent -> [String]
Ertugrul Söylemez: 1985-2018
-
blog :: Brent -> [String]
Solving an arithmetic puzzle with Haskell
-
blog :: Brent -> [String]
Functional pearl on combinatorial species
-
blog :: Brent -> [String]
Species subtraction made simple
-
blog :: Brent -> [String]
Pan-Galactic Division in Haskell
-
blog :: Brent -> [String]
Squarefree numbers in Haskell
-
blog :: Brent -> [String]
My new programming languages course
-
blog :: Brent -> [String]
Can you tell I am on sabbatical? ↩︎
-
blog :: Brent -> [String]
The network reliability problem and star semirings
-
blog :: Brent -> [String]
Mgu's and universal properties
-
blog :: Brent -> [String]
A strange representation of Z6
-
blog :: Brent -> [String]
Introducing Math.Combinatorics.Species!
-
blog :: Brent -> [String]
And now, back to your regularly scheduled combinatorial species
-
blog :: Brent -> [String]
Math.Combinatorics.Multiset
-
blog :: Brent -> [String]
Fad diets are like burrito tutorials
2009 ICFP programming contest reflections -
blog :: Brent -> [String]
Creating documents with embedded diagrams
-
blog :: Brent -> [String]
Announcing diagrams preview release
-
blog :: Brent -> [String]
New haxr release
-
blog :: Brent -> [String]
Unique isomorphism and generalized "the"
-
blog :: Brent -> [String]
Avoiding the axiom of choice, part I
-
blog :: Brent -> [String]
An interesting monoid
-
blog :: Brent -> [String]
Code style and moral absolutes
-
blog :: Brent -> [String]
The generic-random library, part 1: simple generic Arbitrary instances
-
blog :: Brent -> [String]
Competitive programming in Haskell: cycle decomposition with mutable arrays
-
blog :: Brent -> [String]
Collecting attributes
-
blog :: Brent -> [String]
Deducing code from types: filterM
-
blog :: Brent -> [String]
How to solve this differential equation?
-
blog :: Brent -> [String]
Data.List.Split
-
blog :: Brent -> [String]
Counting inversions with monoidal sparks
-
blog :: Brent -> [String]
Deep work and email habits
-
blog :: Brent -> [String]
The Typeclassopedia is now up-to-date
-
blog :: Brent -> [String]
Competitive programming in Haskell: 2D cross product, part 1
-
blog :: Brent -> [String]
What would Dijkstra do? Proving the associativity of min
-
blog :: Brent -> [String]
The Species of Bracelets
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged BFS , graph , haskell , Kattis , mutable , …
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged BFS , graph , haskell , Kattis , mutable , …
-
blog :: Brent -> [String]
Competitive programming in Haskell: BFS, part 4 (implementation via STUArray)
In a previous post , … -
blog :: Brent -> [String]
Competitive programming in Haskell: Enumeration
-
blog :: Brent -> [String]
Competitive programming in Haskell: Enumeration
I’m in the middle of a multi-part series on … -
blog :: Brent -> [String]
Monoids for Maybe
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged BFS , graph , HashMap , haskell , Kattis , …
-
blog :: Brent -> [String]
Competitive programming in Haskell: BFS, part 3 (implementation via HashMap)
In a previous post , I … -
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged BFS , graph , haskell , Kattis , search | 1 …
-
blog :: Brent -> [String]
Competitive programming in Haskell: BFS, part 2 (alternative APIs)
-
blog :: Brent -> [String]
Competitive programming in Haskell: BFS, part 2 (alternative APIs)
In my last post , I showed how … -
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged haskell , Kattis , maximum , subsequence , sum …
-
blog :: Brent -> [String]
Competitive programming in Haskell: BFS, part 1
In a previous post , I challenged you to solve … -
blog :: Brent -> [String]
Swarm: a lot can happen in a week
It’s been about a week since I put out an announcement and call … -
blog :: Brent -> [String]
Posted on September 23, 2021 by Brent
The first insight is that we can transform this into the … -
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged Codeforces , solutions | 2 Comments
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged Codeforces , solutions | 1 Comment
-
blog :: Brent -> [String]
Posted in haskell , projects | Tagged game , programming , resource , robot , Swarm | 2 Comments …
-
blog :: Brent -> [String]
Swarm: preview and call for collaboration
-
blog :: Brent -> [String]
Swarm: preview and call for collaboration
For about a month now I have been working on building a … -
blog :: Brent -> [String]
Yesterday morning I competed in Educational Round 114 on codeforces.com , using only Haskell. It is …
-
blog :: Brent -> [String]
Competitive programming in Haskell: Codeforces Educational Round 114
Yesterday morning I competed … -
blog :: Brent -> [String]
Posted in haskell | Tagged cache , lens , record , view | 2 Comments
-
blog :: Brent -> [String]
Posted in haskell | Tagged cache , lens , record , view | 1 Comment
-
blog :: Brent -> [String]
Posted in haskell , teaching | Tagged Hindley-Milner , inference , types , unification | 1 Comment …
-
blog :: Brent -> [String]
Automatically updated, cached views with lens
Recently I discovered a nice way to deal with records … -
blog :: Brent -> [String]
Mapping over a nested functor?
-
blog :: Brent -> [String]
Follow
-
blog :: Brent -> [String]
Posted in math | Tagged absolute value , average , derivative , median , optimization | 1 Comment
-
blog :: Brent -> [String]
Competitive programming in Haskell: Kadane’s algorithm
-
blog :: Brent -> [String]
Competitive programming in Haskell: Kadane’s algorithm
I will be giving a talk on competitive … -
blog :: Brent -> [String]
Implementing Hindley-Milner with the unification-fd library
For a current project, I needed to … -
blog :: Brent -> [String]
Lightweight invertible enumerations in Haskell
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged haskell , Kattis | 4 Comments
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged haskell , Kattis | 1 Comment
-
blog :: Brent -> [String]
Competitive programming in Haskell: monoidal accumulation
In my last competitive programming post , … -
blog :: Brent -> [String]
Teaching abstraction
-
blog :: Brent -> [String]
Collecting unstructured information with the monoid of partial knowledge
-
blog :: Brent -> [String]
Maniac week
-
blog :: Brent -> [String]
Competitive programming in Haskell: summer series
-
blog :: Brent -> [String]
Data structure challenge: finding the rightmost empty slot
-
blog :: Brent -> [String]
Posted in projects , teaching | Tagged math , pedagogy , programming , sets , types , language , …
-
blog :: Brent -> [String]
Posted in projects , teaching | Tagged foundations , language , math , pedagogy , programming , sets …
-
blog :: Brent -> [String]
Types versus sets in math and programming languages
-
blog :: Brent -> [String]
Types versus sets in math and programming languages
For several years I have been designing and … -
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged 2D , fold , geometry , haskell , Kattis , line …
-
blog :: Brent -> [String]
Posted in competitive programming , haskell | Tagged 2D , fold , geometry , haskell , Kattis , line …
-
blog :: Brent -> [String]
Competitive programming in Haskell: folding folds
Average and median via optimization -
blog :: Brent -> [String]
Competitive programming in Haskell: folding folds
Now that the semester is over—and I will be on … -
blog :: Brent -> [String]
Competitive Programming in Haskell: reading large inputs with ByteString
-
blog :: Brent -> [String]
Lightweight, efficiently sampleable enumerations in Haskell
-
blog :: Brent -> [String]
A (work in progress) translation of Joyal’s original paper on species
cabal init -
blog :: Brent -> [String]
Generating plane tilings with diagrams
-
blog :: Brent -> [String]
Beeminding for fun and profit
-
blog :: Brent -> [String]
Average and median via optimization
This is certainly not a new observation, and I’m sure it is … -
blog :: Brent -> [String]
Anafunctors
-
blog :: Brent -> [String]
The Poisson distribution and Stirling numbers
-
blog :: Brent -> [String]
Algorithms lecture notes and assignments
-
blog :: Brent -> [String]
Competitive programming in Haskell: permutations
-
blog :: Brent -> [String]
Anyone willing to help me get set up with something like miso?
-
blog :: Brent -> [String]
On a Problem of sigfpe
-
blog :: Brent -> [String]
Singing card guts
-
blog :: Brent -> [String]
In praise of Beeminder
-
blog :: Brent -> [String]
Polynomial Functors Constrained by Regular Expressions
-
blog :: Brent -> [String]
Tic-tac-toe maps with diagrams
-
blog :: Brent -> [String]
Monads: Easy or Hard?
-
blog :: Brent -> [String]
Unsubscribing from Wolfram emails (rant)
-
blog :: Brent -> [String]
Write a Comment…
-
blog :: Brent -> [String]
Random binary trees with a size-limited critical Boltzmann sampler
-
blog :: Brent -> [String]
Follow Following
Already have a WordPress.com account? Log in now.
Customize
Sign up
Report this … -
blog :: Brent -> [String]
Sum of heights in a binary tree
-
blog :: Brent -> [String]
Competitive programming in Haskell: building unordered trees
-
blog :: Brent -> [String]
Math.Combinatorics.Multiset and Sawada's algorithm
-
blog :: Brent -> [String]
Binders Unbound
-
blog :: Brent -> [String]
Species and Functors and Types, Oh My!
-
blog :: Brent -> [String]
Combinatorial species definition
-
blog :: Brent -> [String]
foldr is made of monoids
-
blog :: Brent -> [String]
Worstsort
-
blog :: Brent -> [String]
Competitive programming in Haskell: sorting tree shapes
-
blog :: Brent -> [String]
Typed type-level programming in Haskell, part I: functional dependencies
-
blog :: Brent -> [String]
How to print things
-
blog :: Brent -> [String]
Adventures in enumerating balanced brackets
Finding roots of polynomials in Haskell? -
blog :: Brent -> [String]
Computing Eulerian paths is harder than you think
-
blog :: Brent -> [String]
Competitive programming in Haskell: vectors and 2D geometry
-
blog :: Brent -> [String]
Parsing context-sensitive languages with Applicative
-
blog :: Brent -> [String]
Competitive Programming in Haskell: primes and factoring
-
blog :: Brent -> [String]
Competitive Programming in Haskell: modular arithmetic, part 1
-
blog :: Brent -> [String]
Competitive Programming in Haskell: Scanner
-
blog :: Brent -> [String]
For Tuesday, I invite you to solve The Power of Substitution . Don’t let the high difficulty rating …
-
blog :: Brent -> [String]
Blog at WordPress.com. Do Not Sell My Personal Information
-
blog :: Brent -> [String]
Create a free website or blog at WordPress.com.
-
blog :: Brent -> [String]
Competitive Programming in Haskell: Basic Setup
-
blog :: Brent -> [String]
Conversations with a six-year-old on functional programming
-
blog :: Brent -> [String]
Competitive programming in Haskell: folding challenge
Competitive programming in Haskell: data … -
blog :: Brent -> [String]
Blog at WordPress.com.
-
blog :: Brent -> [String]
Create a free website or blog at WordPress.com. Do Not Sell My Personal Information
-
blog :: Brent -> [String]
[Nothing new, only with content removed]
-
https://byorgey.wordpress.com
[Marking site as being monitored from now on]