Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 8 years ago.
Improve this question
The hygiene of Scheme macros as of R5RS was not fully understood (no clear definition of what it meant to be hygienic and whether those properties actually applied to Scheme macros Oleg Kiselyov, Dirty Macros, 2002)
Has R6RS improved the situation since then?
Related
Closed. This question is opinion-based. It is not currently accepting answers.
Want to improve this question? Update the question so it can be answered with facts and citations by editing this post.
Closed 2 days ago.
Improve this question
I happen to know purego from a mailing list. It claims to use C code without CGo, which is very interesting. I would like to know if we can get rid of C entirely in Go, why the Go team does not adopt this way? In another word,
what things can CGo do while purgo can't? What's the pros and cons of purego?
I am purly interested in comparing purgo with cgo, and see if this project is worth tracking, and further more could it be adopted into future version of Go?
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 7 days ago.
Improve this question
As i know, pure functions return the value that you insert in. However, log do also the same thing as for example finding sin(x). Why log is considered impure
Read haha some articles
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 9 years ago.
Improve this question
I am curious about how tabling works to improve efficiency of Prolog programs. How is it implemented? Both explanation and references are welcome.
Closed. This question needs details or clarity. It is not currently accepting answers.
Want to improve this question? Add details and clarify the problem by editing this post.
Closed 8 years ago.
Improve this question
I have two NFA's.
I need to determine whether both recognize the same language
I would be much obliged if anyone could be so kind enough to explain how to do this.
You can get a canonical representation of an NFA by computing its equivalent minimal DFA.
If two NFA's have the same canonical representation, they accept the same language.
Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 6 years ago.
Improve this question
Python lists are implemented by CPython as amortized arrays. How are are Ruby arrays implemented, and for which implementations?
EDIT:
Partial answer here.