00:00:39 -!- a1len [n=James@unaffiliated/a1len] has quit [Nick collision from services.] 00:01:09 -!- a1len_ is now known as a1len 00:02:34 mmorrow [n=link@c-98-193-60-208.hsd1.il.comcast.net] has joined #scheme 00:03:30 -!- jonrafkind [n=jon@wireless250.wireless.utah.edu] has quit [Read error: 60 (Operation timed out)] 00:05:43 hiyuh [n=hiyuh@ZQ062141.ppp.dion.ne.jp] has joined #scheme 00:06:26 raikov [n=igr@203.181.243.11] has joined #scheme 00:07:54 rudybot: eval '(1,4,+) 00:07:55 offby1: ; Value: (1 (unquote 4) (unquote +)) 00:07:57 bcow: because (car '(1,4,+)) is 1. but try cdr... you mean to say '(1 4 +) 00:08:09 *offby1* glares at sladegen 00:08:20 _I'm_ using my brain now. You need to get your own. 00:08:32 *sladegen* takes an anti-denture posture. 00:08:47 damned kids 00:09:50 rudybot: eval (atan -2i) 00:09:51 mejja: ; Value: -1.5707963267948966-0.5493061443340549i 00:10:05 rudybot: eval (atan +2i) 00:10:05 mejja: ; Value: -1.5707963267948966+0.5493061443340549i 00:11:33 bcow: and you probably want to use post recursively in the number? branch, too... btw where do you get op from? 00:11:49 AtnNn [n=welcome@modemcable230.56-56-74.mc.videotron.ca] has joined #scheme 00:13:37 CaptainMorgan [n=CaptainM@c-75-68-42-94.hsd1.nh.comcast.net] has joined #scheme 00:13:59 tizoc_ [n=user@r190-135-48-29.dialup.adsl.anteldata.net.uy] has joined #scheme 00:17:19 sladegen i dunno i was conna ask where op came from too, rmrfchik made up that demo for me 00:18:17 Riastradh: ping 00:21:51 mejja pasted "Riastradh: C backend lossage?" at http://paste.lisp.org/display/70170 00:25:16 bcow: uhm, my guess would be that it was other procedure that computed value of an operation on the stack of arguments... 00:26:05 sladegen any idea what that function would look like 00:27:28 is this how this would be written in (idiomatic) scheme: 00:27:35 rudybot: eval ((lambda (x) (list x (list 'quote x))) '(lambda (x) (list x (list 'quote x)))) 00:27:35 mmorrow: ; Value: ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) 00:27:38 ? 00:27:51 hmm 00:28:01 rudybot: eval ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) 00:28:01 mmorrow: ; Value: ((lambda (x) (list x (list (quote quote) x))) (quote (lambda (x) (list x (list (quote quote) x))))) 00:28:04 ah ok 00:28:53 or, rephrasing, does that say the exact same thing in both lisp /and/ scheme? 00:29:06 *mmorrow* knows neither well 00:30:16 i think that it does 00:32:44 -!- iion_tichy [n=Bjoern@e179071182.adsl.alicedsl.de] has left #scheme 00:33:01 bcow: well if i tell you straight out i will have to kill you afterwords. do you have any inkling. it probably depends on what you have read or been told up to now about scheme. 00:33:13 -!- tizoc [n=user@r190-135-49-210.dialup.adsl.anteldata.net.uy] has quit [Read error: 110 (Connection timed out)] 00:38:25 well in an imparative language i'd usually just beable to find a function like eval(expr) where expr is like "1+4" but i'm guessing nothing like that exists in scheme and i'm a little lost as to implement one, i'm guessing something like (define operation(op x y) ((case (op = '+ then x + y)) or something along those lines ? 00:40:03 > (eval '(+ 1 4)) 00:40:03 5 00:40:56 oh damn it does :X 00:41:06 thx pjdelport 00:41:54 -!- attila_lendvai [n=ati@catv-89-133-170-239.catv.broadband.hu] has quit [Read error: 60 (Operation timed out)] 00:41:55 bcow: it's very easy to do this kind of thing in Lisp/Scheme, with s-expressions as a core type 00:41:57 Warning: if you use EVAL on a regular basis, your instructor has an obligation to whack you repeatedly across the knuckles with a wooden ruler. 00:42:06 It's in the spec. 00:42:41 -!- fschwidom [n=fschwido@dslb-088-068-117-055.pools.arcor-ip.net] has quit [Connection timed out] 00:42:45 hehe 00:42:59 remember, kids, there's just one vowel of difference between EVAL and EVIL 00:43:26 Ah, but EVAL is just one letter-swap away from VEAL, too. 00:44:00 LEAV, NOW! 00:44:05 just goes to show that not all evil is bad 00:44:16 or how is it again 00:44:31 *pjdelport* ties himself up in his own metaphor 00:45:00 *pjdelport* LAVEs his hands in innocence 00:45:15 ALE V - when the first four just weren't enough 00:46:08 annodomini [n=lambda@64.30.3.122] has joined #scheme 00:48:51 *offby1* knows of only II Chimays ... what is Daemmerung hiding?! 00:48:56 s/II/III/ 00:49:46 gweiqi [n=greg@69.120.126.163] has joined #scheme 00:49:48 -!- annodomini [n=lambda@wikipedia/lambda] has quit [Client Quit] 00:50:41 though i walk through the VALE of the shadow of interpretation, i shall fear no EVAL 00:51:26 Thy car and thy cdr, they comfort me 00:51:36 for thou R5RS with me 00:51:39 -!- kniu [n=kniu@DA-YU.RES.CMU.EDU] has quit ["Leaving"] 00:51:45 pjdelport, nicely put. 01:03:02 -!- mejja [n=user@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has quit [Remote closed the connection] 01:13:11 -!- tizoc_ is now known as tizoc 01:20:32 -!- Mr_SpOOn [n=Mr_SpOOn@89-97-102-218.ip17.fastwebnet.it] has quit [Remote closed the connection] 01:27:27 npe [n=npe@66.112.249.148] has joined #scheme 01:28:57 fschwidom [n=fschwido@dslb-084-059-136-162.pools.arcor-ip.net] has joined #scheme 01:32:56 Slereah_ [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has joined #scheme 01:33:58 -!- fschwidom [n=fschwido@dslb-084-059-136-162.pools.arcor-ip.net] has quit [Remote closed the connection] 01:37:43 AtomicToad [i=JohnnyL@ool-182ddad4.dyn.optonline.net] has joined #scheme 01:37:44 -!- melito [n=melito@70.99.250.82] has quit ["Leaving..."] 01:39:55 rudybot: eval (define mutual (lambda (f g a) (f a (lambda (b) (mutual g f b))))) 01:40:16 rudybot: eval (mutual (lambda (n k) (k (* n 2))) (lambda (n k) (if (< n 1000) (k (- n 1)) n)) 2) 01:40:16 mmorrow: ; Value: 1026 01:40:27 -!- JohnnyL [i=JohnnyL@ool-182ddad4.dyn.optonline.net] has quit [Read error: 60 (Operation timed out)] 01:42:58 is the source to rudybot available anywhere? 01:43:02 rudybot: help 01:50:14 if i have '((2+2) * 6) as an input how do i return the first token "(" ? 01:50:42 -!- Slereah [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has quit [Read error: 113 (No route to host)] 01:57:06 -!- underspecified [n=eric@softbank220043052011.bbtec.net] has quit [] 01:59:00 mejja [n=user@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has joined #scheme 02:01:51 rudybot: eval (string-ref "'((2+2) * 6)" 1) 02:01:52 Daemmerung: ; Value: #\( 02:02:03 (Hint: that is not the correct answer.) 02:02:47 thx 02:02:58 incubot: (string-ref "'((2+2) * 6)" 1) 02:02:58 ( 02:03:09 hmm; what is, then? 02:03:30 klutometis: he's looking for lexemes a bit too late, methinks 02:03:35 aha 02:04:28 -!- cky [n=cky@203-211-93-140.ue.woosh.co.nz] has quit [No route to host] 02:05:12 JohnnyL [i=JohnnyL@ool-182ddad4.dyn.optonline.net] has joined #scheme 02:05:14 rudybot: eval (car '((2+2) * 6) ) 02:05:14 Daemmerung: ; Value: (2+2) 02:05:24 cky [n=cky@203-211-111-251.ue.woosh.co.nz] has joined #scheme 02:06:21 -!- AtomicToad [i=JohnnyL@ool-182ddad4.dyn.optonline.net] has quit [Read error: 60 (Operation timed out)] 02:10:29 jonrafkind [n=jon@c-98-202-86-149.hsd1.ut.comcast.net] has joined #scheme 02:11:03 vorpal [n=rhunter@pdpc/supporter/student/vorpal] has joined #scheme 02:25:11 AtomicToad [n=atomicto@ool-182ddad4.dyn.optonline.net] has joined #scheme 02:26:23 tizoc_ [n=tizoc_@r190-135-48-29.dialup.adsl.anteldata.net.uy] has joined #scheme 02:26:58 -!- tizoc_ [n=tizoc_@r190-135-48-29.dialup.adsl.anteldata.net.uy] has left #scheme 02:29:55 -!- JohnnyL [i=JohnnyL@ool-182ddad4.dyn.optonline.net] has quit [Read error: 60 (Operation timed out)] 02:43:27 cky_ [n=cky@203-211-87-20.ue.woosh.co.nz] has joined #scheme 02:45:58 underspecified [n=eric@clair16.naist.jp] has joined #scheme 03:01:23 -!- cky [n=cky@203-211-111-251.ue.woosh.co.nz] has quit [Connection timed out] 03:01:24 -!- mejja [n=user@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has quit [Remote closed the connection] 03:09:46 Yikes. 03:11:34 annodomini [n=lambda@c-75-69-96-104.hsd1.nh.comcast.net] has joined #scheme 03:13:30 annodomini_ [n=lambda@c-75-69-96-104.hsd1.nh.comcast.net] has joined #scheme 03:14:25 saccade_ [n=saccade@65.78.24.47] has joined #scheme 03:16:42 minion: memo for mejja: (ATAN +2i) should yield the right result if you rebuild the microcode, which was decoding the components of recnums in reverse order. 03:16:42 Remembered. I'll tell mejja when he/she/it next speaks. 03:19:00 pitui [n=pitui@c-76-98-192-104.hsd1.nj.comcast.net] has joined #scheme 03:20:11 -!- AtomicToad [n=atomicto@ool-182ddad4.dyn.optonline.net] has quit [Read error: 145 (Connection timed out)] 03:21:37 -!- forcer [n=forcer@85.179.198.52] has quit [Read error: 110 (Connection timed out)] 03:23:46 -!- saccade_ [n=saccade@65.78.24.47] has quit [Read error: 60 (Operation timed out)] 03:26:00 saccade_ [n=saccade@65.78.24.47] has joined #scheme 03:26:05 -!- cky_ is now known as cky 03:26:47 -!- annodomini_ [n=lambda@wikipedia/lambda] has quit [Read error: 104 (Connection reset by peer)] 03:28:10 -!- mmorrow [n=link@c-98-193-60-208.hsd1.il.comcast.net] has left #scheme 03:29:42 daedra [n=simon@unaffiliated/daedra] has joined #scheme 03:30:35 (define (a-plus-abs-b a b)((if (> b 0) + -) a b)) 03:30:39 -!- annodomini [n=lambda@wikipedia/lambda] has quit [Read error: 110 (Connection timed out)] 03:30:52 where abs stands for absolute value of 03:31:21 -!- vorpal [n=rhunter@pdpc/supporter/student/vorpal] has quit ["The incensed priests...continued to raise their voices, vituperating each other in bad Latin"] 03:31:28 what is the + - doing in this compound expression? 03:31:51 is it add the negation of something? 03:31:55 They name procedures. 03:32:12 or if b > 0 is true, then add a to b 03:32:17 else a - b 03:32:25 + is the name by which we refer to the procedure that adds numbers. - is the name by which we refer to the procedure that subtracts them. 03:32:37 This expression calls the + procedure if b is positive, or the - procedure if not. 03:32:52 oooh ok 03:33:00 That is, whatever is the value of (IF (> B 0) + -), the whole expression ((IF (> B 0) + -) A B) applies as a procedure to the arguments A and B. 03:34:14 so if it was ((if (> b 0) - +) it would call - if b is positive, + otherwise 03:34:25 Precisely. 03:37:01 thank you 03:37:06 -!- daedra [n=simon@unaffiliated/daedra] has quit ["leaving"] 03:42:50 -!- saccade_ [n=saccade@65.78.24.47] has quit [Read error: 60 (Operation timed out)] 03:43:31 vorpal [n=rhunter@pdpc/supporter/student/vorpal] has joined #scheme 03:44:07 saccade_ [n=saccade@65.78.24.47] has joined #scheme 03:44:36 -!- kilimanjaro is now known as Zygmund 03:45:24 -!- Zygmund is now known as kilimanjaro 03:50:48 bobbi [n=nathan@S010600a0cc61ea28.lb.shawcable.net] has joined #scheme 03:51:56 is there a simple way, given a list, to convert from say a to 0 and b to 1 c to 2, or any letter to any other specified number? I'm trying to come up with a function that will, give two operators, tell which has higher precedence. 03:52:28 (case ((a) 0) ((b) 1) ((c) 2) ...) ;? 03:52:40 (case ((a) 0) ...), that is. 03:54:11 bobbi: operator precedence is not really an issue in prefix or postfix notation ... so you are parsing something infix? 03:55:55 yes. im attempting to convert from infix to postfix, then calculate the postfix equation. so far i have the calculation of the postfix expression working well 03:56:06 renke_ [n=renke@Lf473.l.pppool.de] has joined #scheme 03:56:11 and the infix to postfix is mostly working except for operator precedence 03:59:14 is there a simple way to create a function that will return whether operator 1 has higher precedence than operator2? 03:59:35 You can map them into integers and then compare the integers. 04:00:04 That is what I was thinking of doing. I'm sure not sure how to accomplish it. 04:02:16 rudybot: eval (case '+ ((*) 1) ((/) 1) ((+) 0) ((-) 0) (else #f)) 04:02:17 Riastradh: ; Value: 0 04:02:34 elmex_ [n=elmex@e180064214.adsl.alicedsl.de] has joined #scheme 04:03:45 rudybot: eval (> (case '+ ((*) 1) ((/) 1) ((+) 0) ((-) 0) (else #f)) (case '* ((*) 1) ((/) 1) ((+) 0) ((-) 0) (else #f)) ) 04:03:45 Daemmerung: ; Value: #f 04:04:14 -!- saccade_ [n=saccade@65.78.24.47] has quit ["This computer has gone to sleep"] 04:04:24 wow that is long and unfriendly looking 04:04:38 Now if only there was some way to abstract that somehow. Hint. 04:05:05 I know, Daemmerung: copy & paste! 04:05:13 *Daemmerung* facepalms 04:05:15 That's a bit abstract! 04:05:31 I'm assuming I should not be extremely confused right now 04:05:41 I'm a bit new to scheme, or functional programming in general. 04:06:03 Maybe we could write a web 2.0 service that would let us copy and paste, then reference the pastes by name. Perhaps with some sort of substitution. 04:06:56 bobbi: Break it down into as many tiny procedures as you can. 04:10:48 Alright. I'll fight with this for a while. Thanks for your help 04:10:55 Maybe you could do it with a macro. 04:10:58 Or with a closure. 04:11:27 I wonder if you could put a mac... NAAAAAH 04:11:44 *gnomon* guffaws nerdily 04:12:19 *Daemmerung* is too congested to guffaw effectively 04:12:41 *Slereah_* is too ashamed to also be stuck on something stupid to guffaw. 04:12:55 I'm trying to do some function-composition function. 04:13:10 But so far, no dice. 04:13:32 Oh, thank god. I thought that perhaps you were yet another person in the class with the infix calc assignment. 04:13:41 Nah. 04:13:43 gnomon, how're the pillow-battling chimpanzee/tarantula hordes? 04:13:56 My class has assignments like "Solve this Schroedinger equation" 04:14:05 *Daemmerung* goes shopping 04:14:07 Riastradh, well, there was a 15% company-wide layoff today. 04:14:07 Much simpler. 04:14:41 Slereah_, I'm not guffawing at your problem set; Daemmerung and I are laughing about an infamous exchange here that happened some time ago. 04:14:46 No offense was intended. 04:14:57 None taken. 04:15:00 -!- renke [n=renke@Lfdcc.l.pppool.de] has quit [Read error: 110 (Connection timed out)] 04:15:09 Riastradh, on a positive note, I have thoroughly read over and enjoyed the new foof-loop documentation. 04:15:21 The reference manual section was excellent; the earlier section was good. 04:15:30 also gnomon secretly hates you 04:15:33 I first tried just (define (comp f . args) (apply f args)), but some functions don't like being fed functions. 04:15:35 but don't tell him! 04:15:44 So I tried lambdas... well, pretty much everywhere 04:15:47 But still no. 04:16:11 -!- elmex [n=elmex@e180067100.adsl.alicedsl.de] has quit [Read error: 113 (No route to host)] 04:16:15 -!- elmex_ is now known as elmex 04:16:30 gnomon, hmm, have I made the introduction worse than the reference manual, or was it that bad to begin with? 04:17:40 Slereah_, I don't have the luxury of being able to jump in right now and help you with it, but one of the nicest things about Scheme is that it's almost always a better idea to take something away rather than adding it in. A side effect of this is that it's easier to build up from nothing to a working solution than it is to tack bits onto a mostly-working solution. 04:18:29 Well, the solution isn't mostly working 04:18:35 It is not working at all D: 04:18:55 Riastradh, the introduction isn't bad, it's good. I'm not entirely sure about the intended audience is all. My printout of the reference manual section actually has highlighted paragraphs with "Awesome!" written in. 04:19:02 I'm just trying it on ((comp s s) 1), with s being x + 1. 04:19:11 Slereah_, perhaps you could begin finding a solution to your problem in Scheme by first describing what the problem is -- what is function composition? 04:19:52 Well, it takes a function f and a bunch of functions g, h, ... and turns it into f(g,h,...) 04:20:02 Which is why I did apply f args 04:20:04 gnomon, the intended audience is the set of Scheme programmers who are already familiar with writing loops in Scheme. 04:20:18 But + does not like being fed procedures 04:20:37 Slereah_, focus on the binary case first -- you can extend that to any number afterward by induction. 04:21:05 Hell, I'm focusing on just one case. 04:21:12 I'm trying the (comp s s) thing. 04:21:16 Slereah_, you have two functions f and g. What does it mean to compose them, or what does their composition mean? 04:21:21 I'd be happy if that at least work! 04:21:40 I tried to turn it into lambda x s(s(x)). 04:21:54 But so far, no luck. 04:22:13 Riastradh, in that case I think that the introduction could be tightened up somewhat. There is a great deal of precision in the introduction which is later covered in the reference manual; if the intention of the introduction is to describe the reason for the existence of the tool and to leave the mechanism until the end, some of the precision could be elided in favour of narrative flow. 04:22:37 (for the record, I can't believe that I'm arguing *against* explanatory detail here. It's a very strange feeling) 04:22:42 Slereah_, can you write that in Scheme notation? 04:23:07 gnomon, ah, the introduction is not meant to be solely a justification. The word `tutorial' may be more apt. 04:23:11 (lambda x (s (s x))) ? 04:23:24 Slereah_, now, can you explain in English what that expression means to Scheme? 04:24:17 Riastradh, that's a good point; but in that case I think that perhaps an introduction could be a good addition, and that it could lift some of the burden of that role from the tutorial paragraphs. 04:24:43 A function f that would f(x) = s(s(x))? 04:25:09 Ack, I must go. 04:25:16 bye. 04:25:20 Riastradh, I'll be at liberty to discuss this in more detail tomorrow. 04:25:33 Goodbye, Slereah_! Best of luck with your efforts. 04:25:39 Thanks. 04:25:44 Slereah_, not quite. The lambda expression you wrote yields a procedure that accepts any number of arguments -- not just one! -- and accumulates them into a list, a list which it passes to the procedure S. 04:25:54 (Then what S returns, it passes to S again.) 04:26:10 You probably meant to ask for a procedure that accepts one argument, by writing (LAMBDA (X) ...). 04:26:48 Well, technically, it could ask for any number of arguments. 04:27:10 In that case, you'll need to pass those arguments as separate arguments to S, not as a list in one argument. 04:27:17 To do that you must use APPLY. 04:27:19 r5rs apply 04:27:20 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_idx_556 04:27:21 -rudybot:#scheme- http://tinyurl.com/2kjgxd 04:27:24 'kay 04:27:28 I'll try this good sir 04:28:28 (define (comp f . args) 04:28:29 ((lambda ff (apply f (apply (args ff)))) 04:28:29 )) 04:28:31 Hm. 04:28:34 Still not working. 04:28:53 Well, you applied the procedure obtained by (LAMBDA FF ...) to zero arguments, so that FF will be the empty list. 04:29:00 O wait 04:29:01 Then you tried to apply the list ARGS to the empty list FF as if ARGS were a procedure! 04:29:10 But where are the two functions involved? 04:29:26 Again, it will be simplest if you say how to compose two functions, say f and g, before a list of functions. 04:29:47 So: (define (compose-2 f g) ...) 04:29:54 What should the composition of the two procedures f and g be? 04:29:55 Well, the same way, but with g instead of args and just one lambda variable. 04:30:54 Well, it works for two. 04:30:59 (define (comp f g) (lambda (x) (f (g x)))) 04:31:04 > ((comp s s)1) 04:31:05 3 04:31:07 OK. 04:31:14 -!- pitui [n=pitui@c-76-98-192-104.hsd1.nj.comcast.net] has quit [Read error: 110 (Connection timed out)] 04:32:24 Can you now extend that definition so that the resulting composition accepts any number of arguments, and passes them to G? 04:32:27 Korollary [n=Unknown@c-67-168-27-7.hsd1.wa.comcast.net] has joined #scheme 04:32:39 Lessee. 04:32:59 (define (comp f g) (lambda x (f (apply g x)))) 04:33:01 This work? 04:33:04 What's good for unit testing? srfi/64? (I'm using pltscheme 4) 04:33:07 I didn't try it on some n-ary function 04:33:18 Try it, then, Slereah_! 04:33:33 Say, ((COMPOSE SQRT +) 9 16). 04:34:41 > ((comp s (lambda (x y z) (+ x y z))) 1 1 1) 04:34:42 4 04:34:44 Seems to work. 04:36:00 peter_12 [n=peter_12@S010600119506b129.gv.shawcable.net] has joined #scheme 04:36:33 Well, let's try for n functions now. 04:36:57 And no dice. 04:37:08 (define (comp f . g) (lambda x ((apply f (apply g x))))) 04:37:08 First of all, don't throw our your binary composition procedure! 04:37:12 What is the problem? 04:37:27 Leave it alone; you can use it to compose a list of procedures. 04:37:41 That composition is associative may suggest a way to do this. 04:38:44 Hm. 04:39:34 -!- vorpal [n=rhunter@pdpc/supporter/student/vorpal] has quit ["The incensed priests...continued to raise their voices, vituperating each other in bad Latin"] 04:41:59 Slereah [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has joined #scheme 04:42:56 D: 04:44:45 I'm not sure associativity helps me. 04:44:59 Unless I try some sort of currying. 04:45:18 It is not necessary -- but it may suggest an approach. 04:46:01 Think induction. For example, how might you sum a list of numbers, without using (APPLY + ...)? 04:46:49 (+ (car list) some sort of recursion here), I suppose 04:47:21 Well, let's try some sort of recursion. 04:48:18 Also, if you are so inclined, think group theory, and how both {integral, rational, real, complex} numbers under addition form a group, and so do permutations of a set under composition form a group. 04:58:20 -!- gweiqi [n=greg@69.120.126.163] has left #scheme 05:01:56 ooh neat, defining n-ary composition in terms of binary composition 05:03:13 (define (comp f . g) (if (null? (cdr g)) (bincomp f (car g)) 05:03:15 (comp (bincomp f (car g)) g))) 05:03:15 Argh. 05:03:52 Almost. 05:04:00 -!- Slereah_ [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has quit [Read error: 110 (Connection timed out)] 05:04:06 First of all, can you compose a sequence of one procedure? 05:04:19 Well, that's the null case 05:04:38 No, your base case requires two procedures. 05:05:08 Well, I can't compose a function with nothing 05:05:49 Why not? 05:07:36 Well, because in that case, I don't need composition 05:07:51 Well, sure, you don't need binary composition. 05:08:09 I can do a (null? (car g)) case if you want 05:08:26 But it doesn't seem very helpful 05:08:35 Huh? 05:08:43 When will you ever include the empty list in a list of procedures? 05:08:51 You can compose a function with a function that is the composition of other functions though. 05:09:02 What I suggest is that your base case be when the list itself is empty, and you have only one procedure. 05:09:02 Yes indeed. 05:09:22 (compose) = beethoven? o_o 05:09:27 What should it return if the list is empty? 05:09:55 Well, suppose you want (COMPOSE (COMPOSE F ...) (COMPOSE G ...)) to be equivalent to (COMPOSE F ... G ...). 05:10:00 You can error out if it makes you feel comfortable. I wouldn't return anything defined in that case. 05:10:02 What, then, should (COMPOSE (COMPOSE F) G) be equivalent to? 05:10:24 (foldl compose (list f g)) :D 05:10:44 COMPOSE F should not work D: 05:10:48 (foldl compose something (list f g)) 05:10:52 Why not, Slereah? 05:11:05 Well, because I'd expect composition to be at least binary. 05:11:19 At least, yeah. 05:11:21 I could return F as some sort of pathological case I suppose. 05:11:23 Does it sound reasonable that if I write (COMPOSE (COMPOSE F G H) (COMPOSE P Q R)), I ought to get (COMPOSE F G H P Q R)? 05:11:29 What I figured out requires it to be binary. 05:11:31 "pathological" ;) 05:11:45 What you call a `pathological case', I call a `base case'. 05:12:16 Well, comp(FGH) is F(G,H) and comp(PQR) is P(Q,R) 05:12:22 Or, actually only requires... no actually it does return f. Dang... 05:12:34 -!- raikov [n=igr@203.181.243.11] has quit [Read error: 110 (Connection timed out)] 05:12:35 So it doesn't actually work 05:12:45 Huh? 05:12:46 No it works great. 05:12:53 Please make sense. 05:12:58 What does it return? 05:13:03 Just (compose f) -> f, for no particular reason. 05:13:17 If I apply (COMPOSE F G H P Q R) to an argument X, I ought to get back (F (G (H (P (Q (R X)))))). 05:13:33 That's not what the composition function does 05:13:34 synx, `no particular reason' is absurd. 05:13:45 Maybe we've found the problem now. 05:13:51 Wait 05:13:53 Lemme think 05:13:53 Slereah, uh, what about (COMPOSE F G)? Surely if I apply the result of that to an argument X, I ought to get (F (G X)). 05:14:01 Yeah 05:14:12 mfredrickson [n=mfredric@c-98-212-171-158.hsd1.il.comcast.net] has joined #scheme 05:14:16 (COMPOSE F G H P Q R) -> F(G,H,P,Q,R) 05:14:19 ...no. 05:14:34 Is (COMPOSE F G) equivaleant to (F G)? 05:14:38 Well, that's what I want it to do :o 05:14:53 Well, then you have a notion of `composition' that is completely alien to everyone else on the planet. 05:14:56 It's composition as in primitive recursive functions 05:15:48 Owait 05:15:59 It might actually be "substitution" 05:16:05 It's how old man Kleene references it 05:16:15 Can you make up your mind about what you're trying to do here? 05:17:07 Slereah: it seems that you are trying to make "apply" 05:17:36 "The function shall be compound with respect to...." 05:17:38 Ah fuck. 05:17:41 Wrong name. 05:18:15 -!- certainty [n=david@212.77.226.243] has quit [Remote closed the connection] 05:18:35 I'm absurd yay! 05:18:57 raikov [n=igr@203.181.243.11] has joined #scheme 05:19:08 Well, it should be (comp f g h ...) = f(g,h,...) anyway. 05:19:18 Yeah, that's totally apply. 05:19:23 Which is described as "compound" or 'substitution". 05:19:33 (apply f g h ...) or better yet just (f g h ...) 05:19:57 Well, that's what I did the first time and it didn't work 05:20:09 Because you can't feed a function to most functions. 05:21:03 synx: you mean, (apply f (list g h ...)) 05:21:22 Slereah: well we're fuzzying it up a bit to match your format, but zbigniew illuminated the correct syntax 05:21:38 Slereah, did Mr Kleene actually use the word `composition'? 05:21:40 My original function was (define (comp f . g) (apply f g)) 05:21:49 Nah. 05:21:50 I fucked up 05:22:00 'cause the case of one function is composition. 05:22:13 ...OK. 05:22:44 ok but "composition" to me means (compose f g) => (f (g)) 05:22:53 My apologies for losing patience. You did say much earlier on that you wanted (f g h ...), which I disregarded as an accidental output of confusion. 05:23:00 and to most other people, I think 05:23:00 (or, that you wanted f(g, h, ...)) 05:23:08 merlincorey, can you fix your error? 05:23:36 -!- npe [n=npe@66.112.249.148] has quit [] 05:24:00 geckosen1tor [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has joined #scheme 05:25:12 Well yeah, most functions don't take a function as an argument. 05:25:12 (+ * -) doesn't make sense. 05:25:25 Riastradh: maybe? perhaps I ommited that often one composes unary functions so you actually get (f (g x))? 05:25:25 http://en.wikipedia.org/wiki/Primitive_recursive_functions#Definition 05:25:31 # Composition: Given f, a k-ary primitive recursive function, and k m-ary primitive recursive functions g1,...,gk, the composition of f with g1,...,gk, i.e. the m-ary function h(x1,...,xm) = f(g1(x1,...,xm),...,gk(x1,...,xm)), is primitive recursive. 05:25:33 Oh bother 05:25:52 Riastradh: was I close? 05:26:01 Slereah: now you're on the proper path for composition 05:26:04 merlincorey, that's better, but you have yet to say where x comes from. 05:26:16 Well, that's actually what I was trying to do 05:26:43 What Godel called compound (in German, I assume) and Kleene substitution. 05:26:43 And wikipedia composition apparently 05:26:44 Oh I think that means (f (g x)), but it generalizes to (f (g1 x) (g2 x) (g3 x)) 05:26:53 I smell a call-with-values approaching. 05:27:01 Riastradh: sorry I suck on theory I was only trying to help :D... but it comes... from... the caller? 05:27:02 *Riastradh* hands Daemmerung a handkerchief. 05:27:05 (call-with-values your-mom) 05:27:12 -!- tjafk1 [n=timj@e176220184.adsl.alicedsl.de] has quit [Read error: 110 (Connection timed out)] 05:27:16 *Daemmerung* accepts with thanks, promises to launder it 05:27:38 merlincorey, if you *apply* the composition of two procedures f and g to an argument x, what you get is (f (g x)). The composition of f and g is not simply the value of (f (g x)) for some x, whatever it may be. 05:27:39 tjafk1 [n=timj@e176223150.adsl.alicedsl.de] has joined #scheme 05:27:48 Or, conciser: ((compose f g) x) = (f (g x)) 05:28:00 So you want to map a list of arguments to a list of 1 argument functions, then compose that within a single function. 05:28:37 MichaelRaskin [n=MichaelR@3ad50e34.broker.freenet6.net] has joined #scheme 05:29:14 Riastradh: ach so; thanks for helping me make up for my omission. It would confuse with the adder example usually given to show closure without that context :) 05:29:16 I hope I don't get that much trouble with the primitive recursion. 05:29:55 aaaanyway have a good night everyone :) I am FINALLY heading home 05:29:59 Bye. 05:33:37 (define (weirdmap l1 l2) (if (null? l1) null (cons ((car l1) (car l2)) (weirdmap (cdr l1) (cdr l2))))) ; >_< 05:33:44 (define (compose-once f . gs) (lambda x (apply f (weirdmap gs x)))) 05:33:53 that'd work, right? 05:34:17 Well, let's see 05:35:29 > ((compose-once (lambda (x y z) (+ x y z)) s s s) 1 1 1) 05:35:29 6 05:35:32 It seems to! 05:36:52 Hm. 05:37:01 -!- mfredrickson [n=mfredric@c-98-212-171-158.hsd1.il.comcast.net] has quit [] 05:37:15 Ah bother. 05:37:31 The arguments of the functions inside should be the same. 05:37:43 (compose-once (lambda (x y z) (+ x y z)) s s s) should only require one argument. 05:39:34 -!- geckosenator [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has quit [Read error: 110 (Connection timed out)] 05:40:18 I bet your britches there's a better way to define weirdmap that doesn't suck. 05:40:18 Slereah I mean. 05:40:30 I don't have britches. 05:41:42 *Daemmerung* hastily offers a fig leaf 05:41:51 I've got a bathrobe. 05:41:57 Do not worry about decency. 05:44:17 Oh heh, easy fix that. 05:47:08 (define (weirdmap l1 l2) (if (null? l1) null (cons (apply (car l1) l2) (weirdmap (cdr l1) l2)))) 05:47:49 > ((comp (lambda (x y z) (+ x y z)) s s s) 1) 05:47:49 6 05:47:49 yay :D 05:48:18 Although I probably should try something more complex first 05:48:28 (define s (lambda (x) (* 2 x)))? 05:48:39 s is x+1 05:48:46 Oh okay! 05:48:47 (It's the successor operator) 05:49:13 > ((comp (lambda (x y z) (+ x y z)) (lambda (x y z) (+ x y z)) (lambda (x y z) (+ x y z)) (lambda (x y z) (+ x y z))) 1 1 1) 05:49:15 9 05:49:21 Seems okay. 05:49:30 All I did was apply the elements of l2 to l1, instead of applying the (car l2) to each element of l1. Could use regular old map for that in fact... 05:49:46 bcow pasted "bracket problem" at http://paste.lisp.org/display/70186 05:50:14 in the function i just pasted how can i change that + to a ) 05:50:21 Well, now let's see if I can define addition, the primitive recursive way 05:50:47 i want to make a case for if the token is a bracket but if i just replace + with ) it won't run 05:51:54 > (r (p 1) (comp s (p 3)) 2 3) 05:51:54 4 05:51:54 Is 2+3 = 4? 05:56:38 Slereah_ [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has joined #scheme 05:57:52 Oh wait, my definition was wrong 05:57:56 It actually works 05:58:06 > (r (p 1) (comp s (p 2)) 2 3) 05:58:06 5 05:58:12 :D 05:58:25 bcow: what is the input to infixtopostfix? 05:58:38 list 05:59:03 List of what? 05:59:06 I mean, give me an example input. 05:59:23 like (((2+2)*4)) 05:59:36 > (r (p 1) (p 1) 3) 05:59:36 . . list-ref: index 0 too large for list: () 05:59:49 Well, r is going to pose some problems too apparently. 05:59:52 i take it a lot of people have been coming here for help with that assignment 06:00:03 *Daemmerung* nods 06:00:24 Is this y'all's first Scheme program? 06:00:28 ya 06:00:39 I see. 06:01:36 bcow: if what you wrote denotes a literal list, please understand that there are no parentheses in that list. 06:01:57 The parentheses that you see represent the structure of the list. 06:03:55 well the outer parentheses do 06:04:33 but when you read it in with read-char it will put the parentheses as an item in a list 06:04:57 Oh, so it is not the denotation of a literal list. 06:04:59 So this is not a literal list then. 06:05:32 bcow: what is the input *to infixtopostfix*? (Not the user's original input.) 06:06:02 -!- foof [n=user@dn157-046.naist.jp] has quit ["ERC Version 5.2 (IRC client for Emacs)"] 06:06:38 Why don't you build a list of input, then examine it to see what you have in that list? It should give you a hint as to what `case' expects in order to recognize each element. 06:06:46 sry a list containing each token in the expression ((2+2)*3) so like (( 2 + 2 ) * 3) 06:07:41 ya i just don't know what "escape" char or whatever to put infront of ( so my case statement evaluates it as a ( and not the starting of a list 06:07:42 (Use 'write' when examining the contents of the list.) 06:07:43 you know what i mean 06:08:40 How about you add something like: (write expr) (newline) at the beginning of infixtopostfix. This will let you do some simple debugging. 06:08:43 like the snippet i posted works fine for the + but drscheme won't parse it if i replace the + with ( and i need to handle the case of ( 06:08:51 okay 06:09:22 If you write (case x ((+) "foo")), the case statement matches x against the symbol +. If you write (case x ((#\+) "foo")), the case statement matches x against the character +. The symbol is not the same as the character. 06:09:54 a1len_ [n=James@cpe-76-174-234-139.socal.res.rr.com] has joined #scheme 06:10:24 -!- a1len [n=James@unaffiliated/a1len] has quit [Nick collision from services.] 06:10:25 -!- a1len_ is now known as a1len 06:10:38 Which is the confusing part -- it means it is either not a collection of characters but a scheme list, or it is tokenized in some other way, or the + doesn't work beyond compiling correctly 06:11:23 la la la 06:13:35 Argh 06:13:49 I have this : 06:13:50 (define (p n) (lambda x (list-ref x (- n 1)))) 06:13:51 (define (r f g n . args) (if (= 0 n) (apply f args) 06:13:51 (apply g (append(list (- n 1) (apply r (append (list f g (- n 1))args))) args)))) 06:13:52 duncanm: are you aware that you're pinged? 06:14:00 And I get this : 06:14:02 > (r (p 1) (p 1) 3) 06:14:02 . . list-ref: index 0 too large for list: () 06:14:03 D: 06:14:21 It should return 2, in a perfect world 06:14:24 eli: no 06:14:28 -!- timchen1` is now known as nasloc__ 06:15:05 eli: by who? 06:15:11 duncanm: well, you are. By me. 06:15:19 eli: ah, what's up? 06:15:56 I was very impressed with running ssh on the bb -- is that midpssh the best thing to use? 06:16:09 eli: yeah 06:16:52 And IRC is jmirc? 06:16:53 eli: if you want to irc as well, i'd recommand using a dedicated client instead of screen over ssh 06:16:57 eli: that's right 06:17:07 Anything else I must have? 06:17:13 eli: the google stuff, like google maps 06:17:20 Yes, that's obvious. 06:17:30 eli: if you keep your calendar on google calendar, there's google sync to keep everything in order 06:17:39 [Yeah, got that.] 06:17:43 Are you using the opera browser thing or the default one? 06:17:50 eli: just the default one 06:18:01 eli: are you on t-mobile? which OS are you running on your blackberry? 06:18:07 Slereah_: that's pretty complicated. What are you trying to do with all the list and append calls? 06:18:20 i upgraded to 4.5 recently, and it's quite nice 06:18:40 it comes with Asian input support, which is useful for me - you might be able to get Hebrew support? 06:21:19 -!- Slereah [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has quit [Read error: 110 (Connection timed out)] 06:21:44 timchen1` [i=tim@kalug.ks.edu.tw] has joined #scheme 06:21:44 -!- nasloc__ [n=vzloct_2@kalug.ks.edu.tw] has quit [Remote closed the connection] 06:24:17 -!- peter_12 [n=peter_12@S010600119506b129.gv.shawcable.net] has quit [] 06:27:18 foof [n=user@naist-wavenet125-179.naist.jp] has joined #scheme 06:32:34 ... may wonder still how LOOP can be as expressive as named LET, with which 06:32:34 one can update the loop variables (which we introduced in LOOP using 06:32:34 WITH clauses) when explicitly continuing the. 06:32:55 Riastradh: ^ "the loop"? 06:34:49 -!- bpt [n=bpt@cpe-071-070-209-067.nc.res.rr.com] has quit [Read error: 110 (Connection timed out)] 06:36:52 is #\( a string ? 06:37:06 It is a character. 06:37:17 bcow: No, it's a char. (string #\() => "(" is a string. 06:38:20 thx 06:39:48 kniu [n=kniu@DA-YU.RES.CMU.EDU] has joined #scheme 06:42:01 is there a simple way to get 1 out of #\1? 06:44:42 Do you know how to convert a string to a number? 06:44:55 no 06:45:42 There is a standard procedure to do so, but I don't know if you're allowed to use it. 06:45:58 i have no clue what we are and are not allowed to use. it wasn't really specified 06:46:38 If you just want to convert a single digit character to a number, you could write a function that just has 10 cases... 06:46:49 ya 06:47:47 jkukka [n=paul@62.117.74.154] has joined #scheme 06:48:35 -!- rmrfchik [n=paul@relay2.jet.msk.su] has quit [Read error: 104 (Connection reset by peer)] 06:51:50 You could also check here for another option: http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_sec_6.2.6 06:51:52 -rudybot:#scheme- http://tinyurl.com/5r2j3r 06:58:32 ramkrsna [n=ramkrsna@unaffiliated/ramkrsna] has joined #scheme 06:59:30 annodomini [n=lambda@c-75-69-96-104.hsd1.nh.comcast.net] has joined #scheme 07:00:24 Slereah [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has joined #scheme 07:01:57 -!- Slereah [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has left #scheme 07:04:43 athos [n=philipp@p54B87199.dip.t-dialin.net] has joined #scheme 07:09:49 -!- jkukka is now known as rmrfchik 07:13:40 re 07:14:24 -!- kniu [n=kniu@DA-YU.RES.CMU.EDU] has quit [Remote closed the connection] 07:15:26 certainty|work [n=david@212.77.226.243] has joined #scheme 07:22:40 -!- Slereah_ [n=jewbutt@ANantes-252-1-45-102.w82-126.abo.wanadoo.fr] has quit [Read error: 113 (No route to host)] 07:26:37 mmm how do you do and operator like: (case (((eq? x y)(eq? w z))(;only fire if both are true))) ? 07:26:52 hml [n=x@unaffiliated/hml] has joined #scheme 07:28:37 hml_ [n=x@unaffiliated/hml] has joined #scheme 07:28:44 -!- hml [n=x@unaffiliated/hml] has quit [Client Quit] 07:28:50 bcow: read this section: http://schemers.org/Documents/Standards/R5RS//HTML/r5rs-Z-H-7.html#%_sec_4.2.1 07:28:52 -rudybot:#scheme- http://tinyurl.com/5e5ss3 07:29:50 -!- hml_ is now known as hml 07:30:10 ah thanks zbigniew 07:38:35 -!- cracki [n=cracki@sglty.kawo2.RWTH-Aachen.DE] has quit ["The funniest things in my life are truth and absurdity."] 07:38:46 bpt [n=bpt@cpe-071-070-209-067.nc.res.rr.com] has joined #scheme 07:40:17 bcow: Do we actually have to allow input of the infix expression like he has in the example? 07:47:42 -!- kilimanjaro [n=kilimanj@70.116.95.163] has quit [Remote closed the connection] 07:51:09 -!- annodomini [n=lambda@wikipedia/lambda] has quit [] 07:51:58 ^self [i=foobar@117.102.13.88] has joined #scheme 07:52:00 <^self> hi. 07:52:04 <^self> no sarahbot today? 07:53:04 bobbi i believe so, he supplied some functions to parse & grab the input expressions though 07:55:02 Ya. that is true. I just don't like how they are stored is all 07:56:46 ya 07:57:17 the #\(, #\) etc are fine, but it's a pain how it has all the numbers stored like that 08:02:02 ya it would have been nice if he would have supplied a function to convert them, or explained how to do some of the rudimentary(sp) stuff 08:02:39 Ya. We were kind of left out on our own to learn pretty much everything. 08:02:52 Which is perhaps a good thing. 08:03:21 I have mine all working except the input from the console. If i give my infix to postfix an expression it works fine 08:05:18 -!- raikov [n=igr@203.181.243.11] has quit [Remote closed the connection] 08:06:16 cool 08:06:54 how is yours going? 08:09:00 good just finishing up the infix to postfix, still need to do the postfix evaluator 08:09:42 do you have it reading in from the console? 08:11:55 nope but i was messing around with it before, what are you having trouble with ? 08:12:51 -!- hadronzoo [n=hadronzo@ppp-70-251-241-233.dsl.rcsntx.swbell.net] has quit [] 08:13:06 Just need the numbers to be read in as actual numbers rather than #\1 for example 08:13:30 <^self> are you using (read) ? 08:14:29 we were given a set of functions which appear to use read-char 08:15:07 <^self> oh. 08:15:23 But I think I will try to come up with something else. 08:15:38 i dunno if thats possible because it has to read in the operators too which have to be chars, i was planning on just making a function that coverts the char to number and use it whereever i have to evaluate the numbers 08:16:05 <^self> i can never remember the char/string functions 08:17:05 Ya, I was thinking about doing something similar. But I almost think it may be easier to come up with something else. I'm guessing he wants us to be able to have integers > 10 which his functions don't support 08:18:10 <^self> well, that's pretty easy, i think. read a character, if it's #\0 to #\9, treat it as a number. read next character, if it's a number, multiply what you have by 10 and add the new number 08:18:31 ya 08:19:28 bobbi, bcow you do the same work? ;) 08:19:46 It appears we are in the same class, working on the same assignment 08:19:57 heh small world 08:20:11 And it also appears that we both left it to the last minute:P 08:21:17 ;) 08:27:19 there is simpler way to parse (if you don't want to use (read)) 08:27:43 at first, write function which takes string and returns list of strings 08:28:08 I want to try to use read, but some how i need to convert ( to #\( for example 08:28:11 i.e., "hi there + 12+3)" -> ("hi" "ther" "+" "12" "+" "3" ")") 08:28:42 in chicken, can I redefine #:network-error? 08:28:48 and what does the #: funky name mean? 08:29:33 dunno 08:29:51 how do I catch errors from tcp-connect 08:29:54 does read read a string? 08:29:58 bobbi: at second, write a function, which takes list of strings and returns list of lexems 08:30:01 bobbi: 08:30:02 hml: #: designates a keyword 08:30:06 bobbi: no, it reads s-exp 08:30:38 to convert "12" to number just use string->number function 08:31:13 hml: the reader may also accept :network-error or network-error:, depending on the current keyword style, but #: is guaranteed to work 08:31:41 (condition-case (define-values (input output) (tcp-connect "localhost" 8080)) [(exn) (print "c\ 08:31:44 aught error")]) 08:32:17 so I'm trying to catch this condition/error; but not able to do so (the error still gets printed and terminates my app by while throwing a stack trace) 08:32:23 how do I catch errors from tcp-connect? 08:32:52 Is it possible to use read for what i want to do? 08:33:45 you want to read infix string? "1+2"? 08:34:04 ya, they can also include parentheses 08:34:06 hotblack23 [n=jh@p5B05486A.dip.t-dialin.net] has joined #scheme 08:34:24 hml: I just tried it: 08:34:26 #;2> (condition-case (define-values (i o) (tcp-connect "abcd" 80)) ((exn) (print "failure"))) 08:34:28 failure 08:35:17 bobbi: i will not advise to use (read) in this case 08:35:47 ok. so i should use read-char to read in one character at a time then? 08:38:25 incubot: eval (chicken-version #t) 08:38:26 SVN rev. 11987 compiled 2008-10-23 on amd (Linux) 08:39:44 incubot: eval (string-translate (chicken-version #t) "\n" "\t") 08:39:45 Version 3.4.0 - linux-unix-gnu-x86-64 [ 64bit manyargs ptables applyhook ] SVN rev. 11987 compiled 2008-10-23 on amd (Linux) 08:41:16 zbigniew: what version of chicken are you using? 08:41:25 3.3.3 08:42:00 hmm; i'm using 3.4.0 08:42:02 let me try 3.3.3 08:42:24 I can't imagine that will matter 08:42:27 ejs [n=eugen@nat.ironport.com] has joined #scheme 08:42:51 did you try typing that into csi? 08:43:21 no, I ran it with csi -s 08:43:55 weird 08:44:04 different result from "csi -s" vs "csi" 08:44:15 bobbi: you can read-line 08:44:51 hml: so, you did like 'csi -s a.scm' where a.scm contains just (use tcp) (condition-case ...) ? 08:44:55 ya 08:45:03 sorry for not being clearer earlier 08:45:17 i (famous last words) didn't think this difference would matter 08:45:26 there should be no difference 08:45:53 omg 08:46:04 please ignore me 08:46:04 it works the same here 08:46:07 i screwed up again 08:46:58 all works for me now 08:47:07 ok, but, why? 08:47:34 I had an extra line that I didn't see that did tcp-connect with the same thing 08:47:53 lol 08:48:33 it happens 08:49:43 i'll try to embrass myself less w/ unit testing skills in the future 08:51:47 ls 08:59:12 <^self> #scheme> . .. 09:14:07 yay. now i have (#\( #\space 1 2 #\space #\+ #\space 2 3 #\space #\)) 09:14:20 Now i need to get rid of the spaces, and make the 1 2 without a space between it 12 instead of 1 2 09:15:13 -!- hotblack23 [n=jh@p5B05486A.dip.t-dialin.net] has quit [Read error: 110 (Connection timed out)] 09:16:05 (remv #\space list) 09:16:38 is there a simple way to convert the ( 1 2 ) to be 12? 09:16:47 but i guess you will need to combine the numbers first 09:17:09 (+ (* a 10) b) 09:17:09 ya. so that space will be a good helper for that. combine numbers until i reach a space 09:17:44 it could be a 3 digit number, or a 4 09:17:46 or more 09:18:17 duh, why u do it so complex? ;) 09:18:27 1. read-line 09:18:37 2. convert to string list 09:18:42 i can't find any info out on read-line 09:18:43 3. convert to lexem list 09:19:14 read-line just return line read from input stream 09:20:45 just hack your string to list of strings (with delimiters) 09:22:09 i can already assume space is a delimiter. 09:22:24 all the inputs will be ( ( 12 + 3 ) * 4 ) for example 09:25:17 nice, next, write function "( ( 12 + 3 ) * 4 )" -> '("(" "(" "12" "+" "3" ")" "*" "4" ")") 09:29:53 should there be a simple way to do that? 09:31:01 <^self> you want to split the string 09:31:44 I would do it like this: convert whole string to list of chars: (string->list (read-line)), then, write recursive func (glue char-list lst), which collect strings from char-list to lst 09:34:45 exhaustion has set in i think 09:35:34 -!- synthasee [n=synthase@68.63.20.12] has quit [Read error: 110 (Connection timed out)] 09:35:54 bobbi: what year in colledge? 09:35:54 synthasee [n=synthase@68.63.20.12] has joined #scheme 09:36:08 third i guess 09:36:23 why do you ask? 09:38:20 just curious 09:39:28 <^self> my programming languages courses (using eopl) was a junior-level course, too. 09:40:18 This has been a frustrating assignment. Basically we were told about car, cdr, cons, and cond 09:40:53 to program you should "think in scheme" or "in car, cons and cdrs" 09:41:10 ya 09:41:16 you should think in algorithms, they are universal 09:41:28 then you implmenet it in your lovely language 09:42:27 My only problem is is that recursion has huge over head in c or c++ for example. I do completely the opposite that I am doing here. In c for example there are simple ways to solve problems using recursion but i try to stay away from it. now I have to change that mindset when recursion is the only thing that works 09:42:53 So, the algorithms in the way I think are quite a bit different than the scheme way 09:42:58 <^self> have you learned about tail-recursion in scheme? 09:43:15 we have learnt about very little 09:44:03 <^self> it's been over a decade since i took that class, and i remember very little about what tripped up other students 09:44:39 I have figured everything out except this input stuff 09:48:09 bcow pasted "bad if null syntax" at http://paste.lisp.org/display/70195 09:49:09 in that snippet i keep getting "procedure if: no clause matching 4 arguments: # # # #" error related to the if null syntax, no matter how many brackets i add/remove it seems 09:49:14 any idea whats wrong with it 09:52:12 attila_lendvai [n=ati@catv-89-133-170-239.catv.broadband.hu] has joined #scheme 09:56:07 -!- foof [n=user@naist-wavenet125-179.naist.jp] has quit ["ERC Version 5.2 (IRC client for Emacs)"] 09:59:56 <^self> hmm. 10:01:07 bcow whats that brace doing before (let ... ? 10:02:06 ahhh that was it, thanks leppie 10:02:14 that probably needs to go infront of the tail call to infixtopostfix 10:04:35 -!- geckosen1tor [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has quit [Read error: 110 (Connection timed out)] 10:04:58 -!- a1len [n=James@unaffiliated/a1len] has quit ["Lost terminal"] 10:08:13 foof [n=user@dn157-046.naist.jp] has joined #scheme 10:08:15 thanks everyone for the help. i think i have it fully working now 10:09:15 -!- bobbi [n=nathan@S010600a0cc61ea28.lb.shawcable.net] has quit ["Ex-Chat"] 10:11:00 -!- hml [n=x@unaffiliated/hml] has quit ["leaving"] 10:17:55 johnnowak [n=johnnowa@207-38-171-48.c3-0.wsd-ubr1.qens-wsd.ny.cable.rcn.com] has joined #scheme 10:23:56 -!- ineiros_ is now known as ineiros 10:39:35 *elf* ponders the souls of the living and the dead. 10:41:22 the dead have souls? 10:41:51 no. after GC, the space they take up is back on the heap. 10:42:36 fschwidom [n=fschwido@dslb-084-059-136-162.pools.arcor-ip.net] has joined #scheme 10:47:33 besiria [n=user@webspirs.uom.gr] has joined #scheme 10:47:34 -!- besiria [n=user@webspirs.uom.gr] has left #scheme 10:48:36 elf: my ex-girlfriend postulated something similar; it helped her cope with past foeticides 10:48:54 foeticide. interesting term. 10:49:44 why is a homicide the killing of a human, but an insecticide that with which one can kill insects? 10:50:08 *elf* ponders marketing a spray that will kill humans. 10:50:12 mmmm.. vx. 10:50:22 agh 10:50:22 *leppie* was thinking the same :) 10:50:42 VX-Wow! Guaranteed Homicide Spray! 10:50:58 Kills humans on contact. 10:50:59 kill all known humans, dead! 10:51:04 johnnowak: according to the OED, homicide used to be used similarly: 1825 T. JEFFERSON Autobiog. Wks. 1859 I. 94 Their unholy and homicide alliance. 10:51:08 Will even destroy their nests and babies. 10:51:32 for annoying and nice humans 10:51:56 klutometis: good to know! 10:52:32 Danger: Do not use. Do not get near. Do not have babies after using this product. Do not have babies. Use only in a well-ventilated area. Do not overuse. Some restrictions may apply. See stores for details. Void where prohibited. Prosecutors will be violated. Does not apply to CA, MA, DA, or WA. 10:53:25 aep [n=aep@unaffiliated/aep] has joined #scheme 10:53:32 hi. 10:53:38 aep: 'lo 10:53:39 not at the moment. 10:53:46 yourself? 10:53:59 how do i return a variable in scheme? supposed i want a function that returns a constant no matter what the input is 10:54:01 *elf* is merely sick and very wiped out. 10:54:15 just make that constant the last statement 10:54:15 (define (foo in) constant) 10:54:39 (foo 3) -> constant 10:54:41 m i tried that i think 10:54:44 incubot: ((lambda () (+ 2 2) 'my-we-did-a-lot-of-work-today)) 10:54:44 my-we-did-a-lot-of-work-today 10:54:49 (foo "im a giant whale") -> constant 10:55:03 (foo "homework is fun") -> constant 10:55:05 (define things (lamdba (x) #t )) 10:55:13 um 10:55:14 (foo "there are no cats in america") -> constant. 10:55:31 -!- ejs [n=eugen@nat.ironport.com] has quit [Read error: 110 (Connection timed out)] 10:55:39 elf: there are no cats on the internet, though 10:55:43 *elf* hates getting sick whilst moving. 10:55:48 klutometis: lo. 10:55:52 er, lol. 10:55:54 hm thanks 10:56:11 *elf* lolls a cat. 10:56:28 hm, can loll be used as an indirect verb like that? 10:57:22 Warning: invalid expression 10:57:22 () 10:57:31 i guess my scheme implementation is doing it wrong? 10:57:43 turns out lol goes back to the 18th century: 1798 WOLCOTT (P. Pindar) Tales of Hoy Wks. 1816 IV. 18 Let us have something in the tol-de-roll-loll-way--funny. 10:57:51 aep: can you paste your whole expression? 10:58:00 klutometis: lol or loll? 10:58:13 incubot: (define stuff (lambda(x) () ) ) 10:58:13 Error: illegal non-atomic object: () 10:58:17 ew 10:58:21 () isnt a valid object. 10:58:25 ejs [n=eugen@nat.ironport.com] has joined #scheme 10:58:36 elf: both, apparently; it was an extended form of "tol de rol lol" 10:58:46 klutometis: disturbing. 10:59:08 do you have a copy of the oed, mr klutometis? 10:59:22 elf: physical and immaterial; only 2nd ed, though 10:59:32 damn. 10:59:36 i want a paper copy. 10:59:39 i dont have one :( 10:59:43 it smells nice 10:59:46 i know. 10:59:47 incubot: (define stuff (lambda(x) (+ 2 2) "nothing" ) ) (stuff 3) 10:59:48 nothing 10:59:55 its empty with my scheme :( 10:59:56 aep: there you go! 11:00:01 hmm; what scheme is that? 11:00:01 doesnt reutrn anything 11:00:08 plt scheme 11:00:15 in the repl, or with a script? 11:00:17 err. well the binary is called scheme48 11:00:18 n idea 11:00:26 sorry? 11:00:31 scheme48 != plt scheme , for any value of either. 11:00:36 heh 11:00:58 aep: some schemes won't print values from a script unless you explicitly use, say, display 11:00:59 i love beeing confused :P 11:01:04 ah! 11:01:10 yeah was a script 11:01:19 strangely it is valid in chez too... 11:01:37 *elf* mutters about the scheme that time forgot. 11:01:44 *elf* mutters more about the scheme that time should forget. 11:01:46 aep: try it, if you can, from the interactive prompt 11:01:58 elf: anti-chez? 11:02:01 schmalbe [n=bernhard@p549A3A86.dip0.t-ipconnect.de] has joined #scheme 11:02:14 klutometis: just grumpy today. sick and worn out, as previously mentioned. 11:02:14 yeah that worked! 11:02:15 thanks 11:02:37 trying to figure out how to write a note to the r6 list. 11:02:37 elf: sorry to hear that; ask your SO for some soup and nipples 11:02:38 is there any scheme implementation for people used to bash ans alike? 11:02:39 helps me 11:02:53 soup and nipples? 11:02:57 aep: how like bash? 11:03:12 well with an interactive mode and especially witha history 11:03:20 with readline support, you mean? 11:03:28 erm. i guess i mean that, yes 11:03:41 aep: chicken works great 11:03:45 if readline is what makes bash nice to work with :) 11:03:48 chicken? 11:03:49 just need an incantation in your .csirc 11:03:50 *aep* googles 11:03:50 gambit as well, same with guile. 11:03:56 aep: callcc.org 11:03:58 www.call-with-current-continuation.org 11:04:06 guile doesnt even respond to ctrl+c :( 11:04:50 elf: yeah; soup and nipples sooth and passify, respectively 11:05:02 pacify* 11:05:21 heh, i dont think mine would be particularly thrilled with the idea. 11:05:28 shes somewhat under the weather as well. 11:05:44 hmm; that's a difficult one, then 11:06:01 i think i *gasp* need to sleep. 11:06:37 so goodnight, all. dont kill too many people i wouldnt kill, or if you do, hide their bodies well for future jerky making. 11:06:54 cracki [n=cracki@sglty.kawo2.RWTH-Aachen.DE] has joined #scheme 11:07:15 chicken apears to be a scheme to c compiler 11:07:22 elf: have fun tickling your melatonin receptors 11:07:41 and the resulting c file doesnt have any variable output either :( 11:07:49 aep: it functions as a compiler, too 11:07:53 but csi is an interactive shell 11:07:58 lisppaste: url 11:07:58 To use the lisppaste bot, visit http://paste.lisp.org/new/scheme and enter your paste. 11:08:14 -!- Daemmerung [n=goetter@64.146.161.228] has quit [Remote closed the connection] 11:08:18 doesnt apear to load my script when passed as argument 11:08:29 klutometis pasted ".csirc" at http://paste.lisp.org/display/70198 11:08:32 well i guess its to good for my needs :D 11:08:43 i really need something extremly basic 11:08:55 *aep* tryes klutometis's past 11:09:00 put the above in your .csirc for readline support 11:09:10 csi -s will read your script 11:09:33 Error: (require) can not load extension: readline 11:10:05 chicken-setup readline 11:10:08 that will install it 11:10:20 indeed -s does, acording to the manual. but it doesnt print variables 11:10:26 ventonegro [n=user@136.166.1.3] has joined #scheme 11:10:34 that's the default with most schemes, honestly 11:10:41 fire up csi and run (load "file.scm") 11:10:46 that will print by default 11:11:12 can i change the default then? 11:11:47 awesome. readline support :) 11:11:56 thats what i call comfortable. thanks! 11:12:00 not sure; doing (load "") will do the trick 11:12:09 or working with emacs in scheme-mode will, too 11:12:15 that's how i usually do it 11:12:15 <^self> mmm, emacs 11:12:30 i dont understand emacs :P 11:12:56 then maybe load is for you 11:13:10 yeah hum. can i make the compiler print variables? 11:13:37 you mean print output by default? 11:13:37 <^self> (display somevariable) ? 11:13:48 yeah; you'll need explicit displays 11:13:53 oh. ok 11:13:57 willdo thanks 11:14:09 <^self> don't forget a (newline) 11:14:16 erm how do i cancel input with csi when i had a typo? 11:14:27 ctrl+c is ignored 11:14:42 -!- MichaelRaskin [n=MichaelR@3ad50e34.broker.freenet6.net] has quit ["Leaving."] 11:14:44 C-d? 11:14:57 nope :( 11:15:17 <^self> control-z, on windows? 11:15:39 beisdes, how do i quit that thing if ctrl+c is blocked? oO 11:15:42 no, linux 11:15:54 C-c works for me 11:15:56 so does C-d 11:15:57 ctrl+c results in ^C 11:16:04 maybe my terminal is not supported 11:16:07 *aep* tryes xterm 11:16:16 <^self> you can hit control-z, and then type "kill %1" or whatever the job number is. 11:16:23 neither 11:16:41 yeah, but thats rather uncomfortable when you only typed a line wrong ;) 11:16:51 what terminal are you using? 11:18:27 xterm under screen 11:21:10 oh well csc supports my workflow perfectly :) 11:21:17 thanks alot 11:22:07 np 11:26:30 i think i fail to understand the if condition oO 11:26:59 incubot: (if (4==4) ("hi")) 11:26:59 Error: unbound variable: 4==4 11:27:03 incubot: (if (4=4) ("hi")) 11:27:03 Error: unbound variable: 4=4 11:27:07 *shrug* 11:28:53 oh wait it's scheme oO 11:29:15 you shouldnt leanr scheme after doing 10 years C, really. bah 11:30:14 ok but how do i use if to return a different value froma function if a condition is matched 11:30:34 ie: a function a should reutun 3 if a is 11, and 4 if it inst 11:30:50 <^self> (if (= a 11) 3 4) 11:31:00 *aep* thinks about that for a moment 11:31:17 <^self> (if CONDITION THEN-STUFF ELSE-STUFF) 11:31:39 <^self> read up on conditionals in r5rs 11:31:41 hey this is actually easy 11:31:46 what a days... 11:32:34 whats r5rs? a book? 11:32:58 <^self> google for "r5rs html" 11:33:00 ramkrsna_ [n=ramkrsna@nat/redhat-in/x-8b5b83b15d7f5d38] has joined #scheme 11:33:07 <^self> i think you mean r6rs 11:33:10 aye thanks 11:33:45 <^self> head cold. can't concentrate on work. 11:34:46 <^self> hmm. do i want to order a sub. 11:35:22 -!- rmrfchik [n=paul@62.117.74.154] has quit ["Client exiting"] 11:35:23 :D 11:35:46 rmrfchik [n=paul@62.117.74.154] has joined #scheme 11:38:45 specbot: r5rs if 11:38:45 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-7.html#%_idx_98 11:38:46 -rudybot:#scheme- http://tinyurl.com/4xlwxg 11:39:40 incubot: ( (lambda (x) (if (= x #t) "true" "false") ) #t) 11:39:40 Error: (=) bad argument type: #t 11:39:45 whats wrong with that? oO 11:39:58 i can't compare #t with #t? 11:40:11 ((lambda (x) (if x 't 'f)) #t) 11:40:17 incubot: ((lambda (x) (if x 't 'f)) #t) 11:40:18 t 11:40:27 = only applies to numbers 11:40:32 ah! 11:40:34 eq? eqv? and equal? to objects 11:40:41 how would i compare strings then? 11:40:44 ah ok 11:40:45 incubot: ((lambda (x) (if (eq? x #t) 't 'f)) #t) 11:40:46 t 11:40:48 *aep* googles those 11:40:49 string=? 11:40:57 specbot: r5rs eq? 11:40:57 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_idx_216 11:40:58 "things" 11:40:59 -rudybot:#scheme- http://tinyurl.com/6hr3jb 11:41:28 ah its an object in scheme. allroght 11:44:39 "object" in the sense of booleans, pairs, lists, symbols, characters, strings, vectors, etc. 11:45:46 not, say, as an instance of a class 11:45:58 -!- ramkrsna [n=ramkrsna@unaffiliated/ramkrsna] has quit [Read error: 113 (No route to host)] 11:46:37 see "disjointness of types": http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-6.html#%_sec_3.2 11:46:38 -rudybot:#scheme- http://tinyurl.com/69m4y9 11:56:13 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 12:03:23 <^self> what's the user-agent? firefox? 12:13:17 -!- synthasee [n=synthase@68.63.20.12] has quit [Read error: 110 (Connection timed out)] 12:13:37 tizoc_ [n=user@r190-135-9-107.dialup.adsl.anteldata.net.uy] has joined #scheme 12:16:55 -!- tizoc [n=user@r190-135-48-29.dialup.adsl.anteldata.net.uy] has quit [Nick collision from services.] 12:16:59 -!- tizoc_ is now known as tizoc 12:24:23 -!- AtnNn [n=welcome@modemcable230.56-56-74.mc.videotron.ca] has quit ["foo"] 12:34:45 <^self> i don't have clisp installed, but in sbcl, it works: 12:36:10 Mr_SpOOn [n=Mr_SpOOn@89-97-102-218.ip17.fastwebnet.it] has joined #scheme 12:38:27 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Connection timed out] 12:41:17 -!- johnnowak [n=johnnowa@207-38-171-48.c3-0.wsd-ubr1.qens-wsd.ny.cable.rcn.com] has quit [] 12:46:56 -!- synx [i=synx@gateway/gpg-tor/key-0xA71B0C6A] has quit [Remote closed the connection] 12:47:59 synx [i=synx@gateway/gpg-tor/key-0xA71B0C6A] has joined #scheme 12:50:37 kib2 [n=kib@bd137-1-82-228-159-28.fbx.proxad.net] has joined #scheme 12:53:30 cemerick [n=la_mer@75.147.38.122] has joined #scheme 12:57:27 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 12:59:59 hkBst [n=hkBst@gentoo/developer/hkbst] has joined #scheme 13:05:04 -!- Modius [n=Modius@99.179.97.138] has quit ["I'm big in Japan"] 13:06:29 -!- attila_lendvai [n=ati@catv-89-133-170-239.catv.broadband.hu] has quit [Read error: 60 (Operation timed out)] 13:11:18 attila_lendvai [n=ati@catv-89-133-170-239.catv.broadband.hu] has joined #scheme 13:28:57 pfo [n=pfo@chello084114049188.14.vie.surfer.at] has joined #scheme 13:52:01 athos_ [n=philipp@p54B859BC.dip.t-dialin.net] has joined #scheme 13:53:14 -!- cemerick [n=la_mer@75.147.38.122] has quit [] 13:57:53 topo [n=topo@200.37.161.41] has joined #scheme 13:57:57 hello 13:58:17 anybody here? 13:59:03 No, this channel is nothing but dozens of bots. 14:01:46 bombshelter13 [n=bombshel@net1.senecac.on.ca] has joined #scheme 14:01:51 can i ask scheme questions to the bots? 14:02:13 i have a simple problem 14:02:18 maybe you can help me 14:02:23 im a noobie 14:02:24 hemulen [n=hemulen@cpe-069-134-114-252.nc.res.rr.com] has joined #scheme 14:02:30 i just want to put a function inside a variable 14:02:38 ive tried ( setf a '(glut:solid-sphere 13.529d0 13 3)) 14:02:44 but it puts as a value 14:02:49 how can i put as a function? 14:03:16 You mean `set!' not `setf'. 14:03:42 glut:solid-sphere is a procedure 14:03:49 (glut:solid-sphere 13.529d0 13 3) is a procedure application 14:03:54 '(glut:solid-sphere 13.529d0 13 3) is a list 14:04:09 oh 14:04:20 procedure application is a function? 14:05:07 -!- athos [n=philipp@p54B87199.dip.t-dialin.net] has quit [Read error: 110 (Connection timed out)] 14:05:39 Generally we use the term "procedure" for Scheme, not "function." 14:06:14 (glut:solid-sphere 13.529d0 13 3) calls the glut:solid-sphere procedure, which presumably returns a sphere object. 14:08:01 oh i use common lisp 14:08:23 #lisp deals mostly with common lisp 14:08:40 ok thanks 14:08:50 but is there too much difference between scheme and lisp? 14:09:01 At your level, yes. 14:09:52 ok 14:09:58 annodomini [n=lambda@64.30.3.122] has joined #scheme 14:10:14 switch to scheme while you can. or lambda daemons will take your soul. 14:10:42 one guy didn't switched and his soul now burns 14:10:49 -!- cracki [n=cracki@sglty.kawo2.RWTH-Aachen.DE] has quit ["The funniest things in my life are truth and absurdity."] 14:10:58 other guy has switched and now is rich. 14:11:31 whats the problem with lisp? 14:11:44 hot 14:12:05 cemerick [n=la_mer@75.147.38.122] has joined #scheme 14:14:38 -!- annodomini [n=lambda@wikipedia/lambda] has quit [Client Quit] 14:18:47 damg [n=arnie@141.19.145.146] has joined #scheme 14:21:20 does anyone have success with plt-linalg.plt under 4.1 ? 14:21:26 -!- hiyuh [n=hiyuh@ZQ062141.ppp.dion.ne.jp] has quit ["|_ e /\ \/ i |/| G"] 14:22:00 -!- ejs [n=eugen@nat.ironport.com] has quit [Read error: 60 (Operation timed out)] 14:27:16 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Read error: 60 (Operation timed out)] 14:29:36 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 14:39:53 -!- ^self [i=foobar@117.102.13.88] has quit ["home"] 14:40:03 name [n=name@sburn/devel/name] has joined #scheme 14:42:02 ejs [n=eugen@80.91.178.218] has joined #scheme 14:42:44 annodomini [n=lambda@130.189.179.215] has joined #scheme 14:50:42 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [No route to host] 14:50:51 -!- ChanServ has set mode +o chandler 14:51:04 -!- chandler has set mode +b %topo*!*@* 14:51:07 -!- chandler has set mode -o chandler 15:04:21 npe [n=npe@32.97.110.63] has joined #scheme 15:13:27 djjack [n=djjack@cpe-098-026-016-166.nc.res.rr.com] has joined #scheme 15:15:36 -!- ejs [n=eugen@80.91.178.218] has quit [Read error: 110 (Connection timed out)] 15:15:47 hkBst_ [n=hkBst@gentoo/developer/hkbst] has joined #scheme 15:15:52 ejs [n=eugen@nat.ironport.com] has joined #scheme 15:19:53 -!- hkBst [n=hkBst@gentoo/developer/hkbst] has quit [Nick collision from services.] 15:20:13 -!- hkBst_ is now known as hkBst 15:21:18 hiyuh [n=hiyuh@KD125054017176.ppp-bb.dion.ne.jp] has joined #scheme 15:23:56 forcer [n=forcer@e179197056.adsl.alicedsl.de] has joined #scheme 15:32:49 uhm, how can I "merge" two lists together? 15:33:08 like (1 2 3) + (4 5 6) -> (1 2 3 4 5 6) 15:33:16 specbot: R5RS append 15:33:16 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_idx_420 15:33:17 -rudybot:#scheme- http://tinyurl.com/5ccsel 15:33:19 incubot: (append '(1 2 3) '(4 5 6)) 15:33:19 (1 2 3 4 5 6) 15:33:26 ah, append! 15:34:03 thank you, i was looking in SRFI 1 but did't find anything, obviouisly. 15:41:45 Modius [n=Modius@99.179.97.138] has joined #scheme 15:44:18 '(glut:solid-sphere 13.529d0 13 3) is a list, whose first element is a ...label(?) not a procedure. (list glut:solid-sphere 13.529d0 13 3) would be the list I could use in (apply), not what foof said. 15:44:31 Daemmerung [n=goetter@64.146.161.228] has joined #scheme 15:44:47 ? 15:45:15 whooooo.. 15:45:16 I said nothing about a list that could be used by APPLY. 15:45:33 It's just tripped me up before... '(a b c) are the names a b and c, and cannot be turned into procedures. 15:45:51 Or, you can't quote anything to get a procedure that I know of. 15:46:15 just numbers and whatever those inlined strings are called. 15:47:00 Though... there is that `, syntax, which I am entirely too unfamiliar with... 15:48:01 `(,glut:solid-sphere etc etc) 15:48:05 -!- athos_ is now known as athos 15:50:46 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 15:53:41 aleix [n=aleix@46.Red-83-61-3.staticIP.rima-tde.net] has joined #scheme 15:55:29 -!- aleix [n=aleix@46.Red-83-61-3.staticIP.rima-tde.net] has quit [Remote closed the connection] 15:57:27 -!- schmalbe [n=bernhard@p549A3A86.dip0.t-ipconnect.de] has quit [Remote closed the connection] 15:58:20 jeremiah [n=jeremiah@31.Red-213-98-123.staticIP.rima-tde.net] has joined #scheme 16:03:09 -!- Mr_SpOOn [n=Mr_SpOOn@89-97-102-218.ip17.fastwebnet.it] has quit [Read error: 104 (Connection reset by peer)] 16:09:26 -!- damg [n=arnie@141.19.145.146] has quit [Remote closed the connection] 16:11:02 foof, I have pushed a fix to the typo you reported; thanks. 16:14:03 -!- npe [n=npe@32.97.110.63] has quit [Read error: 104 (Connection reset by peer)] 16:16:58 npe [n=npe@32.97.110.63] has joined #scheme 16:19:09 -!- athos [n=philipp@p54B859BC.dip.t-dialin.net] has quit ["Lost terminal"] 16:19:22 jlongster [n=user@75.148.111.133] has joined #scheme 16:26:58 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Connection timed out] 16:27:04 replor [n=replor@ntkngw375028.kngw.nt.ftth.ppp.infoweb.ne.jp] has joined #scheme 16:27:52 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 16:35:12 mfredrickson [n=mfredric@c-98-212-171-158.hsd1.il.comcast.net] has joined #scheme 16:37:51 exexex [n=chatzill@85.102.133.84] has joined #scheme 16:45:47 vasa [n=vasa@mm-152-92-84-93.dynamic.pppoe.mgts.by] has joined #scheme 16:55:52 -!- exexex [n=chatzill@85.102.133.84] has quit ["ChatZilla 0.9.83 [Firefox 3.0.3/2008092414]"] 16:55:57 exexex_ [n=chatzill@85.102.133.84] has joined #scheme 16:55:59 -!- exexex_ is now known as exexex 16:56:31 -!- jonrafkind [n=jon@c-98-202-86-149.hsd1.ut.comcast.net] has quit [Connection timed out] 16:58:18 kniu [n=kniu@DA-YU.RES.CMU.EDU] has joined #scheme 17:02:31 mejja [n=user@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has joined #scheme 17:03:14 mejja: poing 17:04:03 Helloi! 17:04:03 mejja, memo from Riastradh: (ATAN +2i) should yield the right result if you rebuild the microcode, which was decoding the components of recnums in reverse order. 17:05:09 -!- incubot [n=incubot@24.205.65.135] has quit [Read error: 110 (Connection timed out)] 17:08:01 Riastradh: And while we're at it, how about proofreading runtime/arith.scm. 17:08:18 incubot [n=incubot@24.205.65.135] has joined #scheme 17:08:56 -!- exexex [n=chatzill@85.102.133.84] has quit [Remote closed the connection] 17:09:02 I don't have time to scrutinize the whole thing; is something in particular bothering you? 17:09:16 I see REDUCE... Old REDUCE is now called REDUCE-LEFT. 17:09:19 exexex [n=chatzill@85.102.133.84] has joined #scheme 17:14:44 -!- exexex [n=chatzill@85.102.133.84] has quit [Remote closed the connection] 17:15:12 exexex [n=chatzill@85.102.133.84] has joined #scheme 17:16:18 -!- exexex [n=chatzill@85.102.133.84] has quit [Remote closed the connection] 17:16:39 exexex [n=chatzill@85.102.133.84] has joined #scheme 17:19:37 jonrafkind [n=jon@wireless213.wireless.utah.edu] has joined #scheme 17:20:36 mejja, the only uses of REDUCE are with commutative operators. 17:21:25 Anything else that concerns you? 17:23:32 The non existence of a test-suite? 17:23:34 -!- ejs [n=eugen@nat.ironport.com] has quit ["Ex-Chat"] 17:23:41 Feel free! 17:25:53 -!- proq [n=user@unaffiliated/proqesi] has quit [Remote closed the connection] 17:25:56 Modius_ [n=Modius@adsl-68-92-149-0.dsl.austtx.swbell.net] has joined #scheme 17:26:06 proq [n=user@unaffiliated/proqesi] has joined #scheme 17:26:35 *Riastradh* vanishes. 17:28:37 -!- exexex [n=chatzill@85.102.133.84] has quit [Remote closed the connection] 17:28:56 exexex [n=chatzill@85.102.133.84] has joined #scheme 17:29:42 Nshag [i=user@Mix-Orleans-106-2-156.w193-248.abo.wanadoo.fr] has joined #scheme 17:32:23 -!- Modius [n=Modius@99.179.97.138] has quit [Connection timed out] 17:32:50 -!- synx [i=synx@gateway/gpg-tor/key-0xA71B0C6A] has quit [Remote closed the connection] 17:33:17 -!- hkBst [n=hkBst@gentoo/developer/hkbst] has quit [Remote closed the connection] 17:33:49 hkBst [n=hkBst@gentoo/developer/hkbst] has joined #scheme 17:33:52 synx [i=synx@gateway/gpg-tor/key-0xA71B0C6A] has joined #scheme 17:35:41 -!- hkBst [n=hkBst@gentoo/developer/hkbst] has quit [Remote closed the connection] 17:36:03 hkBst [n=hkBst@gentoo/developer/hkbst] has joined #scheme 17:40:35 Modius [n=Modius@adsl-68-91-192-191.dsl.austtx.swbell.net] has joined #scheme 17:43:52 MichaelRaskin_ [n=raskin@gwh-1-177-mytn23k1.ln.rinet.ru] has joined #scheme 17:44:47 (hint: this is homework) anyone has a clue what they mean by "implement the minus operation without using the build in minus) ? 17:44:56 amd i supposed to build a scheme library? 17:46:20 aep, what operation is the opposite of subtraction? 17:46:37 i'm supposed to use +? thought about it, but this is quite inefficient 17:47:13 Dude, it's homework. 17:47:17 -!- attila_lendvai [n=ati@catv-89-133-170-239.catv.broadband.hu] has quit [Read error: 110 (Connection timed out)] 17:47:20 lol 17:47:26 I'd write two versions.. 17:47:31 You're not writing tight inner loops inside mission-critical financial applications. 17:47:39 x + (-1 * y) 17:47:44 And addition in loop 17:48:05 aep: Church numerals 17:48:26 gnomon: I am not sure you are supposed to optimise too much (as in optimisation over stability) in mission-critical financial application.. 17:48:54 its werid 17:49:09 Modius__ [n=Modius@ppp-70-243-81-131.dsl.austtx.swbell.net] has joined #scheme 17:49:17 its hard to imagine they teach students to implement a minus operation using a loop over plus 17:49:38 They teach students Scheme syntax 17:49:40 but thy aparantly do. it even says "assume a>b" 17:49:43 so its obvious 17:50:01 if you're using church numerals, you could do that 17:50:06 x + (-1 * y) still can be used as a first attempt to preserve sanity 17:50:11 what are church numerals? 17:50:23 Wikipedia is your friend! 17:50:28 right 17:50:29 So is Alonzo Church, but you'll meet him later. 17:50:40 MichaelRaskin_: thats actuall pretty cool 17:50:52 MichaelRaskin_: i wish it wasmy idea :D 17:50:59 Seriously, though, I'm not trying to be dismissive. You'll get more out of a careful reading of the article than you will from an interactive discussion on IRC. 17:51:11 Unless you're one of those Ritalin-addled protonerds I keep hearing about. 17:51:13 hich article? 17:51:22 *which 17:51:24 The article about Church Numerals. 17:51:26 Wikipedia on Church Numerals 17:51:28 the Church Numerals one 17:51:32 church numerals are awesome 17:51:32 ah! yes sure. i was about to do it 17:52:05 aep: don't skip class next time ;P 17:52:08 i didnt 17:52:24 Suuuuuuuuure you didn't. 17:52:35 -!- Modius_ [n=Modius@adsl-68-92-149-0.dsl.austtx.swbell.net] has quit [Read error: 110 (Connection timed out)] 17:52:40 *gnomon* has pictures of aep making out with a TA in the student lounge 17:52:45 Pics don't lie. 17:52:49 oO 17:53:01 you meany 17:53:02 :P 17:53:14 gnomon: you really believe they teach Church numerals before students have any chance to understand FP ? 17:53:16 Modius_ [n=Modius@adsl-67-67-223-15.dsl.austtx.swbell.net] has joined #scheme 17:53:35 FP? 17:54:09 Functional programming. 17:54:13 oh i think we had something like chruch numerals in the theoretical part. 17:54:26 recursive defintion on natural numbers 17:54:43 MichaelRaskin, sure. Why not? I learned about Church Numerals in high school. 17:55:45 saccade_ [n=saccade@30-7-110.wireless.csail.mit.edu] has joined #scheme 17:56:01 unfortunatly i dont understand what the lambda and that = thingy mean in the notation :( 17:56:13 gnomon: I was taught my first pure functional language in 9 form (default age: 14 years) 17:56:50 MichaelRaskin, sounds about the same age. 17:57:10 aep, lambda will come with time. You don't understand what the equals sign does, though..? 17:57:24 its euqal with 3 lines 17:57:26 I was 13. 17:57:38 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Connection timed out] 17:57:40 So practical FP should be before CN. 17:57:56 -!- Modius_ [n=Modius@adsl-67-67-223-15.dsl.austtx.swbell.net] has quit [Read error: 104 (Connection reset by peer)] 17:57:57 *gnomon* shrugs 17:58:03 -!- saccade_ [n=saccade@30-7-110.wireless.csail.mit.edu] has quit [Client Quit] 17:58:21 Modius_ [n=Modius@adsl-67-67-223-15.dsl.austtx.swbell.net] has joined #scheme 17:58:56 aep: you mean the three horizontal line symbol? 17:59:03 yes 17:59:48 and yeah i know theoreticaly about these church numbers, but i have no clue how to actually apply that to scheme 17:59:49 aep: well in this case I would read it as "is represented by", but physicists use it for "defines" 17:59:56 we only leanred how to use it on sets 18:00:05 ah thanks 18:00:34 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 18:00:39 *hkBst* should fix that 18:01:12 besides i dont even know ho it applys to algebra 18:01:16 since sets arent numbers 18:01:32 they just told us "numbers are represented by a set. fini" 18:01:54 i was like "yeah but my computer doesnt understand sets..." 18:02:44 aep: well sets can be represented by strings...QED 18:02:50 no i dont think i understand 18:03:10 sure, but that doesnt help me implement algebra calculations :P 18:04:06 aep: well actually the `pred' is defined in the article 18:04:30 *aep* tryes reading again carefully 18:05:08 oh crud. i was reading the german article, which is inferiour :P 18:05:48 -!- Modius_ [n=Modius@adsl-67-67-223-15.dsl.austtx.swbell.net] has quit [Operation timed out] 18:06:03 -!- Modius [n=Modius@adsl-68-91-192-191.dsl.austtx.swbell.net] has quit [Success] 18:06:09 *aep* brainfails 18:07:29 kilimanjaro [n=kilimanj@70.116.95.163] has joined #scheme 18:08:39 i think i didnt understand a word 18:08:48 hadronzoo [n=hadronzo@ppp-70-251-241-233.dsl.rcsntx.swbell.net] has joined #scheme 18:08:54 maybe i shouldnt read that after 2 weeks studiing 18:09:06 *aep* resorts to the easy solution 18:09:31 *hkBst* resorts to dinner 18:10:17 -!- Modius__ [n=Modius@ppp-70-243-81-131.dsl.austtx.swbell.net] has quit [Connection timed out] 18:11:08 -!- samth [n=samth@punge.ccs.neu.edu] has quit ["Ex-Chat"] 18:11:45 scheme does always copy by reference does it? 18:20:45 is there a cooler solution to do loops then a define and then call that function by name? 18:24:06 bcow pasted "if problem" at http://paste.lisp.org/display/70230 18:24:37 whats wrong with that if statment, i just want to return the car of that list then set it to its cdr 18:24:44 aep: named let 18:24:52 specbot: r5rs let 18:24:52 thanks. 18:24:52 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-7.html#%_idx_124 18:24:53 -rudybot:#scheme- http://tinyurl.com/695ay7 18:25:38 bcow! you have too many braces again 18:25:51 you cannot use them like that for grouping 18:26:30 :/ 18:26:41 aquanaut [n=user@pool-71-191-49-201.washdc.fios.verizon.net] has joined #scheme 18:28:08 whats the syntax to return the first item on a list and modify it then 18:30:33 bcow: what exactly do you want to do? 18:31:04 (let ((t (car x))) (set! x (cdr x)) t) 18:33:09 -!- mejja [n=user@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has quit [Read error: 104 (Connection reset by peer)] 18:35:07 -!- bombshelter13 [n=bombshel@net1.senecac.on.ca] has quit [Read error: 148 (No route to host)] 18:35:39 geckosenator [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has joined #scheme 18:36:30 orgy` [n=ratm_@pD9FFE916.dip.t-dialin.net] has joined #scheme 18:37:35 ventonegro: hum. how would i call the block itself inside the block then? 18:37:37 if not by name 18:38:44 currently i have (define stuff ( (if(expr) (stuff ) ) )) 18:38:47 bcow pasted "sdfsdf" at http://paste.lisp.org/display/70232 18:38:49 err + lambda 18:39:13 too many braces! 18:39:22 aep: (let loop ((i 0)) (let ((a 1)) (loop (+ i a)))) 18:39:43 ah a _named_ let 18:39:47 sorry didnt listen carefully 18:39:48 thanks 18:40:00 aep: np 18:40:49 hi, is there a built-in function to find out the type of an object? 18:41:03 bcow: ytour braces are wrong still 18:41:08 leppie if i remove the braces around the let i still get the error saying pstck is null, but if i just put (car pstck) it works 18:41:27 you need a brace before if 18:43:27 THIS is cool 18:43:31 :> 18:43:35 bcow pasted "error" at http://paste.lisp.org/display/70233 18:43:42 orgy`: nope 18:44:06 i've tried like every possible combination of braces, it always gives that error 18:44:27 its correct 18:44:40 no wait 18:45:22 it looks right 18:45:39 *bcow* bangs head on desk 18:46:17 bcow: maybe if you gave it a proper indentation you could see the problem 18:46:22 you get that when calling popp? 18:47:02 yes 18:47:20 i just pasted the code in a REPL and it works 18:47:25 no error here 18:47:50 so i have a hash table that maps item -> list of tags and i need to effieciently calculate all the items that match a boolean expression like (and 'x (or 'y 'z)) 18:47:52 i'm using drscheme 18:48:19 benny [n=benny@i577A060D.versanet.de] has joined #scheme 18:48:28 ok, maybe use (unless (null? pstck) ...) instead 18:48:32 err did you populate the pstck list before you called popp ? 18:48:49 it will work if pstck is null 18:48:50 (define pstck '(foo)) 18:49:06 (popp) => foo 18:51:06 elias` [n=me@unaffiliated/elias/x-342423] has joined #scheme 18:51:54 gigabytes [n=gigabyte@79.0.236.225] has joined #scheme 18:53:06 bcow pasted "error " at http://paste.lisp.org/display/70235 18:53:27 thats exactly what i have, and the 2 lines i use to test it 18:53:32 -!- ramkrsna_ [n=ramkrsna@nat/redhat-in/x-8b5b83b15d7f5d38] has quit ["Leaving"] 18:54:47 thanks ventonegro 18:55:44 elibarzilay [n=eli@m3b5e36d0.tmodns.net] has joined #scheme 18:56:41 bcow: too many nested parens, again. This is not C. 18:57:00 Look at your definition of popp. 18:57:41 what's with the horrible style? 18:57:57 -!- eli [n=eli@winooski.ccs.neu.edu] has quit [Remote closed the connection] 18:58:12 Based on the mistakes you're making AND how they're not related to the errors you're seeing, I am guess that you're not running the code that you're writing. 18:58:39 well you guessed wrong 18:58:55 and i've tried removing/adding parens i get the same error 18:59:39 Don't remove/add parens! (a) is not the same as ((a)). 19:00:04 well depends what a is 19:00:39 eli [n=eli@winooski.ccs.neu.edu] has joined #scheme 19:00:39 geckosenator: really? which "a" would make this true? 19:00:40 (define (a) a) 19:00:53 that is only one example 19:01:19 geckosenator: don't confuse the issue. 19:01:23 geckosenator: you're right, of course :-) 19:01:27 heh 19:01:28 Daemmerung well you just said i had to many nested parens, so that imlies i should remove some ? 19:01:54 s/ to / too / 19:01:55 bcow: that implies you should understand Scheme evaluation rules 19:02:27 is gnomon a bot? 19:02:51 ventonegro so you know whats wrong with the code i pasted ? 19:02:57 bcow: When I run your code, I get an error, but it is not the error that you report. Hence my suspicion that you're not running the code that you're writing. 19:02:58 Tell me more about is gnomon a bot? 19:03:04 gnomon: chant 19:03:12 MORE PASTED 19:03:34 Daemmerung i dunno i ran exactly what i pasted in drsheme a million times 19:03:38 -!- elibarzilay [n=eli@m3b5e36d0.tmodns.net] has quit ["jmIrc destroyed by the OS"] 19:03:39 and pasted the error it gives me 19:03:42 *geckosenator* still isn't sure 19:04:07 elibarzilay [n=eli@m3b5e36d0.tmodns.net] has joined #scheme 19:05:07 -!- elibarzilay [n=eli@m3b5e36d0.tmodns.net] has quit [Client Quit] 19:05:23 -!- orgy` [n=ratm_@pD9FFE916.dip.t-dialin.net] has quit [Remote closed the connection] 19:05:33 bcow: What version of DrScheme? Which language level? 19:06:16 4.1.2, lazy scheme 19:06:24 Lazy scheme? Why? 19:06:43 Is that mandated by the assignment? That changes a whole lot of things. It is not Scheme. 19:06:55 maybe he felt most suited to that :) 19:06:56 i dunno it was the only language that had "scheme" in its name 19:07:03 *Daemmerung* facepalms 19:07:11 Change your language to R5RS and start over. 19:07:18 not even that 19:07:25 the most beginner level possible 19:07:37 lazy scheme is way different 19:07:52 ventonegro: Depends on what their assignment expects. The beginner levels are only for use with HtDP. 19:07:54 -!- renke_ is now known as renke 19:09:20 R5RS2 19:09:56 for when you are too lazy to say R5RS scheme... heh ;) 19:10:04 -!- elias` [n=me@unaffiliated/elias/x-342423] has quit [Read error: 145 (Connection timed out)] 19:10:07 oh wow r5rs2 has a stepper and error highlighting 19:10:17 cracki [n=cracki@sglty.kawo2.RWTH-Aachen.DE] has joined #scheme 19:10:42 Yeah. It helps to see where your code goes boom, doesn't it? 19:11:06 wow lazy scheme is lazy isnt it, no stepper :p 19:11:12 Mr_SpOOn [n=Mr_SpOOn@89-97-102-218.ip17.fastwebnet.it] has joined #scheme 19:11:38 heh 19:11:51 *ventonegro* sees the lightbulb turning on over bcow's head 19:13:02 *Now* things should start making sense! 19:14:28 sweet now it works, and everything makes alot more sense, thanks guys :X 19:14:41 jgracin [n=jgracin@82.193.208.195] has joined #scheme 19:14:51 I'm sorry you wasted all that time in Lazy Scheme. Ugh. 19:14:58 simonw123 [n=Simon@81.3.111.153] has joined #scheme 19:15:56 -!- simonw123 [n=Simon@81.3.111.153] has quit [SendQ exceeded] 19:16:03 -!- gigabytes [n=gigabyte@79.0.236.225] has quit [] 19:16:33 simonw123 [n=Simon@81.3.111.153] has joined #scheme 19:19:45 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Connection timed out] 19:23:58 jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has joined #scheme 19:27:36 -!- jlongster [n=user@75.148.111.133] has quit [Read error: 113 (No route to host)] 19:28:23 -!- borism [n=boris@195-50-200-2-dsl.krw.estpak.ee] has quit [Read error: 145 (Connection timed out)] 19:28:51 orgy` [n=ratm_@pD9FFE916.dip.t-dialin.net] has joined #scheme 19:28:52 error_developer_ [n=errordev@78-86-1-110.zone2.bethere.co.uk] has joined #scheme 19:29:08 -!- exexex [n=chatzill@85.102.133.84] has quit [Read error: 104 (Connection reset by peer)] 19:29:46 jlongster [n=user@75.148.111.133] has joined #scheme 19:30:45 exexex [n=chatzill@85.102.133.84] has joined #scheme 19:34:57 melito [n=melito@70.99.250.82] has joined #scheme 19:36:13 -!- kniu [n=kniu@DA-YU.RES.CMU.EDU] has quit [Connection timed out] 19:36:48 kniu [n=kniu@CMU-301252.WV.CC.CMU.EDU] has joined #scheme 19:40:24 hotblack23 [n=jh@p5B0578E5.dip.t-dialin.net] has joined #scheme 19:42:45 -!- errordeveloper [n=errordev@78-86-1-110.zone2.bethere.co.uk] has quit [Connection timed out] 19:47:06 -!- jonrafkind [n=jon@wireless213.wireless.utah.edu] has quit [Connection timed out] 19:55:43 gigabytes [n=gigabyte@host203-239-dynamic.2-87-r.retail.telecomitalia.it] has joined #scheme 20:02:28 -!- rpaddock [n=rpaddock@69.43.128.68] has quit [] 20:25:28 jonrafkind [n=jon@wireless415.wireless.utah.edu] has joined #scheme 20:34:53 -!- kniu [n=kniu@CMU-301252.WV.CC.CMU.EDU] has quit [Read error: 110 (Connection timed out)] 20:37:20 puchacz [n=puchacz@87-194-5-99.bethere.co.uk] has joined #scheme 20:37:27 -!- renke [n=renke@Lf473.l.pppool.de] has quit ["Lost terminal"] 20:38:10 -!- tessier [n=treed@kernel-panic/sex-machines] has quit [Connection timed out] 20:39:01 saccade_ [n=saccade@dhcp-18-188-68-12.dyn.mit.edu] has joined #scheme 20:40:47 -!- jgracin [n=jgracin@82.193.208.195] has quit [Remote closed the connection] 20:51:57 -!- saccade_ [n=saccade@dhcp-18-188-68-12.dyn.mit.edu] has quit ["This computer has gone to sleep"] 20:54:12 -!- exexex [n=chatzill@85.102.133.84] has quit [Read error: 110 (Connection timed out)] 20:59:59 -!- geckosenator [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has quit [Read error: 60 (Operation timed out)] 21:01:11 kniu [n=kniu@DA-YU.RES.CMU.EDU] has joined #scheme 21:01:41 geckosenator [n=sean@c-24-8-193-190.hsd1.co.comcast.net] has joined #scheme 21:04:24 -!- kniu [n=kniu@DA-YU.RES.CMU.EDU] has quit [Remote closed the connection] 21:04:41 -!- ventonegro [n=user@136.166.1.3] has left #scheme 21:04:42 kniu [n=kniu@DA-YU.RES.CMU.EDU] has joined #scheme 21:05:11 ventonegro [n=user@136.166.1.3] has joined #scheme 21:05:27 -!- elmex [n=elmex@e180064214.adsl.alicedsl.de] has quit [Remote closed the connection] 21:15:47 -!- replor [n=replor@ntkngw375028.kngw.nt.ftth.ppp.infoweb.ne.jp] has quit [Read error: 113 (No route to host)] 21:18:40 -!- name [n=name@sburn/devel/name] has quit ["Lost terminal"] 21:20:50 name [n=name@sburn/devel/name] has joined #scheme 21:20:51 -!- name [n=name@sburn/devel/name] has quit [Client Quit] 21:21:09 name [n=name@sburn/devel/name] has joined #scheme 21:27:14 -!- hkBst [n=hkBst@gentoo/developer/hkbst] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- proq [n=user@unaffiliated/proqesi] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- incubot [n=incubot@24.205.65.135] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- Daemmerung [n=goetter@64.146.161.228] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- annodomini [n=lambda@wikipedia/lambda] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- fschwidom [n=fschwido@dslb-084-059-136-162.pools.arcor-ip.net] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- bpt [n=bpt@cpe-071-070-209-067.nc.res.rr.com] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- wastrel [n=wastrel@nylug/member/wastrel] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- cpfr [n=cf@cpe-76-171-165-212.socal.res.rr.com] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- araujo [n=araujo@gentoo/developer/araujo] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- pjdelport [n=pjd@ampere.divmod.com] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- zbigniew [n=zb@3e8.org] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- heat [i=dima@66.160.171.42] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- bunz [n=bunz@unaffiliated/bunz] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- kalven [i=calvin@brutaldeluxe.com] has quit [calvino.freenode.net irc.freenode.net] 21:27:14 -!- tizoc [n=user@r190-135-9-107.dialup.adsl.anteldata.net.uy] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- sladegen [n=nemo@unaffiliated/sladegen] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- pchrist [n=spirit@gentoo/developer/pchrist] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- leppie [n=lolcow@196-210-146-254-ndn-esr-3.dynamic.isadsl.co.za] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- Adrinael [i=adrinael@rid7.kyla.fi] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- Leonidas [n=Leonidas@unaffiliated/leonidas] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- dlouhy [n=jdlouhy@pinball.ccs.neu.edu] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- agemo [n=jovdmeer@igwe16.vub.ac.be] has quit [calvino.freenode.net irc.freenode.net] 21:27:19 -!- Riastradh [n=rias@pool-141-154-225-78.bos.east.verizon.net] has quit [calvino.freenode.net irc.freenode.net] 21:27:20 vorpal [n=rhunter@ip24-255-31-98.tc.ph.cox.net] has joined #scheme 21:27:27 Riastradh [n=rias@pool-141-154-225-78.bos.east.verizon.net] has joined #scheme 21:28:12 -!- vorpal [n=rhunter@ip24-255-31-98.tc.ph.cox.net] has quit [Client Quit] 21:29:01 vorpal [n=rhunter@ip24-255-31-98.tc.ph.cox.net] has joined #scheme 21:32:02 -!- vorpal [n=rhunter@ip24-255-31-98.tc.ph.cox.net] has quit [Client Quit] 21:32:22 whats the easiest way to get length (# of items) in a list ? 21:32:30 Use the LENGTH procedure. 21:32:31 r5rs length 21:32:32 http://www.schemers.org/Documents/Standards/R5RS/HTML/r5rs-Z-H-9.html#%_idx_418 21:32:33 -rudybot:#scheme- http://tinyurl.com/5ll3t4 21:32:53 ty 21:35:02 annodomini [n=lambda@130.189.179.215] has joined #scheme 21:37:06 elias` [n=me@cs78208074.pp.htv.fi] has joined #scheme 21:39:01 -!- benny [n=benny@i577A060D.versanet.de] has quit [Read error: 104 (Connection reset by peer)] 21:39:38 Daemmerung [n=goetter@64.146.161.228] has joined #scheme 21:40:02 -!- dfeuer [n=dfeuer@wikimedia/Dfeuer] has quit [Read error: 110 (Connection timed out)] 21:40:54 dfeuer [n=dfeuer@pool-71-191-70-185.washdc.fios.verizon.net] has joined #scheme 21:45:59 hkBst [n=hkBst@gentoo/developer/hkbst] has joined #scheme 21:45:59 proq [n=user@unaffiliated/proqesi] has joined #scheme 21:45:59 incubot [n=incubot@24.205.65.135] has joined #scheme 21:45:59 fschwidom [n=fschwido@dslb-084-059-136-162.pools.arcor-ip.net] has joined #scheme 21:45:59 bpt [n=bpt@cpe-071-070-209-067.nc.res.rr.com] has joined #scheme 21:45:59 wastrel [n=wastrel@nylug/member/wastrel] has joined #scheme 21:45:59 cpfr [n=cf@cpe-76-171-165-212.socal.res.rr.com] has joined #scheme 21:45:59 araujo [n=araujo@gentoo/developer/araujo] has joined #scheme 21:45:59 pjdelport [n=pjd@ampere.divmod.com] has joined #scheme 21:45:59 zbigniew [n=zb@3e8.org] has joined #scheme 21:45:59 bunz [n=bunz@unaffiliated/bunz] has joined #scheme 21:45:59 kalven [i=calvin@brutaldeluxe.com] has joined #scheme 21:45:59 heat [i=dima@66.160.171.42] has joined #scheme 21:47:53 tizoc [n=user@r190-135-9-107.dialup.adsl.anteldata.net.uy] has joined #scheme 21:47:53 sladegen [n=nemo@unaffiliated/sladegen] has joined #scheme 21:47:53 pchrist [n=spirit@gentoo/developer/pchrist] has joined #scheme 21:47:53 leppie [n=lolcow@196-210-146-254-ndn-esr-3.dynamic.isadsl.co.za] has joined #scheme 21:47:53 Adrinael [i=adrinael@rid7.kyla.fi] has joined #scheme 21:47:53 Leonidas [n=Leonidas@unaffiliated/leonidas] has joined #scheme 21:47:53 agemo [n=jovdmeer@igwe16.vub.ac.be] has joined #scheme 21:47:53 dlouhy [n=jdlouhy@pinball.ccs.neu.edu] has joined #scheme 21:53:27 -!- cemerick [n=la_mer@75.147.38.122] has quit [] 22:02:22 exexex [n=chatzill@85.97.124.6] has joined #scheme 22:13:07 -!- gigabytes [n=gigabyte@host203-239-dynamic.2-87-r.retail.telecomitalia.it] has quit [] 22:20:07 a1len [n=James@unaffiliated/a1len] has joined #scheme 22:23:29 vorpal [n=rhunter@pdpc/supporter/student/vorpal] has joined #scheme 22:35:37 is there a writeline function or something similar ? 22:35:57 write with a carriage return dosen't seem to work in drscheme 22:38:55 (define (writeline message) (begin (write message) (newline))) 22:39:23 (the BEGIN isn't strictly required, since there is an implicit BEGIN inside DEFINE; you may wish to elide it) 22:39:28 -!- vasa [n=vasa@mm-152-92-84-93.dynamic.pppoe.mgts.by] has quit ["I am not vasya, i am vasa"] 22:40:10 -!- puchacz [n=puchacz@87-194-5-99.bethere.co.uk] has quit [Read error: 104 (Connection reset by peer)] 22:41:13 -!- annodomini [n=lambda@wikipedia/lambda] has quit [] 22:42:38 -!- exexex [n=chatzill@85.97.124.6] has quit [Remote closed the connection] 22:44:08 I usually use (define (display-with-newline msg) (display msg) (newline)) 22:44:35 but it depends on if you really want WRITE or DISPLAY 22:45:27 automejja [n=edwin@c-4db6e555.023-82-73746f38.cust.bredbandsbolaget.se] has joined #scheme 22:47:05 mib_v2gf3c48 [i=43c78706@gateway/web/ajax/mibbit.com/x-1400e83c6d7cd100] has joined #scheme 22:49:09 (define (and-then-newline proc msg) (proc msg) (newline)) 22:51:37 -!- jewel [n=jewel@dsl-242-177-125.telkomadsl.co.za] has quit [Read error: 113 (No route to host)] 22:55:44 thx 22:56:53 synthasee [n=synthase@68.63.20.12] has joined #scheme 22:57:08 -!- synthasee [n=synthase@68.63.20.12] has quit [Remote closed the connection] 22:57:20 synthasee [n=synthase@68.63.20.12] has joined #scheme 22:57:20 -!- simonw123 [n=Simon@81.3.111.153] has quit [Read error: 104 (Connection reset by peer)] 22:57:26 -!- mib_v2gf3c48 [i=43c78706@gateway/web/ajax/mibbit.com/x-1400e83c6d7cd100] has left #scheme 23:00:32 -!- hotblack23 [n=jh@p5B0578E5.dip.t-dialin.net] has quit [Read error: 110 (Connection timed out)] 23:03:23 kib2_ [n=kib@bd137-1-82-228-159-28.fbx.proxad.net] has joined #scheme 23:04:01 jdijk [n=jerry@ftth-212-84-159-210.solcon.nl] has joined #scheme 23:04:15 -!- kib2 [n=kib@bd137-1-82-228-159-28.fbx.proxad.net] has quit [Success] 23:04:26 -!- jdijk [n=jerry@ftth-212-84-159-210.solcon.nl] has left #scheme 23:11:05 jdijk [n=jerry@ftth-212-84-159-210.solcon.nl] has joined #scheme 23:11:27 -!- hadronzoo [n=hadronzo@ppp-70-251-241-233.dsl.rcsntx.swbell.net] has quit [] 23:11:34 -!- jdijk [n=jerry@ftth-212-84-159-210.solcon.nl] has quit [Client Quit] 23:15:05 -!- name [n=name@sburn/devel/name] has quit ["Lost terminal"] 23:22:40 -!- ventonegro [n=user@136.166.1.3] has quit ["ERC Version 5.2 (IRC client for Emacs)"] 23:24:44 -!- hiyuh [n=hiyuh@KD125054017176.ppp-bb.dion.ne.jp] has quit ["|_ e /\ \/ i |/| G"] 23:26:06 annodomini [n=lambda@c-75-69-96-104.hsd1.nh.comcast.net] has joined #scheme 23:30:25 Dawgmatix [n=deep@207-237-30-94.c3-0.avec-ubr11.nyr-avec.ny.cable.rcn.com] has joined #scheme 23:30:47 any bigloo users in here today ? :) 23:37:31 -!- npe [n=npe@32.97.110.63] has quit [Read error: 60 (Operation timed out)] 23:38:08 Dawgmatix: occasionally 23:38:31 -!- kib2_ [n=kib@bd137-1-82-228-159-28.fbx.proxad.net] has quit ["Quitte"] 23:39:30 are you one ? 23:39:39 have an ffi question. 23:40:14 -!- orgy` [n=ratm_@pD9FFE916.dip.t-dialin.net] has quit [Remote closed the connection] 23:40:33 -!- jlongster [n=user@75.148.111.133] has quit [Read error: 60 (Operation timed out)] 23:50:19 _Thoth_ [n=thoth@217.217.133.45.dyn.user.ono.com] has joined #scheme 23:55:01 gweiqi [n=greg@69.120.126.163] has joined #scheme 23:56:01 -!- Mr_SpOOn [n=Mr_SpOOn@89-97-102-218.ip17.fastwebnet.it] has quit [Read error: 110 (Connection timed out)] 23:57:27 raikov [n=igr@203.181.243.11] has joined #scheme