Pinned Repositories
are
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.
article-permutation-circuit-synthesis
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.
circuit
Minimal pure Python library for building and working with logical circuits.
fountains
Python library for generating and concisely specifying reproducible pseudorandom binary data for unit testing.
goldbar
Embedded language for defining and working with genetic design spaces.
imparse
Lightweight infinite-lookahead Python parser generator that supports basic grammars defined in a JSON format.
logical
Callable subclass of the tuple type for representing logical operators/connectives based on their truth tables.
monoliths
Python tool for automatically wrapping a multi-module Python library into a single portable module file.
nfa
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
symbolism
Extensible combinator library for building symbolic Python expressions that are compatible with serialization and can be evaluated at a later time.
Reity's Repositories
reity/circuit
Minimal pure Python library for building and working with logical circuits.
reity/nfa
Pure-Python library for building and working with nondeterministic finite automata (NFAs).
reity/logical
Callable subclass of the tuple type for representing logical operators/connectives based on their truth tables.
reity/symbolism
Extensible combinator library for building symbolic Python expressions that are compatible with serialization and can be evaluated at a later time.
reity/are
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.
reity/barriers
Python decorator for including/removing type checks, value/bounds checks, and other code blocks within the compiled bytecode of functions and methods.
reity/goldbar
Embedded language for defining and working with genetic design spaces.
reity/imparse
Lightweight infinite-lookahead Python parser generator that supports basic grammars defined in a JSON format.
reity/monoliths
Python tool for automatically wrapping a multi-module Python library into a single portable module file.
reity/summations-js
Library to enumerate all natural number lists with a target sum.
reity/article-permutation-circuit-synthesis
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.
reity/canaries
Python library for choosing and loading dynamic library files compatible with the operating environment.
reity/circuitdb
Data set of optimal circuits for Boolean functions that have low arity.
reity/ei
Python library for exporting a function to a file and subsequently invoking it (mostly for use with Jupyter Notebook).
reity/fountains
Python library for generating and concisely specifying reproducible pseudorandom binary data for unit testing.
reity/algebraical
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.
reity/article-small-circuits-database
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.
reity/article-specifications-for-distinguishing-functions
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.
reity/capsules
Python library for encapsulating a function definition inside a temporary module file (mostly for use with multiprocessing and Jupyter Notebook).
reity/closures
Embedded domain-specific language for symbolic reasoning with basic support for automated verification and inference.
reity/constellation-js
Library for combinatorially specifying, constraining, and exploring genetic design spaces.
reity/metatable
Extensible table data structure that supports the introduction of user-defined workflow combinators and the use of these combinators in concise workflow descriptions.
reity/parsial
Python library that transforms any string parser into a parser that skips lines containing syntax errors.
reity/pratts
Pure-Python implementation of a Pratt certificate verifier.
reity/pyquil
A Python library for quantum programming using Quil.
reity/reity.github.io
Reity organization webpage.
reity/richreports-py
Library that supports the construction of human-readable, interactive static analysis reports that consist of decorated concrete syntax representations of programs.
reity/summations-py
Library to enumerate all natural number lists with a target sum.
reity/trudge
Enumeration (using Python generators) of finite and infinite discrete spaces.
reity/wff
Python library for building and working with propositional formulas.