{"push_id":2798051282,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d6dfc47ba7f7cc32b01d97ffae93bd66e904b79d","before":"e2b65759c6881c118a9ab0015dfd862bf3a5ff60","commits":[{"sha":"d6dfc47ba7f7cc32b01d97ffae93bd66e904b79d","author":{"name":"Joshua Grosso","email":"c970f740df47a972f98dc21b548ad61089e5abfd@gmail.com"},"message":"Use top-to-bottom macro expansion, a la Clojure + prepare for Hackage\npublishing\n\nHaskell (usually) doesn't care about the order in which things are defined, but keeping this guarantee in the presence of macros has turned out to be very difficult (if realistically feasible at all). Because macros can be defined by other macros, the AST would need to be re-expanded and re-expanded, and some edge cases were very nontrivial. So, we're following in Clojure's footsteps, which has solved the problem by enforcing top-to-bottom expansion (note that non-macro-involved functions can be defined wherever and are not subject to this restriction).","distinct":true,"url":"https://api.github.com/repos/axellang/axel/commits/d6dfc47ba7f7cc32b01d97ffae93bd66e904b79d"}]}
{"actor":{"display_login":"jgrosso"}}