Skip to content
Projects

lexi-lambda/hackett has 1,205 GitHub stars and 52 forks. Star changes are not measured yet. Last checked 2026-11-09 08:28 UTC. Last push 2024-04-14.

How these counts are measured

WIP implementation of a Haskell-like Lisp in Racket

Measured star growth

in 24h
Update delayed
in 7 days
Update delayed
in 15 days
Update delayed
in 1 month
Update delayed

Net star changes over overlapping periods, not daily totals. Missing measurements are left blank. Stars measure attention, not software quality.

README.md

Original

Hackett Build Status

Hackett is an attempt to implement a Haskell-like language with support for Racket’s macro system, built using the techniques described in the paper Type Systems as Macros. It is currently extremely work-in-progress.

Here are some of the features that Hackett supports right now:

  • Bidirectional type inference
  • Algebraic datatypes (ADTs)
  • Pattern matching
  • Exhaustiveness checking
  • Typeclasses (including multi-parameter typeclasses)
  • Higher-kinded types
  • Higher-rank polymorphism
  • Type-aware/type-directed macros
  • Laziness
  • Syntax for infix operators
  • Scoped type variables

Here are some of the features that still need to be implemented for a minimal release:

  • Orphan/overlapping instance detection/prevention
  • Strictness analysis
  • Kindchecking

And finally, here is a (non-exhaustive) collection of features I would like to eventually support:

  • Functional dependencies
  • Row types
  • GADTs
  • Type families

Due to the way Hackett is implemented, many things that are language features in Haskell can be derived concepts in Hackett. In fact, Hackett’s ADTs are not primitives, they are actually implemented as a library via the data and case macros in hackett/private/adt. Other things, like newtype deriving and generics, should be possible to implement as derived concepts as well.

Here’s some sample Hackett code that demonstrates some of Hackett’s features:

#lang hackett

(data (Maybe a)
  Nothing
  (Just a))

(def x : Integer
  (let ([y 3]
        [z 7])
    {y + z}))

(class (Show a)
  [show : {a -> String}])

(instance (forall [a] (Show a) => (Show (Maybe a)))
  [show (λ* [[(Just x)] {"(Just " ++ (show x) ++ ")"}]
            [[Nothing ] "Nothing"])])

For a much more in-depth look at Hackett, see the documentation.

Trying Hackett

To reiterate: Hackett is extremely experimental right now. Things are not guaranteed to work correctly (or work at all), and things are likely to change dramatically. If you really want to install Hackett to play around with it, though, you can.

You will need to have Racket installed to use Hackett. Using raco, you can install Hackett as a package:

$ raco pkg install hackett

Now you can use Hackett by writing #lang hackett at the top of a file.

Explore related projects