Phil

Age: 26

11h
asked `indicator-cpufreq` doesn't seem to work on 14.10
Oct
5
awarded Famous Question
Sep
12
revised Why does ternary operator fail with a type mismatch error?
edit tags
Aug
21
comment Can regexp be used to check for palindromes?
Just to add, Perl's regular expression is more powerful than what is usually understood as such. So the answer is no, you can't check for palindromes with regular expressions.
Aug
20
awarded Yearling
Aug
3
answered Tail-recursive Pascal triangle in Scheme
Aug
3
revised Tail-recursive Pascal triangle in Scheme
add link for Racket
Aug
2
comment Tail-recursive Pascal triangle in Scheme
Your closing parentheses irritate people. Please gather them all in one line so that somebody starts responding ;)
Jul
31
comment What is meant by "OOP hides the state"?
Btw, if you're interested, check out Racket, which is somewhat close to the approach you're saying in your 4th paragraph (enabling programmers to bring the language to the level of their problem instead of making them bring their problem down to the language's fixed set of constructs). It goes way beyond classic Lisp/Scheme, just in case anyone has that impression when first looking at it.
Jul
31
comment What is meant by "OOP hides the state"?
Nah. You were talking about words. I was talking about ideas. Your 2nd and 3rd usage of the word power mean different things. Please don't mislead.
Jul
30
awarded Yearling
Jul
30
comment What is meant by "OOP hides the state"?
"If it's truly powerful it can simulate assembly language" - you swap the definition of powerful right there. When others say powerful, they talk about how well it allows programmers to abstract, which is a different story than computational power.
Jul
25
comment Does this kind of programming language exist?
@leftaroundabout H-M certainly allows for an expressive language. However, "conceivably possible" is an over-statement. There are idioms in dynamic languages that are not easily expressed in static languages (for example, variable-arity, or the use of ad-hoc unions and run-time tests of data's shape to steer control flow.) In static languages, we gain conservative guarantees and accept inabiliy to prove some correct programs. In dynamic languages, we accept some run-time costs to be able to allow all good programs to run.
Jul
19
revised On improving Haskell's performance compared to C in fibonacci micro-benchmark
fix fib's type signature
Jul
15
comment Does this kind of programming language exist?
Minimizing dynamic dispatch for a dynamic language would be a static analysis problem, which is independent of language design, imo.
Jul
9
awarded Notable Question
Jul
2
awarded Curious
Jun
28
reviewed Approve suggested edit on Detecting TCP Client Disconnect
Jun
28
reviewed Approve suggested edit on How can I get the error message for the mail() function?
Jun
28
reviewed Approve suggested edit on How i can get value of specific cell if row is checked?
1 2 3 4 5