LispForum

Hey friends I am a beginner. I enjoyed learning C , C++ , Java. I struggled a bit with Scheme & Lisp. However , I admit Prolog was the most hard language for me. Now I want to try my hand at Haskell (Erlang maybe later if its useful nowadays or it teaches me some useful skills related to program...

Hey friends , can I ask Prolog doubts over here?
I want to learn it in 2-3 days maximum.

So that I have basic knowledge of it.

So I heard best way is by asking doubts and discussing with other people

Thanks so much!!! Only one issue , if I change it to equals ? its working great. But if I get it a list such as '((a b c) (1) ( x y z)) , I only get '((a 1 x)) where I should be getting '((a 1 x) (b () y) (c () z)). So if it doesn't have a mapping , it should put (). I really want learn scheme progr...

Finally a rather complex expression but what my-map is supposed to do . I guess my-list might do as below : > (my-map car '((d c) (6 7) (l p))) '(d 6 l) > (my-map car (my-map cdr '((d c) (6 7) (l p)))) '(c 7 p) (my-list (my-map car '((d c) (6 7) (l p))) (my-map car (my-map cdr '((d c) (6 7) (l p))))...

Say if I give my-map a list '((d c f g) (4 5) (l m n)) then output is '((d 4 l) (c 5 m) (f () n) (g () ())). Basically if I give it a list such as '((d c) (6 7) (l p)) I should get output as '((d 6 l) (c 7 p)) which isn't happening. In fact i debugged a lot in vain & realized this. I tested memb...

Well I am trying to debug single map, which I feel is vital to understand my-map function I tried my-member too but get lots of errors when trying to trace it. Also, it needs some examples where some input is traced stepwise as it happens in actual recursion. It would be the most helpful for many sc...

I came across this solution but cannot understand it at all ... If only someone could explain me step wise ............... ; helper procedure for filling a list with arbitrary values at the end (define (fill lst val num) (append lst (build-list num (const val)))) ; helper procedure for transposing a...

So far I tried but find it really hard ... I understood car and cdr ... So as per my concept , I guess this can be a valid example... input list is say '((s t) (5 6) (o j)) given to my f(tuples) then I should get a new list '((s 5 o) (t 6 j)) like this apply same logic for k lists containing k eleme...

Well it isn't exactly a homework... But since I started learning scheme , I am finding it very tough to solve the problem which is a below; I tried for 7 days , but I am unable to decide how I would tackle this scheme problem. (f ’((y g r) (5 3 1) (p q e ))) should give output ’((y 5 p) (g 3 q) ...