User:Trap D: Difference between revisions
Content added Content deleted
(Not a non-profit.) |
(Code isn't the same so should be ok.) |
||
(4 intermediate revisions by 3 users not shown) | |||
Line 2: | Line 2: | ||
: I think that that excerpt would qualify for fair use, at least in the U.S.A. (This site is educational, and non-profit, the quoted material is but a small part of the entire work, and the idea that this quote would devalue the book seems absurd). --[[User:Rdm|Rdm]] 11:32, 11 April 2011 (UTC) |
: I think that that excerpt would qualify for fair use, at least in the U.S.A. (This site is educational, and non-profit, the quoted material is but a small part of the entire work, and the idea that this quote would devalue the book seems absurd). --[[User:Rdm|Rdm]] 11:32, 11 April 2011 (UTC) |
||
:: The site is ''[[Rosetta_Code:Finances#Definition|not]]'' non-profit. That'd cost too much to set up and maintain. --[[User:Short Circuit|Michael Mol]] 14:01, 11 April 2011 (UTC) |
:: The site is ''[[Rosetta_Code:Finances#Definition|not]]'' non-profit. That'd cost too much to set up and maintain. --[[User:Short Circuit|Michael Mol]] 14:01, 11 April 2011 (UTC) |
||
::: That is ironic, but I still think we should be ok on the legal front. When I look at the reference page, the amount of overlap with the prolog y-combinator is vanishingly small, and this site is not going to be doing any harm to the publishers of that book. Unless I am missing something big, it would be difficult to support an assertion that the publishers of that book can have any rights to something so small and algorithmic in character. --[[User:Rdm|Rdm]] 14:52, 11 April 2011 (UTC) |
|||
:::: If I get a C&D, I'll take it down. I'd prefer a clean-room solution, of course. --[[User:Short Circuit|Michael Mol]] 14:55, 11 April 2011 (UTC) |
|||
How about we remove the code until we have permission. That way we are covered, and I like that much better than keeping it until someone gets a take-down notice! --[[User:Paddy3118|Paddy3118]] 15:54, 11 April 2011 (UTC) |
|||
:Permission for what, exactly? Seriously, when I look at that prolog code, and I look at the reference (which itself was a compare and contrast page), I am having a hard time seeing what this takedown is about. --[[User:Rdm|Rdm]] 16:49, 11 April 2011 (UTC) |
|||
Hi guys. Trap D - I read your note on my talk page, and I have no objections in you posting the code if you think your code is sufficiently different. I just: |
|||
# Noted you made reference to the book and thought the code was ''from'' the the book rather than based on it. |
|||
# Looked at the license on one of their code pages and noted that their license didn't look compatable to RC. |
|||
# I did search for 'combinator' on the books page - which was used in your code, and did not find it. I then ignored that as I thought maybe a variable name had been changed. |
|||
If you have trouble copying your code from the older version [http://rosettacode.org/mw/index.php?title=Y_combinator&oldid=104614#Prolog here] then I could do it for you? --[[User:Paddy3118|Paddy3118]] 19:54, 11 April 2011 (UTC) |
Latest revision as of 19:54, 11 April 2011
Hi TrapD, it's not clear if you had permission for the use of the Prolog Y combinator code? --Paddy3118 09:43, 11 April 2011 (UTC)
- I think that that excerpt would qualify for fair use, at least in the U.S.A. (This site is educational, and non-profit, the quoted material is but a small part of the entire work, and the idea that this quote would devalue the book seems absurd). --Rdm 11:32, 11 April 2011 (UTC)
- The site is not non-profit. That'd cost too much to set up and maintain. --Michael Mol 14:01, 11 April 2011 (UTC)
- That is ironic, but I still think we should be ok on the legal front. When I look at the reference page, the amount of overlap with the prolog y-combinator is vanishingly small, and this site is not going to be doing any harm to the publishers of that book. Unless I am missing something big, it would be difficult to support an assertion that the publishers of that book can have any rights to something so small and algorithmic in character. --Rdm 14:52, 11 April 2011 (UTC)
- If I get a C&D, I'll take it down. I'd prefer a clean-room solution, of course. --Michael Mol 14:55, 11 April 2011 (UTC)
- That is ironic, but I still think we should be ok on the legal front. When I look at the reference page, the amount of overlap with the prolog y-combinator is vanishingly small, and this site is not going to be doing any harm to the publishers of that book. Unless I am missing something big, it would be difficult to support an assertion that the publishers of that book can have any rights to something so small and algorithmic in character. --Rdm 14:52, 11 April 2011 (UTC)
- The site is not non-profit. That'd cost too much to set up and maintain. --Michael Mol 14:01, 11 April 2011 (UTC)
How about we remove the code until we have permission. That way we are covered, and I like that much better than keeping it until someone gets a take-down notice! --Paddy3118 15:54, 11 April 2011 (UTC)
- Permission for what, exactly? Seriously, when I look at that prolog code, and I look at the reference (which itself was a compare and contrast page), I am having a hard time seeing what this takedown is about. --Rdm 16:49, 11 April 2011 (UTC)
Hi guys. Trap D - I read your note on my talk page, and I have no objections in you posting the code if you think your code is sufficiently different. I just:
- Noted you made reference to the book and thought the code was from the the book rather than based on it.
- Looked at the license on one of their code pages and noted that their license didn't look compatable to RC.
- I did search for 'combinator' on the books page - which was used in your code, and did not find it. I then ignored that as I thought maybe a variable name had been changed.
If you have trouble copying your code from the older version here then I could do it for you? --Paddy3118 19:54, 11 April 2011 (UTC)