Category Archives: Linguistics

Recursive Tuples

Posted on 2026-03-06

Started 2021-04 Haskell does not expose the recursive structure of tuples; for each natural number n (up to a certain limit which happens to be 62), Haskell provides a data type for a tuple of size n1, but there is … Continue reading →

Posted in Computer Science, Functional Programming, Linguistics | Tagged , , , | Leave a comment

Infix Order Reversal

Posted on 2020-09-13

In Haskell, given any function with two arguments (curried) we can choose to use it infix position. The syntax for this depends on how we name the function; if we name the function in the form (s) then s is the infix form of the function, and otherwise an arbitrary function f can be converted to infix form by wrapping in backticks, as in `f`.

In either case, the infix form of the function expects the arguments in a certain order, and the order used in Haskell is:

(s) x y := x s y

I think it would be more natural if the order was the other way around, so:

(s) x y := y s x Continue reading →

Posted in Computer Science, Functional Programming, Linguistics | 3 Comments

Grammar is like a Type System

Posted on 2019-09-08

In an analogy between natural language and programming language, grammar can be compared to a type system, which provides a great way to learn about one if you know about the other1. Continue reading →

Posted in Category Theory, Functional Programming, Linguistics | Leave a comment