DESIGNING INTEROPERABLE DATA STRUCTURES FOR SCHEME, PROVER, AND A POTENTIAL FUTURE COMPUTER ALGEBRA SYSTEM‭

Something I ve been thinking about recently is that, given that the PROVER proof assistant exists now, and that it is embedded in the context of my larger Scheme Prelude , which has e.g. combinatorics libraries, and will eventually have a YAGL-like graph library, etc., and that further I d like very much for the Prelude to Continue reading "DESIGNING INTEROPERABLE DATA STRUCTURES FOR SCHEME,…