{"push_id":642672814,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"d0f516cb46931096c8a4501bdf961d9b070e772f","before":"7c377d9e183b298d132c57cc1458a84176210a50","commits":[{"sha":"d0f516cb46931096c8a4501bdf961d9b070e772f","author":{"email":"55d3adac59a90c20c2300f76c4607c39d7389535@gmail.com","name":"marriola"},"message":"Added Conway's game of life example. The code works and can be tested in CLISP with the LIFE-LOOP function, although my Lisp implementation still has a bug somewhere to be worked out, as ADVANCE-ROW produces rows that are either all NIL or all T, which is clearly not right.","distinct":true,"url":"https://api.github.com/repos/marriola/dlisp/commits/d0f516cb46931096c8a4501bdf961d9b070e772f"}]}