{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"redfin","owner":"tuura","isFork":false,"description":"Specification and verification of the REDFIN sequencer","allTopics":["processor","formal-verification","instruction-set"],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":1,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-14T15:15:44.488Z"}},{"type":"Public","name":"boolean","owner":"tuura","isFork":false,"description":"A library for manipulating Boolean expressions","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":5,"starsCount":3,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-14T10:55:59.445Z"}},{"type":"Public","name":"pangraph","owner":"tuura","isFork":false,"description":"A Haskell library for mathematical graph parsing and writing.","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":3,"issueCount":7,"starsCount":20,"forksCount":4,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-19T10:40:30.048Z"}},{"type":"Public","name":"plato","owner":"tuura","isFork":false,"description":"A DSL for asynchronous circuits specification","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":1,"issueCount":11,"starsCount":11,"forksCount":2,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-01T17:40:37.812Z"}},{"type":"Public","name":"selective-theory-coq","owner":"tuura","isFork":false,"description":"Selective applicative functors laws and theorems ","allTopics":[],"primaryLanguage":{"name":"Coq","color":"#d0b68c"},"pullRequestCount":0,"issueCount":0,"starsCount":14,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-03-12T20:43:23.873Z"}},{"type":"Public","name":"tuura-website","owner":"tuura","isFork":false,"description":"Content of <a href=\"https://tuura.org\" rel=\"nofollow\">https://tuura.org</a>","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-03-07T00:37:12.435Z"}},{"type":"Public","name":"fine-grained-state","owner":"tuura","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"BSD 3-Clause \"New\" or \"Revised\" License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-10-24T18:23:01.579Z"}},{"type":"Public","name":"iam","owner":"tuura","isFork":false,"description":" I am an Inglorious Adding Machine","allTopics":[],"primaryLanguage":{"name":"SMT","color":"#ccc"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-04-01T17:44:42.112Z"}},{"type":"Public","name":"posters","owner":"tuura","isFork":false,"description":"This repository stores the posters made by the microSystems' research team, School of Engineering, Newcastle University (UK).","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-01-21T12:20:59.324Z"}},{"type":"Public","name":"build-systems-in-coq","owner":"tuura","isFork":false,"description":"Build Systems à la Carte formalised in Coq.","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-12-09T18:17:26.714Z"}},{"type":"Public","name":"graph-visualisation","owner":"tuura","isFork":false,"description":"Provides a series of graph-drawing functions for use with the algebraic-graphs library.","allTopics":["haskell","graphs","graph-visualisation"],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":0,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-11-11T18:13:25.950Z"}},{"type":"Public","name":"fantasi","owner":"tuura","isFork":false,"description":"Fast network analysis in silicon","allTopics":[],"primaryLanguage":{"name":"C","color":"#555555"},"pullRequestCount":1,"issueCount":0,"starsCount":3,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-10-07T12:12:14.899Z"}},{"type":"Public","name":"selective-theory-agda","owner":"tuura","isFork":false,"description":"Selective functors formalised in Agda","allTopics":[],"primaryLanguage":{"name":"Agda","color":"#315665"},"pullRequestCount":0,"issueCount":0,"starsCount":6,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-09-16T22:28:34.164Z"}},{"type":"Public","name":"tuura-api","owner":"tuura","isFork":false,"description":"Restful functions on <a href=\"https://tuura.org/api\" rel=\"nofollow\">https://tuura.org/api</a>","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-31T14:14:34.907Z"}},{"type":"Public","name":"scenco","owner":"tuura","isFork":false,"description":"SCENCO (=SCENario ENCOder) is a tool for the encoding and hardware synthesis of Conditional Partial Order Graphs.","allTopics":[],"primaryLanguage":{"name":"VHDL","color":"#adb2cb"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-07-23T10:20:06.495Z"}},{"type":"Public","name":"sync-models","owner":"tuura","isFork":false,"description":"Tool for creating synchronous models and behavioral specifications for asynchronous circuits","allTopics":["verilog","model-checking","digital-logic","formal-verification","asynchronous-circuits"],"primaryLanguage":{"name":"Verilog","color":"#b2b7f8"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-06-19T16:32:11.244Z"}},{"type":"Public","name":"sync-models-paper","owner":"tuura","isFork":false,"description":"Paper on sync-async verification","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-06-12T13:36:20.892Z"}},{"type":"Public","name":"critic","owner":"tuura","isFork":false,"description":"XML parser","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":4,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-05-22T11:53:10.106Z"}},{"type":"Public","name":"async-traversal-paper","owner":"tuura","isFork":false,"description":"Asynchronous Network Traversal for Computational Drug Discovery","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-05-14T13:51:38.146Z"}},{"type":"Public","name":"poets-slides-template","owner":"tuura","isFork":false,"description":"Template for creating talk slides based on remarkjs","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-05-03T14:34:10.334Z"}},{"type":"Public","name":"archer","owner":"tuura","isFork":false,"description":"An experimental embedded domain specific language for describing instruction set architectures semantics.","allTopics":[],"primaryLanguage":{"name":"Idris","color":"#b30000"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-04-19T12:35:27.273Z"}},{"type":"Public","name":"circuit-complexity","owner":"tuura","isFork":false,"description":"Experiments for improving circuit complexity bounds","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-04-10T13:51:54.318Z"}},{"type":"Public","name":"papers","owner":"tuura","isFork":false,"description":"Tuura papers and slides","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-02-26T23:40:38.782Z"}},{"type":"Public","name":"streams","owner":"tuura","isFork":false,"description":"Experimenting with typed streams","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-02-20T03:09:18.825Z"}},{"type":"Public","name":"process-mining","owner":"tuura","isFork":false,"description":"A library for process mining","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":2,"starsCount":8,"forksCount":1,"license":"Other","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-12-14T23:09:25.181Z"}},{"type":"Public","name":"iam-report","owner":"tuura","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-12-04T16:49:10.669Z"}},{"type":"Public","name":"path-finding","owner":"tuura","isFork":false,"description":"Experimenting with path-finding algorithms in Haskell","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-11-02T15:45:40.491Z"}},{"type":"Public","name":"striot-monads-seminar","owner":"tuura","isFork":false,"description":"Presentation and examples of <a class=\"user-mention\" data-hovercard-type=\"user\" data-hovercard-url=\"/users/geo2a/hovercard\" data-octo-click=\"hovercard-link-click\" data-octo-dimensions=\"link_type:self\" href=\"https://github.com/geo2a\">@geo2a</a>'s Strior seminar talk on monads","allTopics":[],"primaryLanguage":{"name":"TeX","color":"#3D6117"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-11-01T14:47:14.448Z"}},{"type":"Public","name":"centrifuge","owner":"tuura","isFork":false,"description":"Parse GraphML, crunch with Alga, pretty-print to VHDL ","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":2,"starsCount":8,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-25T17:57:30.202Z"}},{"type":"Public","name":"les-to-cpog","owner":"tuura","isFork":false,"description":"Computing the size of the CPOG and LES corresponding to a given unfolding","allTopics":[],"primaryLanguage":{"name":"Haskell","color":"#5e5086"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-02T01:37:04.123Z"}}],"repositoryCount":39,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}