This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
2023-09-27
Channels
- # announcements (1)
- # asami (10)
- # babashka (12)
- # beginners (26)
- # biff (4)
- # calva (42)
- # cider (1)
- # clj-commons (2)
- # cljs-dev (2)
- # clojure (179)
- # clojure-dev (2)
- # clojure-europe (45)
- # clojure-norway (16)
- # clojure-uk (3)
- # clojurescript (5)
- # datahike (1)
- # datascript (2)
- # events (3)
- # exercism (1)
- # fulcro (13)
- # funcool (3)
- # graalvm (23)
- # helix (3)
- # honeysql (1)
- # hyperfiddle (3)
- # lsp (51)
- # malli (2)
- # off-topic (27)
- # portal (18)
- # reagent (3)
- # reitit (3)
- # releases (8)
- # sci (5)
- # shadow-cljs (11)
- # xtdb (5)
Clojure advocacy sometimes does work 🎉 https://vimeo.com/862028728#t=167s https://twitter.com/borkdude/status/1706984509202166240/photo/1


That's so cool! Alina is great, she (and the whole team) have been doing fantastic work on GraalVM
We're using is.tagomor.woothee/woothee-java {:mvn/version "1.11.0"}
Hi everyone, I’m considering taking a seminar in algorithms for my undergrad in CS. For this seminar I’d need to read a paper from one of the following conferences (in thread). Does anyone follow one of them and can recommend? I’m interested in functional programming (obviously), logic programming, logic in general, and graphs, but I’m open to other topics.
Recommended Conferences European Symposium on Algorithms (ESA) https://algo2022.eu/esa/ International Colloquium on Automata, Languages and Programming, (ICALP) https://icalp2023.cs.upb.de/ Workshop on Approximation and Online Algorithms (WAOA) https://algo2022.eu/waoa/ ACM-SIAM Symposium on Discrete Algorithms (SODA) https://www.siam.org/conferences/cm/conference/soda22 SIAM Symposium on Simplicity of Algorithm (SOSA) https://www.siam.org/conferences/cm/conference/sosa22 Approximation Algorithms for Combinatorial Optimization Problems (APPROX) https://approxconference.wordpress.com/ Symposium on Mathematical Foundations of Computer Science (MFCS) https://www.ac.tuwien.ac.at/mfcs2022/ International Symposium on Algorithms and Computation (ISAAC) https://isa.hanyang.ac.kr/isaac2022/ Symposium on Theoretical Aspects of Computer Science (STACS) https://www.univ-orleans.fr/lifo/stacs/ Current Trends in Theory and Practice of Computer Science (SOFSEM) https://ics.science.upjs.sk/sofsem2023/ Difficult Conferences Symposium on Foundations of Computer Science (FOCS) https://focs2022.eecs.berkeley.edu/ Symposium on Theory of Computing (STOC) http://acm-stoc.org/stoc2021/accepted-papers.html Additional conferences Computational Complexity Conference (CCC) https://computationalcomplexity.org/ International Joint Conference on Theoretical Computer Science – Frontier of Algorithmic Wisdom (IJTCS-FAW) https://conference.cs.cityu.edu.hk/ijtcs2022/index.html International Symposium on Parameterized and Exact Computation (IPEC, formerly IWPEC)) https://algo2022.eu/ipec/ Symposium on Algorithms and Experiments for Wireless Networks (ALGOSENSORS) https://algo2022.eu/algosensors/ Computing and Combinatorics Conference (COCOON) Latin American Theoretical Informatics (LATIN) Computing and Combinatorics Conference (COCOON) Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
I don't know how much time you want to spend finding the paper that you will read, but I'd recommend looking through titles of papers and their abstracts/introductions to see if it looks like a topic you would be interested in (sometimes titles are made to be cute/fun but do not give much info about the subject).
The tricky part is sometimes figuring out how much background info you will need to know to understand the rest of the paper.
They tend to be written for people who are familiar with one or more of the papers whose work they are building on or improving.
Once you get an initial list of maybe 5 to 10 papers that look like their subject might be interesting to you, I'd try reading the first section of those, and maybe asking your professor if they would be willing to skim over the paper and have them give their feedback of whether they feel confident in helping you understand the paper in case you get stuck on anything.
But I haven't followed any of them recently to give suggestions, other than that my guess is that FOCS and STOC 30 years ago when I was following them are pretty difficult, if you are not already a specialist in the subject matter of the paper.
I’ve tried to look through some of the titles, and I can’t understand many of them, so I’m not sure if they’re connected to FP/LP/etc but in a way I’m not yet familiar with, or completely unrelated. I was hoping someone from the community might follow one of the conferences, which would be an indicator that they are, in fact, related to the topics I’m interested in. (I know I’ll have to study a lot in order to understand any of them, I’m looking forward to it. I just want to make sure the end goal is what I’m aiming for.)
Thanks for the tip about FOCS and STOC - I’ll save them for my grad
I have not heard before about the one called "SIAM Symposium on Simplicity of Algorithm (SOSA)", but it makes me wonder whether they strive for simplicity in the algorithms they describe. Might be helpful, if so 🙂
This sentence from the description of SOSA looks promising: "An ideal submission will advance our understanding of an algorithmic problem by, for example, introducing a simpler algorithm, presenting a simpler analysis of an existing algorithm, or offering insights that generally simplify our understanding of important algorithms or computational problems."
I am developing a deep hatred for the web platform.
I am debugging a very old code that uses the KeyDown event. It uses something like event.path
. For all purposes, if I search the web, seems that this property never existed; but here's the catch: it did, and it's documented, but burried under revisions and revisions. So, I have to open http://w3.org, find the API that this was related to, and click "previous version" until the point I finally get to what this "paths" was supposed to be...
I mean, it's not only for the obvious issue of backwards compatibility, but also for the sake of porting - if I can't even find what an API was supposed to be, how can I keep the code?
It was blink only -- it has since been replaced by composedPath
which is supported in all major browser engines.
https://chromestatus.com/feature/5726124632965120
&
https://developer.mozilla.org/en-US/docs/Web/API/Event/composedPath
Actually, mine was on Chromium - https://www.w3.org/TR/2017/WD-shadow-dom-20170905/#event-path
It appears to be the same as this composePath
thing, but I'm not 100% sure (and anyway, the code I was working was just calling event.path[0]
, it could be replaced to event.target
)
Chromium has blink as an engine — it implemented a predecessor to the now widely supported webcomponent standards.
Nowadays browser vendors are better behaved: feature flagging experimental features just so that people cannot rely on them. So no experimental -webkit
prefixes, or JS APIs without strong consensus.
You can enable them in settings, but yeah, tell that to your users, haha. So people don’t bother!