freenode/#lisp - IRC Chatlog
Search
7:32:37
verisimilitude
Common Lisp features many advanced (uncommon) mathematical facilities in the standard language.
7:33:01
no-defun-allowed
There's some BLAS FFI things, some native libraries for matrices which might be a tad slower, and some other stuff in there.
8:11:34
aeth
most optimized (as in, knows the implementation details) mathematics for CL is graphics/game/real-time-physics math afaik.
8:12:19
no-defun-allowed
https://gist.github.com/nodefunallowed/95b95469449124570f36bb05192b7ef8 is an example of a petalisp program
8:13:24
no-defun-allowed
also i suggest you get a greek input method so you can write α and β, since a and b don't look as nice
8:21:07
beach
We think this paper http://metamodular.com/make-method-lambda.pdf is pretty much ready to go. If anyone here would like to appear in the "Acknowledgments" section, this is your opportunity to proofread the paper and suggest improvements. Make sure you tell us how you would like to be referred to.
8:21:09
beach
There is no rush. There is another week until the deadline, and it is likely that there will be a deadline extension.
14:32:03
heisig
Sounds like just a few lines of code. Build an EQUAL hash table of forms, walk all files, populate the table and count their appearance.
14:35:19
heisig
It would reliably detect all duplicate code. Or do you mean similar code? Detecting that would be much harder.
14:37:13
heisig
Then you would need a code walker (e.g., agnostic-lizard) and a metric for similarity.
14:41:52
heisig
Maybe you could use a generic plagiarism checker. It might not be tailored towards CL, but could work reasonably well.
14:48:30
shka_
then go, calculate hashes of direct children operands, multiply with hash of the parent and also put it into filter
14:49:22
shka_
this way you would end up with fixed size data structure that would hold estimate of the whole structure
14:51:53
shka_
base case when you only considering two pieces of code while checking for duplication