freenode/#lisp - IRC Chatlog
Search
22:46:56
aeth
Of course, you would have to override the accessors and constructor on an implementation-specific basis to get the desired behavior, inserting check-type's and the's where needed
22:47:36
aeth
You'd also probably want to write a typed-list as well as some list related operations, such as do-typed-list
22:48:58
aeth
I'm probably going to use a variation of that in one of my programs because it turns O(n) type checking into O(1), and there isn't much more than type checking done to items of the list.
22:52:46
aeth
The accessors are wrong, too. Atm they're fixnum-cons-fixnum-car, but that's just a simple (:conc-name nil)
23:20:51
rpg
phoe: I think so. On my way out of the office right now. I'll try to remember to do that when I get home.
23:21:59
phoe
minion: memo for rpg: could you submit an issue with a proposal for making that function generic?
0:11:52
minion
rpg, memo from phoe: could you submit an issue with a proposal for making that function generic?
2:03:13
slyrus1
I'm still thinking about this closure-common rune thing and trying to figure out a good approach.
2:03:43
slyrus1
The problem is that the assumptions about rods/runes don't seem to be (always) true in current SBCL.
5:09:05
White_Flame
is there any name or notion for currying that can happen in any order? it always seems difficult to me to use currying, because it's not guaranteed which of the parameters I'd want to predefine
5:35:29
theemacsshibe[m]
ACTION sent a long message: theemacsshibe[m]_2018-04-13_05:35:29.txt <https://matrix.org/_matrix/media/v1/download/matrix.org/tbWgwDVOXjtwtfcslaGQxbDS>
5:42:01
White_Flame
I mean, given (lambda (a b c) ..), maybe you want to set b first, then c, then a, or whatever, as separate steps
5:42:23
White_Flame
but yeah, if you (lambda (b c a) (funcall thing a b c)), then you can curry the outer per ordering you want I guess
5:43:26
phoe
because then a programmer will know that the order in which you bind these variables matters
5:43:54
White_Flame
"setting" as in holding on to a partially applied function, except choosing which parameter to apply first
6:13:21
johnnymacs
So what confuses me about lambda calculus is that everything in the program is stored inside of a single function all of the time
6:14:01
johnnymacs
So if the current function is a list it can't really do anything else to be a list
6:14:18
johnnymacs
I need some combinators that will help me actually store multiple things at once and reference them
10:11:07
jcowan_
Eventually syntax extension was done by extending DWIM so that it would rewrite the new syntax into the old