- dds: A Home-made Toolkit for Discrete Dynamical Systems in Racket
ob-racketto work with Typed Racket
- Fix example.org
- Think about splitting the library into lib and doc
- Implement string rewriting
- Implement P systems
- Consider splitting
dds/utilsinto a separate package
- Implement a shorter syntax for defining Boolean functions
- Consider optimizing the algorithms in
- Implement the BN → RS conversion
- Implement the minimisation of TBF/SBF
- Contribute to Racket
- Test network inference with Racklog
dds: A Home-made Toolkit for Discrete Dynamical Systems in Racket
This is a toolkit for playing with various discrete dynamical systems in Racket. A discrete dynamical system is a system which evolves from a discrete state to some other discrete states (many or one). The systems are discrete in the sense that we can identify successive states with no other states in between. Equivalently, the phase state of the system is discrete (and is often called the state graph). These constraints imply the possibility of associating discrete, possibly branching timelines to any evolution of the system.
DISCLAIMER: I develop this toolkit as a support for my research on discrete dynamical systems. The primary objective for this framework is to fit my approach to these systems. Essentially, this framework should fit to the "shape of my mind", which is not necessarily the same as yours.
Currently, the toolkit includes the following files:
- generic.rkt: The generic interface for a discrete dynamical system, with functions for constructing state graphs.
- utils.rkt: Misc utilities.
- functions.rkt: Definitions for working with functions: tabulating, constructing from tables, generating random functions, etc.
- networks.rkt: Implements network-based models, which generalise Boolean networks, threshold Boolean automata networks, multivalued networks, etc.
- rs.rkt: Implements reaction systems, a variant of set rewriting.
Here is my current roadmap for this toolkit, in order. The first element is what I am currently working on. The degree of certainty that I work on the subsequent items decreases with their position in the list.
ob-racket to work with Typed Racket
ob-racket backend for running Racket code blocks in
Org-mode assumes the code is written in
#lang racket, which breaks
the output for tables for example. This makes the typed version of
dds essentially useless with tables.
TODO Fix example.org
I changed quite a number of things while converting
dds to Typed
Racket, which should break a lot of things in example.org.
TODO Think about splitting the library into lib and doc
TODO Implement string rewriting
TODO Implement P systems
dds/utils into a separate package
TODO Implement a shorter syntax for defining Boolean functions
Right now, this is how one defines the Boolean function:
(define (update-go st) (auto-hash-ref/: st (or (and (not :Go) :new-x) (and :Go :old-x))))
It would be nice and probably not too difficult to implement a macro allowing for a syntax like the following one:
(define-pbf my-pbf (or (and (not :Go) :new-x) (and :Go :old-x)))
monotone? would verify whether a given Boolean function is
monotone according to the definition in the book Boolean
Functions: Theory, Algorithms, and Applications by Crama
Consider optimizing the algorithms in
TODO Implement the BN → RS conversion
TODO Implement the minimisation of TBF/SBF
TODO Contribute to Racket
- Make sequence-filter allow multivalued sequences, provided the arity of the predicate is consistent with the arity of the sequence.
- Add a sequence->hash function that accepts a multivalued sequence of keys and values (exactly like what in-hash produces) and copies them into a hash table.