* Send/link your favorite guile script
@ 2018-12-10 19:13 swedebugia
2018-12-11 14:37 ` Panicz Maciej Godek
0 siblings, 1 reply; 2+ messages in thread
From: swedebugia @ 2018-12-10 19:13 UTC (permalink / raw)
To: Guile User
Dear guilers
RMS once said "to become a programmer you should read lots of code and
write lots of code".
To make this easier I thought out the following:
I would like to receive a link/attached guile script that you are proud
of.
I was thinking of 3 categories:
* below 100 lines
* between 101-299 lines
* longer scripts
If you want to you can send multiple!
Please include a line why you think just this script is
outstanding/nice/choosen.
--
Cheers
Swedebugia
^ permalink raw reply [flat|nested] 2+ messages in thread
* Re: Send/link your favorite guile script
2018-12-10 19:13 Send/link your favorite guile script swedebugia
@ 2018-12-11 14:37 ` Panicz Maciej Godek
0 siblings, 0 replies; 2+ messages in thread
From: Panicz Maciej Godek @ 2018-12-11 14:37 UTC (permalink / raw)
To: swedebugia; +Cc: guile-user
Hi!
pon., 10 gru 2018 o 20:13 <swedebugia@riseup.net> napisał(a):
> Dear guilers
>
> RMS once said "to become a programmer you should read lots of code and
> write lots of code".
>
> To make this easier I thought out the following:
>
> I would like to receive a link/attached guile script that you are proud
> of.
>
> I was thinking of 3 categories:
> * below 100 lines
> * between 101-299 lines
> * longer scripts
>
> If you want to you can send multiple!
>
> Please include a line why you think just this script is
> outstanding/nice/choosen.
>
Here's my implementation of Held-Karp-Bellman dynamic programming approach
to Travelling Salesman Problem:
https://www.quora.com/How-do-I-solve-a-problem-using-dynamic-programming-approach-and-which-function-should-I-use-recursively-using-loops/answer/Panicz-Godek
note that it also contains an implementation of "define/memoized" form,
that has also been used in the definition of Levinshtein distance that I
added to "Algorithm Implementations" Wikibook:
https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance#Scheme
Here's my implementation of the A* search algorithm (compared with the one
from Peter Norvig's book "Paradigms of Artificial Intelligence
Programming"):
https://www.quora.com/What-are-the-pros-and-cons-of-functional-programming-compared-to-imperative-programming/answer/Panicz-Godek
Here's a simple "expression compiler":
https://www.quora.com/What-lasting-effects-did-learning-LISP-have-on-you/answer/Panicz-Godek
All these examples use the (grand scheme) glossary that I maintain, which -
among other things - integrates the Scheme syntax with the (ice-9 match)
module closely:
https://github.com/plande/grand-scheme
If you like to read code, you can also try reading a lousy booklet that I
once wrote, titled "A Pamphlpet against R":
https://github.com/panicz/pamphlet/
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2018-12-11 14:37 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2018-12-10 19:13 Send/link your favorite guile script swedebugia
2018-12-11 14:37 ` Panicz Maciej Godek
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).