3 ms·
Not really. You just need to walk up both types until you find a match. It's similar to a simple eval matcher, which is about 10 lines in lisp. https://github.
by rurban 8y ago
Not really. You just need to walk up both types until you find a match.
It's similar to a simple eval matcher, which is about 10 lines in lisp.
https://github.com/perl11/Bla https://github.com/perl11/Bla has typically the smallest and easiest to understand type inferencer and checker.