A dynamic type implementation.
Graph creator for dynatype translators
Backend driver for buggy components.
takes a portgraph (e.g. from math2graph) and remodels the port information by creating a node for each port and connecting them accordingly.
Algorithms to convert a program descriptor into a full graph representation.
Tools for processing buggy graphs.
Program that removes multiple out and in edges in a NG.
Creates go code from buggy graphs
Applies a type scheme to a weakly typed buggy graph.
Transformation of functional concepts.
Converter from the graphlib format into the kgraph format.
visualize the graph of an buggy network graph
CLI for Buggy.
A buggy graph consistency checker.
Adds continuations to multiplexers.
create simple buggy graphs from lisp code
Determines all generic types in a buggy graph.
Finds all links in a graph and replaces them with edges modifying the corresponding compounds.
Removes all unnecessary compounds (all but recursions and lambda functions) from a buggy graph.
An optimizer for Buggy control flow graphs.
Specification for buggy component library servers.
Library for buggy components stored in simple files, e.g. for local use.
Client implementation for Buggy library access.
Library for buggy components stored using mongodb.