{"action":"closed","issue":{"url":"https://api.github.com/repos/Heather/heather.github.io/issues/3","labels_url":"https://api.github.com/repos/Heather/heather.github.io/issues/3/labels{/name}","comments_url":"https://api.github.com/repos/Heather/heather.github.io/issues/3/comments","events_url":"https://api.github.com/repos/Heather/heather.github.io/issues/3/events","html_url":"https://github.com/Heather/heather.github.io/issues/3","id":67157073,"number":3,"title":"I am interest in this thing","user":{"login":"lolisa","id":3397377,"avatar_url":"https://avatars.githubusercontent.com/u/3397377?v=3","gravatar_id":"","url":"https://api.github.com/users/lolisa","html_url":"https://github.com/lolisa","followers_url":"https://api.github.com/users/lolisa/followers","following_url":"https://api.github.com/users/lolisa/following{/other_user}","gists_url":"https://api.github.com/users/lolisa/gists{/gist_id}","starred_url":"https://api.github.com/users/lolisa/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/lolisa/subscriptions","organizations_url":"https://api.github.com/users/lolisa/orgs","repos_url":"https://api.github.com/users/lolisa/repos","events_url":"https://api.github.com/users/lolisa/events{/privacy}","received_events_url":"https://api.github.com/users/lolisa/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"milestone":null,"comments":2,"created_at":"2015-04-08T15:34:25Z","updated_at":"2015-04-08T22:54:05Z","closed_at":"2015-04-08T22:54:05Z","body":"one example I’ve been interested in recently is putting Big-O complexity into types\r\nso proving some performance characteristics of algorithms\r\nWell in Coq, the closest I have seen is a Framework for proving qsort's complexity.\r\nCan you provide more description or provide a link?"}}