{"push_id":1270289336,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"b67de69b97b6cee9b78dc7f350dbb3aada82c138","before":"67f1c1d69805e6deea1ae6c280d3034fc9269d03","commits":[{"sha":"b67de69b97b6cee9b78dc7f350dbb3aada82c138","author":{"name":"YtGz","email":"2cf5aa0d13d64b6ceea6eff9567597cdd24dd0b4@student.uibk.ac.at"},"message":"several changes (see descr.)\n\n- enumerate specific graph nodes to enable the user to specify where\nmultiplicative split nodes are\n- ALWAYS introduce fresh variables in eval (to avoid sharing effects)\n- custom handling of Prolog 'cons' operator\n- introduce a limit to the graph size to allow for easy debugging of\nnon-termination behaviour\n- add helper function to access individual nodes of the graph (for\ndebugging purposes)","distinct":true,"url":"https://api.github.com/repos/YtGz/Analyzing-the-Complexity-of-Monotone-Prolog/commits/b67de69b97b6cee9b78dc7f350dbb3aada82c138"}]}
{"actor":{"display_login":"YtGz"}}