[{"data":1,"prerenderedAt":294},["ShallowReactive",2],{"project-18761359":3},{"id":4,"name":5,"line":6,"line_source":7,"title":8,"url":9,"domain":10,"maker":11,"posted_at":12,"year":13,"points":14,"comments":15,"rank_in_year":16,"shown_in_year":17,"top":18,"tier":19,"category":20,"subcategory":21,"format":22,"keywords":23,"reception":28,"sentiment":29,"stance_mix":30,"scored_comments":33,"aspects":34,"strip":42,"post_text":45,"what":46,"said":79,"maker_in_thread":129,"shape":139,"grid":144,"attempts":226,"same_week":257,"maker_shows":31,"maker_hidden":286,"reader_version":287,"card":288},"18761359","lambdatalk FFT","A minimal FFT code","title","Show HN: A minimal FFT code","http:\u002F\u002Flambdaway.free.fr\u002Flambdaspeech\u002F?view=zorg","lambdaway.free.fr","martyalain",1545815557,2018,100,32,434,2155,21,"notable","languages","functional language demo","web_app",[24,25,26,27],"fft","lambda calculus","lisp","functional programming","loved",0.368,{"positive":31,"neutral":31,"mixed":32,"critical":32},4,0,8,{"idea":35,"performance":37,"docs":38,"design":40,"execution":41},{"positive":36,"critical":32},1,{"positive":32,"critical":32},{"positive":39,"critical":32},2,{"positive":32,"critical":32},{"positive":36,"critical":32},[43,32,44,32,43,32,44,32,43,32,32,32,32,32,32,32,32,32,32,32,44,43,32,32,32,32,44,32,32,32,32,32],5,3,null,{"problem":47,"audience":45,"pricing":45,"motivation":54,"time_to_build":45,"stack":61,"openness":78,"stage":78,"team_size":78},{"value":48,"source":49,"evidence":50},"Implements the FFT as a pure functional lambda-calculus-level program.","maker",[51],{"id":52,"by":11,"text":53},"18763045","Actually my quest is to write the FFT code at the lambda-calculus level. Why? First for the fun and also because I consider that lambda-calculus is for the mind what assembly…",{"value":55,"source":49,"evidence":56},"Fun, and needed FFT for fast multiplication of large numbers in a lambda-calculus numeration project.",[57,58],{"id":52,"by":11,"text":53},{"id":59,"by":11,"text":60},"18806806","Thank you for your clever code. This morning I improved a little the JS code in http:\u002F\u002Flambdaway.free.fr\u002Flambdaspeech\u002Findex.php?view=lispology and I plan to learn, understand and…",[62,72],{"value":63,"source":49,"evidence":64},"lambdatalk",[65,69],{"id":66,"by":67,"text":68},"18761886","dpwm","I'm familiar with most functional languages. This post was in a language with slightly unusual syntax. Still, I found what this is written in to be surprisingly quite readable.…",{"id":70,"by":11,"text":71},"18762962","And {lambda talk} works in a small wiki (25kb zipped folder) working as a light overlay on any modern web browsers, taking benefit of their powerfull capabilities…",{"value":73,"source":49,"evidence":74},"JavaScript",[75],{"id":76,"by":11,"text":77},"18775607","\"The code is mostly equivalent to the recursive form found in the wikipedia article on the cooley-tukey algorithm\" I don't think so. A JS translation of the code shown in…","unknown",{"praise":80,"objections":86,"requests":94,"questions":106,"alternatives":114},[81],{"value":82,"source":83,"evidence":84},"Code is readable and a good teaching resource","commenter",[85],{"id":66,"by":67,"text":68},[87],{"value":88,"source":83,"evidence":89},"Lisp-style implementation is slower than desirable for practical use",[90],{"id":91,"by":92,"text":93},"18763500","jacobolus","A lisp implementation is cute and can be a nice teaching aid but is slower than desirable for practical applications. What I would really like to see is a reasonably short (small…",[95,99],{"value":96,"source":83,"evidence":97},"A WebAssembly FFT implementation",[98],{"id":91,"by":92,"text":93},{"value":100,"source":83,"evidence":101},"Implementations in more common languages",[102],{"id":103,"by":104,"text":105},"18761669","InGodsName","Would be cool if it shows code in most common programming languages",[107],{"value":108,"source":83,"evidence":109},"Is it a translation of the Scheme-based fourlisp code?",[110],{"id":111,"by":112,"text":113},"18768124","nahtnam","The syntax kind of looks like Scheme to me.",[115,122],{"value":116,"source":83,"evidence":117},"Rosetta Code FFT implementations",[118],{"id":119,"by":120,"text":121},"18766005","Avshalom","Most implementations on http:\u002F\u002Frosettacode.org\u002Fwiki\u002FFast_Fourier_transform use the same algorithm.",{"value":123,"source":83,"evidence":124},"dsp.js",[125],{"id":126,"by":127,"text":128},"18764656","sheltron","have you seen this? I am not an expert in ffts so maybe it could be improved but it is impressively fast in my experience (also very readable) :…",{"comments":130,"answered":44,"key":131},10,[132,135,136],{"id":133,"text":134},"18762948","Thank you :)",{"id":70,"text":71},{"id":137,"text":138},"18768298","Yes, it's a translation of https:\u002F\u002Fwww.physik.uzh.ch\u002F~psaha\u002Fmus\u002Ffourlisp.php",{"commenters":140,"max_depth":141,"maker_replies":130,"first_comment_mins":142,"lifespan_hours":143},19,7,133,174,[145,149,151,153,155,157,159,160,162,165,169,171,174,178,181,184,186,190,193,196,198,200,204,206,208,211,214,217,218,220,223,224],[146,32,43,147,148,32],"18762688","project\u002Fpositive\u002Fidea","gregfjohnson",[133,32,32,150,11,36],"maker\u002Fpositive\u002Fnone",[91,36,44,152,92,32],"project\u002Fneutral\u002Fperformance",[126,36,32,154,127,32],"other\u002Fneutral\u002Fnone",[66,39,43,156,67,32],"project\u002Fpositive\u002Fdocs",[70,39,32,158,11,36],"project\u002Fneutral\u002Fdesign",[111,39,44,158,112,32],[137,39,32,161,11,36],"project\u002Fneutral\u002Fnone",[163,44,43,156,164,32],"18763534","salvad0r",[166,44,32,167,168,32],"18763604","other\u002Fneutral\u002Fdocs","giornogiovanna",[170,44,32,167,11,36],"18764757",[172,44,32,167,173,32],"18765552","jmiserez",[175,44,32,176,177,32],"18763862","commenter\u002Fneutral\u002Fnone","gct",[179,44,32,167,180,32],"18763985","llukas",[182,44,32,176,183,32],"18764284","amelius",[185,44,32,176,180,32],"18765051",[187,44,32,188,189,32],"18772201","other\u002Fpositive\u002Fnone","saganus",[191,44,32,167,192,32],"18764030","kazinator",[194,44,32,167,195,32],"18765909","betterunix2",[197,44,32,176,192,32],"18773090",[103,31,44,199,104,32],"project\u002Fneutral\u002Fidea",[201,31,43,202,203,32],"18762313","project\u002Fpositive\u002Fexecution","gp7",[52,31,32,205,11,36],"maker\u002Fneutral\u002Fidea",[76,31,32,207,11,36],"project\u002Fcritical\u002Fexecution",[209,31,32,210,203,32],"18797657","commenter\u002Fcritical\u002Fexecution",[212,31,32,213,11,36],"18799497","maker\u002Fneutral\u002Fnone",[215,31,44,216,203,32],"18802577","project\u002Fneutral\u002Fexecution",[59,31,32,205,11,36],[219,31,32,161,11,36],"18762979",[221,31,32,154,222,32],"18763054","basementcat",[119,31,32,154,120,32],[225,31,32,199,11,36],"18775496",[227,230,233,236,237,241,244,248,251,254],{"id":228,"t":229,"points":39,"comments":32},"18218426",1539595670,{"id":231,"t":232,"points":39,"comments":39},"18352222",1541062629,{"id":234,"t":235,"points":44,"comments":36},"18684459",1544819754,{"id":4,"t":12,"points":14,"comments":15},{"id":238,"t":239,"points":33,"comments":240},"19160864",1550139927,16,{"id":242,"t":243,"points":44,"comments":36},"19927229",1557996413,{"id":245,"t":246,"points":247,"comments":36},"21716357",1575579172,6,{"id":249,"t":250,"points":31,"comments":32},"21842353",1576827990,{"id":252,"t":253,"points":36,"comments":32},"21877635",1577263408,{"id":255,"t":256,"points":39,"comments":36},"22222682",1580722048,[258,263,267,271,276,281],{"id":259,"name":260,"points":261,"category":262},"18738275","curves",341,"creative",{"id":264,"name":265,"points":266,"category":20},"18755782","Wiv.js",265,{"id":268,"name":269,"points":270,"category":20},"18750561","Magic Grid",167,{"id":272,"name":273,"points":274,"category":275},"18765482","Notable",124,"productivity",{"id":277,"name":278,"points":279,"category":280},"18725485","Serverless Analytics (Statsbot \u002F Cube.js)",114,"data",{"id":282,"name":283,"points":284,"category":285},"18754010","Inside Python Dict",111,"learning_science",false,"v2",{"id":289,"name":5,"line":6,"ai":286,"cat":20,"year":13,"points":14,"comments":15,"rec":28,"s":290,"top":18,"kw":291,"maker":11,"domain":10,"tier":19,"attempts":130,"strip":292,"url":9,"mix":293,"praise":82,"objection":88,"sub":21},18761359,0.37,[24,25,26,27],"50305030500000000000350000300000",[31,31,32,32],1793990983723]