
Neural Analogy
This work draws upon advances in Graph Neural Networks and Transformers to perform analogical matching between graph representations of formal symbolic theories.
This work draws upon advances in Graph Neural Networks and Transformers to perform analogical matching between graph representations of formal symbolic theories.
This is a C implementation of Karatsuba's algorithm for fast multiplication of large integers. It will do base-conversions for whatever number is used (provided that the base is specified, of course).
I wrote this Scheme parser to help myself better understand the concept of hygenic macros. It has some features for loose matching of inputs, though it isn't intended to be a fully-comprehensive, super-efficient parser. Included in the repository is also a small, very simple interpreter written with the parser.