This page is not created by, affiliated with, or supported by Slack Technologies, Inc.
- # beginners (35)
- # boot (5)
- # cider (16)
- # cljs-dev (22)
- # cljsrn (11)
- # clojars (1)
- # clojure (205)
- # clojure-uk (19)
- # clojurescript (76)
- # cursive (22)
- # duct (4)
- # editors (1)
- # emacs (4)
- # fulcro (1)
- # hoplon (3)
- # leiningen (5)
- # off-topic (25)
- # onyx (29)
- # other-languages (5)
- # parinfer (1)
- # re-frame (13)
- # reagent (8)
- # reitit (2)
- # shadow-cljs (3)
- # tools-deps (11)
- # vim (6)
Those two are mutually exclusive. What happens when you say a function takes a int, but then redef it to take a string?
Say we redefine function FOO. FOO has a dependency list of "all functions that transitively depend on FOO." ALl functions on that list are re-type checked when FOO is redefined. Which should cause a type error to be thrown.
My personal 2c on the topic of earphones... If your ears are "compatible" with triple-flanged eartips and you're comfortable with sticking something near the 2nd bend of your ear canal then etymotic has the best earphones for noise isolation and sound quality. I use them during my commute everyday
Pretty sure I've seen someone do a talk on OCaml hot-reloading and repl development long time ago....
https://m.thomann.de/nl/etymotic_hf5_black.htm seems like it, they look a lot like professional earplugs.
@borkdude I'm using the hf5's right now and I actually prefer them over noise-cancelling headphones because it's got better attenuation for high frequency ranges but less low frequency attenuation, you'll still hear engine hum on the back row of a bus
My guess is that active noise cancellation is hard for high frequencies due to processing latency....
I'm trying to build up to finite state automata/transducers from combining a number of arbitrary regex.
@dominicm: Introduction to Automata Theory, Languages, and Computation / hopcroft / motwani / ullman is the standard reference
> To make best use of this book, students should have taken previously a course covering discrete mathematics, e.g., graphs, trees, logic, and proof techniques. I fear my lack of CS degree is going to start showing
it's covering the proof techniques anyway it seems, although I expect it will get harder
https://lagunita.stanford.edu/courses/course-v1:ComputerScience+Automata+SelfPaced/about <-- never tried this myself, but may be of interest, it's by Ullman, one of the authors of the book.
It gets a lot of heat, but "A New Kind of Science" also sheds automata in an interesting kind of light