{"payload":{"pageCount":2,"repositories":[{"type":"Public","name":"parsial","owner":"reity","isFork":false,"description":"Python library that transforms any string parser into a parser that skips lines containing syntax errors.","allTopics":["parsing","parsing-library"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-31T18:33:25.581Z"}},{"type":"Public","name":"richreports-py","owner":"reity","isFork":false,"description":"Library that supports the construction of human-readable, interactive static analysis reports that consist of decorated concrete syntax representations of programs.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-31T18:10:14.001Z"}},{"type":"Public","name":"pratts","owner":"reity","isFork":false,"description":"Pure-Python implementation of a Pratt certificate verifier.","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-02-11T00:30:06.975Z"}},{"type":"Public","name":"barriers","owner":"reity","isFork":false,"description":"Python decorator for including/removing type checks, value/bounds checks, and other code blocks within the compiled bytecode of functions and methods.","allTopics":["python","python-library","type-checking","python-decorators","bounds-checking","python-syntax-converter","python-testing"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-10-28T04:23:11.066Z"}},{"type":"Public","name":"fountains","owner":"reity","isFork":false,"description":"Python library for generating and concisely specifying reproducible pseudorandom binary data for unit testing.","allTopics":["unit-testing","python-library","unit-tests","random-data-generation","unit-testing-framework","random-data","unit-testing-library","pseudorandom-generators"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-08-26T05:46:10.456Z"}},{"type":"Public","name":"circuit","owner":"reity","isFork":false,"description":"Minimal pure Python library for building and working with logical circuits.","allTopics":["python","logic","circuits","data-structures","circuit","logic-gates","logic-circuit","common-library"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":2,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-03-29T05:20:28.474Z"}},{"type":"Public","name":"circuitdb","owner":"reity","isFork":false,"description":"Data set of optimal circuits for Boolean functions that have low arity.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-01-30T01:33:22.026Z"}},{"type":"Public","name":"logical","owner":"reity","isFork":false,"description":"Callable subclass of the tuple type for representing logical operators/connectives based on their truth tables.","allTopics":["python-library","boolean-operations","logical-operators","python-operators","finite-maps","boolean-operators","python-logic","logic-operators","logic-operations","python-constants","python-operations"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-10-10T02:12:04.219Z"}},{"type":"Public","name":"algebraical","owner":"reity","isFork":false,"description":"Subclass of the built-in function type for representing algebraic operators (that are typically associated with algebraic structures and algebraic circuits) as immutable, hashable, sortable, and callable objects.","allTopics":["python-library","arithmetic","algebraic-structures","arithmetic-operators","python-arithmetic","python-algebra","arithmetic-operations","python-operators","python-constants","python-operations","algebraic-operators","python-algebraic-operators","python-algebraic-structures"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-09-05T22:17:17.935Z"}},{"type":"Public","name":"metatable","owner":"reity","isFork":false,"description":"Extensible table data structure that supports the introduction of user-defined workflow combinators and the use of these combinators in concise workflow descriptions.","allTopics":["python-library","table-data","python-data-structure"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-04T07:04:45.315Z"}},{"type":"Public","name":"symbolism","owner":"reity","isFork":false,"description":"Extensible combinator library for building symbolic Python expressions that are compatible with serialization and can be evaluated at a later time.","allTopics":["python-library","data-structures","symbolic-manipulation","symbolic-expressions","abstract-syntax-tree"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-04T06:57:21.113Z"}},{"type":"Public","name":"are","owner":"reity","isFork":false,"description":"Library for defining and working with abstract regular expressions that support strings/sequences with elements of any symbol type, with an emphasis on supporting scenarios in which it is necessary to work with regular expressions as abstract mathematical objects.","allTopics":["python","python-library","data-structures","regular-expressions","theory-of-computation","regular-languages","re-to-nfa"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-04T06:07:05.960Z"}},{"type":"Public","name":"nfa","owner":"reity","isFork":false,"description":"Pure-Python library for building and working with nondeterministic finite automata (NFAs).","allTopics":["nfa","nfa-library","python-data-structures","nfa2dfa","finite-automata","nondeterministic-finite-automata","nfa-implementation","nfa-to-dfa-conversion","finite-automaton","nfa-to-dfa"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-08-04T05:34:50.414Z"}},{"type":"Public","name":"article-specifications-for-distinguishing-functions","owner":"reity","isFork":false,"description":"This article presents a technique for assembling concise, lightweight specifications and unit tests for verifying the identity of a function; the technique sacrifices completeness to enable compact and portable specifications.","allTopics":["lightweight-framework","formal-specification","functional-verification","python-articles"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-09-09T23:23:18.795Z"}},{"type":"Public","name":"reity.github.io","owner":"reity","isFork":false,"description":"Reity organization webpage.","allTopics":[],"primaryLanguage":{"name":"HTML","color":"#e34c26"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-06-24T05:12:14.851Z"}},{"type":"Public","name":"article-permutation-circuit-synthesis","owner":"reity","isFork":false,"description":"This article describes how embedded languages and recursion can be used to create a tool that synthesizes a relatively efficient logical circuit for any chosen permutation of the set of all bit vectors of some fixed length.","allTopics":["python","logic-synthesis","logic-circuit","circuit-optimizaion","article"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-05-16T22:19:18.321Z"}},{"type":"Public","name":"closures","owner":"reity","isFork":false,"description":"Embedded domain-specific language for symbolic reasoning with basic support for automated verification and inference.","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-26T01:48:05.185Z"}},{"type":"Public","name":"capsules","owner":"reity","isFork":false,"description":"Python library for encapsulating a function definition inside a temporary module file (mostly for use with multiprocessing and Jupyter Notebook).","allTopics":["multiprocessing","python-library","jupyter-notebook","picklers","pickling"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-20T04:11:00.593Z"}},{"type":"Public","name":"canaries","owner":"reity","isFork":false,"description":"Python library for choosing and loading dynamic library files compatible with the operating environment.","allTopics":["python-library","ctypes-wrapper"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-20T04:10:32.727Z"}},{"type":"Public","name":"trudge","owner":"reity","isFork":false,"description":"Enumeration (using Python generators) of finite and infinite discrete spaces.","allTopics":["python-library","mathematics","enumeration","state-space-search","exhaustive-search"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-11-03T20:24:44.000Z"}},{"type":"Public","name":"article-small-circuits-database","owner":"reity","isFork":false,"description":"This article describes the process used for generating a published data set that associates each boolean function (in a finite subset of all such functions) to one or more of the smallest logical circuits that correspond to that function.","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-28T02:59:44.317Z"}},{"type":"Public","name":"constellation-js","owner":"reity","isFork":true,"description":"Library for combinatorially specifying, constraining, and exploring genetic design spaces.","allTopics":[],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":8,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-10-23T15:33:41.485Z"}},{"type":"Public","name":"ei","owner":"reity","isFork":false,"description":"Python library for exporting a function to a file and subsequently invoking it (mostly for use with Jupyter Notebook).","allTopics":[],"primaryLanguage":null,"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-08-12T16:55:10.988Z"}},{"type":"Public","name":"monoliths","owner":"reity","isFork":false,"description":"Python tool for automatically wrapping a multi-module Python library into a single portable module file.","allTopics":["modules","python-library","portability","consolidation"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-07-09T12:55:13.544Z"}},{"type":"Public","name":"goldbar","owner":"reity","isFork":false,"description":"Embedded language for defining and working with genetic design spaces.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-05-17T04:18:44.389Z"}},{"type":"Public","name":"imparse","owner":"reity","isFork":false,"description":"Lightweight infinite-lookahead Python parser generator that supports basic grammars defined in a JSON format.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-05-09T03:58:19.967Z"}},{"type":"Public","name":"wff","owner":"reity","isFork":false,"description":"Python library for building and working with propositional formulas.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-27T00:14:53.571Z"}},{"type":"Public","name":"summations-js","owner":"reity","isFork":false,"description":"Library to enumerate all natural number lists with a target sum.","allTopics":["mathematics","javascript-library","enumeration","combinatorics","combinations","javascript-lib","exhaustive-search"],"primaryLanguage":{"name":"JavaScript","color":"#f1e05a"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-12-06T04:59:34.962Z"}},{"type":"Public","name":"summations-py","owner":"reity","isFork":false,"description":"Library to enumerate all natural number lists with a target sum.","allTopics":["python-library","mathematics","enumeration","combinations","exhaustive-search"],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-12-05T06:36:25.078Z"}},{"type":"Public","name":"pyquil","owner":"reity","isFork":true,"description":"A Python library for quantum programming using Quil.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":341,"license":"Apache License 2.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2019-11-26T21:14:50.498Z"}}],"repositoryCount":31,"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":"reity repositories"}