{"repository":{"description":"The complexity of proof equivalence in multiplicative linear logic","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":13432,"owner":"robinhouston","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Python","created_at":"2013-07-09T07:04:30-07:00","pushed_at":"2013-09-13T07:49:51-07:00","master_branch":"master"},"actor_attributes":{"type":"User","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/robinhouston/mll-proof-equivalence/compare/8be82a4f5f...6191cf1b50"}