mafribe

84 ms·

751.
by mafribe 11y ago
The Frege page says that Frege features Higher rank types but says nothing about higher-kinded types (HKTs). The two are different. The rank of a type describes the depth at which universal quantifiers appear contravariantly. This
752.
by mafribe 11y ago
Well what does 'goto' do when you are jumping non-locally? If you don't save the calling environment, you are trashing the call-stack leading to undefined behaviour. So this is not really even goto, it's a desaster ... T
753.
by mafribe 11y ago
monads is that they're way too low level t Monads are neither low- nor high-level. Monads are orthogonal to this. A monad (in the context of programming languages) is a generalised from of function composition. Instead of comp
754.
by mafribe 11y ago
I agree, the concept of monads is very simple, actually trivial. It's just a generalised form of function composition. But thinking monadically and abstracting monadically is extremely different from what programmers normally learn,
755.
by mafribe 11y ago
There is nothing wrong with using Scala as a better Java. Indeed that's what I recommend to Scala beginners with a background in OO. That's the beauty of multi-paradigm languages: pick and choose the language subset that works for
756.
by mafribe 11y ago
I never got the hang of 99% of explanations of call/cc. Very simple explanation: continuations are goto/jumping. Simple explanation: continuations are goto/jumping where a value is passed from the place of jumping t
757.
by mafribe 11y ago
How does your approach for factoring out compiler components compares with the PyPy meta-tracing approach?
758.
by mafribe 11y ago
If you use Hoare triples for total correctness, you can't reason about non-terminating programs. I recommend to use a Hoare logic for "generalised" correctness that enables you to reason about both, terminating and nontermina
759.
by mafribe 11y ago
Thank you for the reply! How are Hoare logic and predicate logic integrated? Hoare logic can be seen as a form of second-order predicate logic. What kind of Hoare logic, total correctness, partial correctness or both? There are two main app
760.
by mafribe 11y ago
And in practise, most of the "students, musicians and architects-working-at-cafe-and-having-too-much-free-time" will turn into the "doctors & architects-with-jobs-and-kids", so it's really the ageing process tha
761.
by mafribe 11y ago
This appears to be a language in the Eiffel tradition, but with a much more expressive logic that enables full correctness proofs. What I couldn't work out from a brief scan of the documentation is what logic is being used, and if the
762.
by mafribe 11y ago
given that one uses specifically a bytecode interpreter and not a JIT is generally the sign that the interpreter is to be used on multiple platforms. Well, you could JIT the bytecode. Or you could use a meta-tracer (see e.g. [1]).
763.
by mafribe 11y ago
I agree that FP isn't more mathematical than other forms of programming. the operational semantics of functional languages are much more well-defined. No. The operational semantics of any language that has a compiler or inter
764.
by mafribe 11y ago
It's worth pointing out that the idea to have automata make music predates Lovelace. Music making automata were a staple of the renaissance. For example the mathematician and astronomer Johannes Kepler, when visiting the "Kunstkam
765.
by mafribe 11y ago
The Nazi partly benefited from the fear in Germany during the 30s to get into power. A lot of pro-Nazi throughout Europe were in fact anti communist. An entirely justified fear, we must never forget, as inconvenient as this may be!
766.
by mafribe 11y ago
Stalin was the General Secretary of the Communist Party of the Soviet Union's from 1922 until his death in 1953. In the years following Lenin's death in 1924, he became leader of the Soviet Union and the ComIntern. One cannot hav
767.
by mafribe 11y ago
One example: Ruby (the original interpreter in C). OK, I should have said, and have now modified my original statement to "Interpreters don't necessarily do GC". In general an interpreter can add any additional
768.
by mafribe 11y ago
GCing has nothing to do with a language being functional. All you need is access to the roots and the ability always to determine which data is another pointer. The main 'enemy' of this is the ability to cast integers to pointers
769.
by mafribe 11y ago
Most of the precise GCs I know of are in JIT'd or interpreted languages GC is orthogonal to JITing. OCaml and Haskell are two examples of languages with non-JIT AOT compilers (ocamlopt and ghc, respectively) that do precise GC
770.
by mafribe 11y ago
I don't see any particular contributions to logic in the Tractatus.
771.
by mafribe 11y ago
[3] works on my browser. Anyway, the link was to the publisher's page for the book. Here is another one: http://www.amazon.co.uk/Set-Theory-Universal-Exploring-Unive... .
772.
by mafribe 11y ago
Having a universal set is a sufficient condition for Russel's paradox. That's not true. There are set-theories, e.g. Quine's NF [1] which allow universal sets, and other things like the set of all ordinals, that are
773.
by mafribe 11y ago
Shame [Wittgenstein] doesn't get more recognition for his great work in logic. Which great work in logic did W. produce? He is known for some inchoate criticisms, e.g. he doesn't like Cantor's diagonal proof, but non
774.
by mafribe 11y ago
I agree, but it would be much easier to sell giving up on the Spratly Islands to the Chinese population than accepting Taiwan as a sovereign state. Indeed I would not be too surprised if China did the former. The ability to do so gives Chi
775.
by mafribe 11y ago
I wonder to what extend the real issue is Taiwan. After all China has a (often strongly expressed) territorial claim to Taiwan (and vice versa, but that is not as well-known). If China were to cede alleged land-rights w.r.t. to these island
776.
by mafribe 11y ago
Did Dubai do it in waters that are claimed by other countries?
777.
by mafribe 11y ago
While there are some professional pilots on airliners.net, that forum is also frequented by many ... how can I put this politely ... armchair pilots. Best to take the discussion with a grain of salt. In general, airline parts come with ser
778.
by mafribe 11y ago
I don't know the innards of the Haskell compiler well enough, but, as chrisseaton writes above, tracing Haskell could lead to speedups better than Dynamo. For example data for generic functions in hot code could be unboxed, maybe lazi
779.
by mafribe 11y ago
I said, or was trying to say that DPE and tracing have bad warmup. Tracing JITs like LuaJIT and PyPY as fast to warm up compared to method JITs and PEs. I have heard the opposite about PyPy, which is meta-tracing. I'm a bit un
780.
by mafribe 11y ago
Yes, Dynamo traces machine code. What language to trace is orthogonal to the idea of tracing. Any language can be traced.

More ›