{"push_id":843503427,"size":2,"distinct_size":2,"ref":"refs/heads/alpha","head":"83a3c132b4806643dde5b6e2cae58f91af1de59c","before":"18503b523cf2d00a4fbb3d7add8ad7e30cffca93","commits":[{"sha":"afc89d80e7aa413f80158552baa71ca1da94c3f5","author":{"email":"bb006872d448ed65d3acd0ff0c8cd065774a9ff4@gmail.com","name":"BourgondAries"},"message":"Add bitwise or and a few other expressions","distinct":true,"url":"https://api.github.com/repos/BourgondAries/Cxy/commits/afc89d80e7aa413f80158552baa71ca1da94c3f5"},{"sha":"83a3c132b4806643dde5b6e2cae58f91af1de59c","author":{"email":"bb006872d448ed65d3acd0ff0c8cd065774a9ff4@gmail.com","name":"BourgondAries"},"message":"Add the most basic expressions to the semantic checker.\n\nThe current method of accepting expressions is to check if certain children are any\nacceptable expressions. This contains all other expressions, as well as the resources.\nThis implies a simplification on the high level of the expression tree. The resources\nthemselves need to check how they operate on the type expressions.","distinct":true,"url":"https://api.github.com/repos/BourgondAries/Cxy/commits/83a3c132b4806643dde5b6e2cae58f91af1de59c"}]}