[ a / b / art / cy / lain / alt / o ] [ wired / meta ] [ home / information / affiliates / updates ] [ mebious ]

/cy/ - Cyberpunk

Cyberpunk & Technology
Password (For file deletion.)

File: 1581460038602.png (503.48 KB, 934x1000, daily_programming.png)

 No.1220[Last 50 Posts]

What are you working on, /g/?


I'm really sorry about textboard.org but Bitdiddle said the stress tests were badly needed and kept encouraging me. I hope it's back up soon.


File: 1582269064422.jpg (160.42 KB, 800x998, marika_kato__bodacious_spa….jpg)

It seems to have returned from death.

Why are you testing in production?


File: 1582283674971.jpeg (168.42 KB, 1000x1358, 4798701.jpeg)

>Why are you testing in production?
Setting up a local copy is such a hassle and Bitdiddle said:

>Don't worry about that. I'm sincerely grateful you found that severe bug, took the time to read the code and offered a way to fix the issue

>We badly need those. Now is the time.

>Thank you again for discovering that awful bug. I believe your stress tests will hit the nginx cache, so they should be safe.


File: 1583269287742.png (1.42 MB, 900x1200, 1567550669432.png)

I am trying to change a pretty fundamental type in a functional program, as the current one turned out to be inadequate… Hopefully I won't end up having to rewrite the whole thing. How do functional programmers deal with cases like this? Just get it right before beginning?


File: 1583344027901.jpg (38.38 KB, 249x332, capable.jpg)

Looks like I managed to avoid the situation. Though I am still curious how people deal with situations like that.


Currently implementing truth tables for propositional logic in Python. I am aiming to make it general enough so that I can represent every possible table (not just AND, XOR and the usual) with any number of truth-values.

Fun fact: if you have V truth values, then the number of possible truth tables for a binary connective (a truth table with two inputs, basically) is: V ^ (V ^ 2).

This number gets very big very quickly:
V - V ^ (V ^ 2)
1 - 1
2 - 16
3 - 19683
4 - 4294967296 (4.3 billion)
5 - 298023223876953125 (298 quadrillion)


>with any number of truth-values
What are you going to use for not(not(x))?


File: 1586901531346.jpg (7.52 KB, 183x275, Curious Miku.jpg)

What exactly were you trying to do?


Aha. My impression is that NOT(NOT(p)) has the same truth value as p in most many-valued logics, especially those with a finite number of truth values. The Wikipedia article will give some examples:

The program I'm writing won't be able to handle intuitionistic logic, where NOT(NOT(p)) =/= p, because intuitionistic logic does not use truth tables. At least, it doesn't use finite ones.


File: 1586975322394.jpg (733.39 KB, 1000x1300, 7cabe45a4f8164a082f778b9b5….jpg)

It was an interpreter-like program where certain escape sequences were handled on the parsing side, but I needed to preserve them for later use. I ended up encoding them in the AST using already existing constructs but it's ugly and the proper way would be to change the AST. I know that the whole thing sounds horrible but believe me, it is actually much worse.


File: 1589832842137.png (2.01 MB, 620x850, Generaltan.png)

I am giving Coq another go, this time using Programs and Proofs: https://ilyasergey.net/pnp/

I expect to lose track of what is going on somewhere around the middle of the third chapter.


You forgot to add TypeScript.


What do you mean? If this is a joke, I don't get it.


It is. You'll get it when you're older.


File: 1590733791715.jpg (1006.46 KB, 1214x1805, 5389b33aa21c88bc7304f934cc….jpg)

As expected, it was progressing a bit too fast for me. Before continuing on to chapter 4, I am reading this tutorial: https://mdnahas.github.io/doc/nahas_tutorial

I like that it uses only the most basic parts of Coq and explains them in terms of the Curry-Howard correspondence. It makes me want to write my own proof assistant!


File: 1591127549558.jpg (311.75 KB, 2400x3200, 59f557afe19fe20741c3e75c9c….jpg)

Is there a better way to repeatedly destruct a hypothesis so that it can be handled in one go like here?

Goal forall n, n = 0 \/ n = 1 \/ n = 2 \/ n = 3 -> n - 3 = 0.
intros n Cs.
destruct Cs as [C|Cs]; try destruct Cs as [C|Cs]; try destruct Cs as [C|C];
rewrite C;

I guess "repeat" would kind of work, except for the last one where the naming wouldn't match.


File: 1591988277700.png (337.88 KB, 792x720, 1450102382233.png)

I am really glad I started reading this, Coq is lots of fun.


File: 1593463036175.jpg (614.33 KB, 1200x1680, 44ac5083e0a37d3fede1a06570….jpg)

I finished this. I liked it a lot, although the last chapter maybe progressed a bit too quickly, I ended skipping most of the exercises there. Maybe I will return to it someday.

Should I continue with Software Foundations or should I try The Little Prover before it?


File: 1593682205757.jpg (4.25 MB, 2254x3200, badgateway.jpg)

Can anyone post on textboard.org? I have a bug report and fix to post and I keep getting 502.


File: 1593703931946.jpg (1.4 MB, 1103x1826, 15e8f3fbb248eb1faf2bec4f47….jpg)

I get 502 too… maybe you could post here instead? What are you working on, textboard engineering?


File: 1593720787662.jpg (4.14 MB, 2244x3706, image.jpg)

OK, it's back up.

>What are you working on, textboard engineering?
Nothing so lofty. I'm just contributing in my small way to the SchemeBBS community by providing bugfixes.


File: 1594070761376-0.jpg (163.12 KB, 661x920, 1588027855042-prover.jpg)

File: 1594070761376-1.jpg (162.44 KB, 661x920, 1588027855042-sicp.jpg)

Wow I thought The Little Schemer will be some quick enjoyable read, but it is quite laborious. It took me a while to figure out how to follow along with the code as the instructions are not very user-friendly. I use "J-Bob/step" for the actual proving and only copy it into the proper "J-Bob/define" once it is done. It is pretty fun though and I am looking forward to reading the actual implementation too. It is just a bit too manual after Coq, you have to type a lot!


File: 1594320697293-0.gif (706.24 KB, 1280x1086, 90401bed27c927690db68bf6ee….gif)

File: 1594320697293-1.png (7.02 KB, 734x25, Screenshot_2020-07-09_20-4….png)

I'm hacking on some Scheme code and noticed this… Thank you Geiser, very useful info.


I finished it but I am not satisfied. It could have had more examples on the main techniques, like how to construct the totality claims and such. It did not feel like by the end I understood the main principles, if there were any.


File: 1594568499786.png (165.13 KB, 510x346, Nichtskapiert.png)

Actually, thinking about it a bit more, I think I get it now.


On my personal website.


Nice little website, good job!


Thanks :D


The SchemeBBS "fossil repositories" link gives
502 Bad Gateway

Posting in the sandbox gives
error 502
bad gateway

Anyone else seeing this?


Nice repeating digits. Yes, for me everything dynamic gives 502 error, even viewing individual posts like here: https://textboard.org/sandbox/1/1


File: 1595113198153.jpg (658.87 KB, 900x1273, t.jpg)

Thanks for the confirmation. Hope it's back up soon.



File: 1595789829717.png (444.99 KB, 1280x720, 1595728207571-sicp.png)

I started reading the first volume of Software Foundations, Logical Foundations. It's pretty nice so far, but today I did nothing but the pumping exercise in the IndProp chapter and I still did not manage to finish it. I just can't figure out the App case. I already did every other case but this one just seems impossible.

Maybe I should be working on some project instead of always just reading.


File: 1596142644191.png (10.36 KB, 855x855, 0b447a826e8900385d59db99a4….png)

I get too engrossed and spend all night playing with my Coq. This can't be healthy! I managed to figure out the pumping lemma but now I am stuck on palindrome_converse and can't progress at all. I need induction on (l = rev l) but of course the usual list induction won't do it, because (h :: t = rev h :: t) does not mean (t = rev t).


File: 1596573228860.png (185.08 KB, 600x600, cc02bcb0378c60a175e8483b85….png)

I'm proud to announce that I have finished that chapter. If I continue progressing at this rate I might finish the first volume by the end of the year!


File: 1597521488663.jpg (3.02 MB, 2168x1540, ceb7f68aee01f05954efeebd91….jpg)

I feel like I plateaued in my programming skills and have no idea where to go from here. I don't think learning the basics of yet another programming language would do much for me. Maybe I should start digging deeper into the things I already know, but it seems to be much harder than beginning things. It's hard to find book that are not aimed at beginners. Do you know any good books for intermediate programmers? Or maybe even for experts?


Nothing, I'm slacking off.


Fixing a PS One the only issues it has is the black & white screen and the CD didn't run but i got that fixed and now i'm trying to find some cheap PS1 games.


How do you go about something like that? I never had such a device.


Is anyone else getting NXDOMAIN for bunkerchan.xyz?


It works for me.


Yep, it's back up, thanks. It seems the registration with ovh was renewed at 2020-09-10T11:44:55.0Z.


>Do you know any good books for intermediate programmers? Or maybe even for experts?
For what language Anon?


File: 1599945380148.jpg (829.83 KB, 855x1200, 5756ac83809e1f39e91f10dffe….jpg)

Programming in general would be the best, but I would be interested in advanced books on C, bash, Python, Scheme, OCaml or Smalltalk too. At the moment I am basically interested in what separates the novice from the expert, is it just experience or could I somehow "accelerate" it by studying?


I haven't read this one myself but try "Expert C Programming: Deep C Secrets" and SICP is recommended by some.


I've actually read both already… SICP is an introductory textbook, it's really good but not for experts. Expert C Programming had some fun stories but it's mostly just a collection of war stories.


Have you tried reading the source of some of the languages themselves? Surely that would help you to become proficient


File: 1600110395748.png (128.59 KB, 457x645, thumbs_up.png)

That's actually not a bad idea. In university I worked on the frontend of a C compiler for a while and I learned a lot from it. Thanks!


Has anyone else started getting
>Please turn JavaScript on and reload the page.
>DDoS protection by Cloudflare
for bunkerchan.xyz?


https://bunkerchan.xyz/gulag/res/7295.html#7296 says they will take it down in a week, when they are not being bot-raided anymore.
My cloudflare blocker already went off on bunkerchan for a while.
They must have had this in place for some time.


File: 1601647372212.jpg (511.78 KB, 950x1343, 499bdca0d75e7fca0093367fec….jpg)

Thanks for the information. The JS barrier is once again down right now so I can see that they've added in-thread captchas, where previously they were only a barrier to creating new threads. Do you happen to know whether these newly added in-thread captchas will be reverted as well or is bunkerchan a captcha-only site from now on?


What are you working on?


The cloudflare JS is back on bunkerchan.

Tempting Raven, from the looks of it.


File: 1608072096637.png (727.83 KB, 960x776, ece6c06fcbdb9dd0c7c4793cbd….png)

> tfw you want to go to sleep but you feel that you have *almost* solved that nasty problem
Sleep deprivation, here I come!


I know what you mean, fug



Goal forall n, n = 0 \/ n = 1 \/ n = 2 \/ n = 3 -> n - 3 = 0.
intros n Cs.
decompose [or] Cs; subst; reflexivity.


Rate my run-length encoding functions in OCaml. Here's the most simple:

let rec rle l =
match l with
| [] -> []
| h::t ->
match rle t with
| (h', n)::t' when h' = h -> (h, n+1)::t'
| t' -> (h, 1)::t'

And a somewhat more involved:

let rle l =
let rec iter c n l =
match l with
| [] -> [(c, n)]
| h::t ->
if h = c then iter c (n+1) t else (c, n)::(iter h 1 t)
in match l with
| [] -> []
| h::t -> iter h 1 t


>Rate my run-length encoding functions
The first one is recursive in the obvious way, which is why it's "most simple". The second one still has a pending "(c, n)::" operation to perform after the "(iter h 1 t)" subcall, so unless OCaml rewrites this for you this is also recursive, despite the "iter" name. To get an iterative version with what are effectvely cons-style lists, you'll need to build a partial result in an accumulator and reverse the accumulator at the end, ensuring that the reversal operation is also iterative.



Sorry, hope you like this better:

let rle l =
let rec aux c n l =
match l with
| [] -> [(c, n)]
| h::t ->
if h = c then aux c (n+1) t else (c, n)::(aux h 1 t)
in match l with
| [] -> []
| h::t -> aux h 1 t

I don't like the full accumulator passing style because the extra reverse is often more costly than saving some returns to the stack.


>I don't like the full accumulator passing style because the extra reverse is often more costly than saving some returns to the stack.
The recursive version performs a linear pass on the input list going up the stack, and a linear pass for the result list coming down the stack. The iterative version performs a linear pass on the input list to build the accumulator, and a linear pass for the result list to reverse the accumulator. The reversal phase is the same size as coming down the stack, so unless there is some OCaml peculiarity that intervenes, your cost assertion is false. Furthermore on large and poorly rle-compressible input lists the recursive version dies by overflowing the stack, while the iterative version keeps working.

renamed-not fixed/10


Yes, if the list is that large, there's not much else to do other than moving the call stack to the heap. But for shorter lists, pushing three values to the stack is cheaper than constructing an extra cons cell for each element of the result.


Does OCaml offer some way to write a conditional that tests whether the recursive version would blow the stack if it were to be run?


It does not. But I know, Big Data and Machine Learning is the hip thing now, so here's your industrial strength run-length encoding:

let rle l =
let rec aux c n a l =
match l with
| [] -> List.rev ((c,n)::a)
| h::t ->
if h = c && n < max_int then aux c (n+1) a t else aux h 1 ((c, n)::a) t
in match l with
| [] -> []
| h::t -> aux h 1 [] t


File: 1612907484109.jpg (4.16 MB, 2266x3173, rias2.jpg)



Find songs by artist in bash

find_by_artist() {
find . -type f -print0 \
| xargs -0 exiftool -artist 2>/dev/null \
| awk -v RS='======== ' -v FS='\n' -v ORS='\0' \
'$2 ~ /'"${1}"'/ { print $1 }'


Try writing a lexer. I'm not adept at making algorithms and this confused me. Try making something to recognize numbers, comments, strings, and a few key words from C. Just tokenize an input txt file.


File: 1614371873438.png (17.35 KB, 800x500, 87617512_p0.png)

I wanted to try write a simple dependently typed program because I always just prove things but Coq can do this too. So here are the Fibonacci numbers. First, the specification of what it means for a number to be "Fibonacci", the proposition `fibonacci n m' says that the nth Fibonacci number is m:

Inductive fibonacci : nat -> nat -> Prop :=
| fib0 : fibonacci 0 0
| fib1 : fibonacci 1 1
| fibS n a b m (Ha : fibonacci n a) (Hb : fibonacci (S n) b) (Hm : a + b = m) : fibonacci (S (S n)) m.

This is straightforward, we know that the 0th number is 0 (fib0), the 1st is 1 (fib1), and the (n+2)th is m, if m is a + b where b is the (n+1)th number and a is the nth.


File: 1614371892504.png (17.88 KB, 800x500, 87617512_p1.png)

Here is the program itself:

Definition fib n : { m | fibonacci n m } :=
let aux :=
fix f n :=
match n with
| 0 => (exist (fibonacci 0) 0 fib0, exist (fibonacci 1) 1 fib1)
| 1 => (exist (fibonacci 1) 1 fib1, exist (fibonacci 2) 1 (fibS 0 0 1 1 fib0 fib1 eq_refl))
| S (S n) =>
let (Xa, Xb) := f n in
let (a, Ha) := Xa in
let (b, Hb) := Xb in
let Hab := fibS n a b (a + b) Ha Hb eq_refl in
(exist (fibonacci (S (S n))) (a + b) Hab,
exist (fibonacci (S (S (S n)))) (b + (a + b))
(fibS (S n) b (a + b) (b + (a + b)) Hb Hab eq_refl))
in fst (aux n).

The first line says that fib takes an argument n, and produces such an m, that it is the nth Fibonacci number. (But only a single one and does not say anything about possible other such values.) `exist' is what builds the dependently typed value: its first argument is the property of the value, the second the value itself, and the third is the proof of the property holding for that value. The algorithm is a bit unusual because of Coq's type system. To keep the system logically sound, every algorithm must terminate. In many cases, Coq can automatically detect which argument is decreasing with each recursive call, but in case of the usual recursive definition of Fibonacci, it cannot. With a small trick it can, but that leads to another problem: it must also keep track of `n' to make sure that what it returns is indeed the `n'th number. For this reason both that and the usual iterative version, where it counts from zero up to n, fail type checking because Coq can't establish that the n going in the recursive call and the n coming back are the same.


File: 1616484769382.jpg (68.13 KB, 550x814, cover.jpg)

Anyone else reading SICP2.0? My Scheme skills are a bit rusty but I am really happy to have an excuse to use it again.


Does anyone else keep getting SERVFAIL on DNS requests for wizchan.org?


File: 1617554820348.png (26.86 KB, 720x313, screenshot.png)

idk cause i don't post there but saw this on another board the other day




File: 1617913672356.png (122.3 KB, 529x482, richard_stallman.png)


File: 1618001205173.png (302.39 KB, 1002x405, leah-rowe-defends-stallman.png)

>at the behest of proprietary software vendors
good to see no one's being paranoid about this whole thing


What company would feel threatened by the FSF? They are pretty irrelevant.


File: 1618346622484.jpg (171.17 KB, 1280x720, dumb.jpg)

I'm doing exercise 3.2 right now, and it told me to
> First, make an arithmetic that defines only addition, negation, and subtraction of vectors over a base arithmetic of operations applicable to the coordinates of vectors. Applying any other operation to a vector should report an error.
But if I make it throw an error with `(error "Unsupported vector operation:" operator)', it makes extend-arithmetic fail on zero?. If I return with #f instead of raising the error, it seems to work. I also had to register the `vector?' predicate.

I don't know if I am just not paying enough attention to the text or it really just throws you into deep water with the exercises.


File: 1619125119964.png (7.05 KB, 364x118, Screenshot_2021-04-22_22-5….png)

Finished all the Scheme exercises on exercism. I did most of them around a year ago. Back then it would let you ask for code review on your solutions, which was pretty cool, I learned a few tricks from it. But now it wouldn't let me ask for it, I am not sure why, but it defeats the whole point of the site. Anyway I had it on my todo list, now I can finally cross it out.


I just got into linux lately and I'm still learning basic bash commands lol. So I'm basically just working on being able to properly use a computer. Nothing big but feels good.


That's pretty cool, bash can be really powerful. It's not perfect but it is damn useful.


The GPL license is problematic for the corporate world. Pretty much all proprietary software depends on open source projects and GPL makes leeching off of open source software in proprietary projects difficult. Therefore any organized group that promotes FOSS is a threat. It's all about the money.
I don't know how organized the smear campaign against Stallman was. IMO most likely it was just useful fools who went after him.


File: 1619978291383.jpg (87.72 KB, 300x440, 1387233973349.jpg)

I'm doing the C++ exercises now. They seem to have enough mentors to let me ask for reviews. We will see how it goes, I'm a bit afraid of C++ due to the memes of it being a Lovecraftian horror.


I'm done with the main track of exercises, it was pretty disappointing. It's just 8 exercises and all of them are pretty simple, you don't really need to use any interesting C++ features. There are extra exercises and some of them are pretty interesting, but it's hard to get feedback on those. I'm still doing some of them but C++ is a mess, there's just so much to keep in mind while writing it, I don't think I'll using it in my free time much.


Stallman is his own worst enemy, but his autism made him more effective up until recently.


Does kind.moe seem to be down for anyone else? I keep getting
>Index of /
>Apache/2.4.29 (Ubuntu) Server at kind.moe Port 443


File: 1621491198573.gif (1.82 MB, 360x344, wirechan-on-the-left-kind-….gif)

Yes, it wasn't working at all yesterday and now there's a message that they are working on it. In the meantime you can visit the bunker: https://anon.cafe/kind/


File: 1622800542982.jpg (1.62 MB, 3532x5000, 08992f0f1973102866a332ae43….jpg)

A big thank you for helping out with /kind/!



File: 1622885586667.jpg (26.29 KB, 655x461, 1455647766593.jpg)

Last night I was trying to figure something out but had no success, I couldn't think of anything. So I turned off my computer and started to prepare for bed and of course suddenly all kind of new ideas flooded my head…


File: 1623049902517.gif (1000.05 KB, 495x281, akari.gif)

Looks like the troubles are not over yet…


I don't use anon.cafe due to their captcha/bypass nonsense. Please post the following in https://anon.cafe/kind/res/46.html


>due to excessive CPU usage
You were already told on kind.moe in the thread with 45 replies about the Date and expires timestamps in captcha response headers. Furthermore, in scheduleHandler.js:expiredCaptcha you have:

function expiredCaptcha(immediate) {
if (immediate) {
} else {

schedules.expiredCaptcha = setTimeout(function() {
}, captchaExpiration * 1000 * 1);


Notice the
>captchaExpiration * 1000 * 1
in setTimeout. Never set captchaExpiration to 0.

Separately, from Readme.md:
>* `noReportCaptcha`(Boolean): disables the need for captcha when reporting.


Do you think it is the captcha expiration that causes the excess load? It does not make sense to me, since the client was waiting 256 seconds, does the server just make new captchas without the client side asking for one?


>Do you think it is the captcha expiration that causes the excess load?
It is merely one item to check off the list.

>It does not make sense to me

>does the server just make new captchas without the client side asking for one?
No. The scheduleHandler has an expiration rescanning loop in expiredCaptcha that runs on a timeout of
>captchaExpiration * 1000 * 1
Notice that the callee, checkExpiredCaptchas, ends by handing off to expiredCaptcha again.


File: 1623319069965.jpg (996.58 KB, 1500x1200, calne_ca1.jpg)

I plan on installing Gentoo on a spare machine for the first time in order to learn more about linux.


Exciting! I wish I could Linux for the first time again lol


unless youre getting a job on that field spend that time doing something productive for yourself

Trust me the gentoo rabbit hole its deep


Well yeah, I had the great idea of trying it first time on my nearly 20y/o thinkpad. So compiling the kernel failed after 15hours and 40minutes and I have absolutely no idea what to do about it.
I still don't feel like it was for nothing.

I am about to get a job in this field, but is it really that deep? Everything I heared from Gentoo lately was something like
>Basically the optimization isn't worth it anymore because of fast computers / the compiling time makes it even
>You're already using arch (actually artix) so there isn't that much anymore you're going to learn through getting into gentoo

I thought both were invalid arguments, but it's surprising to hear the opposite.


Should I learn Rust? Is it really going to replace C and C++?


File: 1633346167685.png (24.63 KB, 1071x455, Screen Shot.png)

>Value: 1; The uploaded file exceeds the upload_max_filesize directive in php.ini

when trying to post in >>>/a/12
file size: 2780883
examples of posts over 4MB: >>1239 >>1241 >>1284


Obscure technical searches lead me to underground chans. nice to know you all continue to exist. please keep allowing indexers to crawl you so this will happen in the future, thank you.


Welcome, friend.


Can we get an admin answer to >>1318 ? Is it misconfiguration or has the file size limit been lowered?


Filesize limit was lowered.



File: 1642225305015.jpeg (866.37 KB, 1920x1200, the binaric machine.jpeg)

working on self-teaching myself the workings of the computer. I've pirated a bunch of textbooks, and have a few projects in mind. Wish me luck.


Goodluck, what kind of project(s) did you have in mind?


mostly making stupid applications. somethings for automating some TTRPG processes, and something like a program that place customizable virtual waifu assistants on your desktop (which I think exists already). The big goal is to learn how to white hat properly while doing small software projects to avoid psychosis. Also it's good programming practice.


if you would like to make a study group on this board I would be amenable to joining and going through your textbooks
although I would request to see the titles you're going through first


File: 1642481757482.png (972.64 KB, 1280x720, structure and interpretati….png)

sure thing Anon, though, to create that study group board, I think I'd need to progress further with my studies than where I currently am (I started just as I wrote that post). The books I've got lined up for reading are:
>Compilers: Principles, Techniques, and Tools (The Dragon Book)
>Computer Networking: A Top-Down Approach (6th Ed)
>Computer Systems: A Programmer's Perspective
>Crafting Interpreters
>Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems
>Mathematics for Computer Science (Eric Lehman)
>Operating Systems: Three Easy Pieces
>Structure and Interpretation of Computer Programs (2nd Ed)
>The Algorithm Design Manual
The list isn't in any particular order, and the book I'm on right now is SICP


File: 1642551673388.png (983.27 KB, 1258x1374, 1879234572345.png)

Thanks for the comprehensive list. A good portion of them seem interesting.
Especially the lower level stuff.
I don't think I'll be following along with SICP.. Reading some CL stuff instead.

On Lisp in particular.

Here's a link for anyone interested in SICP though. The formatting is nice.

If you get anything out of SICP, I would like to know. I'm just going to put it off for now.
Not convinced Scheme is the way forward


>especially the lower level stuff
I should've mentioned I'm starting from near zero here. Besides some codemonkey experience in Python, C, and Lua.
>If you get anything out of SICP, I would like to know.
I'll keep you posted Anon!


SICP is not about Scheme, it doesn't even cover the full language. You will learn a lot from it even if you never use Scheme ever again.


I skimmed the book further due to your suggestion. For a good hour or so.
It covers a lot of interesting computer concepts, most I am familiar with due to previous compsci books and lisp books.

>It was formerly used as the textbook for MIT's introductory course in electrical engineering and computer science

So it doesn't seem practical to me, but it is a great introduction. Would definitely be practical for others.
I've never took the time to go through the ToC and jump around the chapters to make this conclusion before.

It would've been nice to have this as my introduction to computation, but oh well.


I'll consider myself lucky to have it as my introduction then!


Is textboard.org down?


File: 1644053720887.png (29.55 KB, 200x193, works-on-my-machine.png)


Thanks. Now it's back for me too, just super slow.


Is anyone else getting captchas when trying to search for anything on:


That site sometimes turns on the captcha. web.archive.org doesn't require captchas but to archive a site, you need to enable JabbaShit.


File: 1653857118032.jpg (217.05 KB, 1280x720, 1387047606358.jpg)

I can't remember when was the last time I programmed for fun… I'm afraid I have lost the spark


> That site sometimes turns on the captcha
OK. It's been in this unusable state for me for a month and a half now.

> web.archive.org doesn't require captchas but to archive a site, you need to enable JabbaShit.

Unfortunately it seems to require JS for searching as well. The only non-JS function seems to be serving archived pages if you have a direct link, but the direct link contains the archival timestamp, so it cannot be constructed from the target URL alone.

> The Wayback Machine requires your browser to support JavaScript, please email info@archive.org if you have any questions about this.


If I write some random number like 23 instead of the timestamp, I get the latest.



They have an API, if you don't mind JSON you can use that: https://archive.org/help/wayback_api.php



Is anyone else getting
> error 502
> bad gateway
when trying to post on textboard.org, including on /sandbox/?


Yes I am getting the same error.


File: 1665776174643.jpeg (167.58 KB, 1280x1920, 743ff50b59387a3c1db2d15ee….jpeg)

>Yes I am getting the same error.
Thank you.


File: 1679362967118.png (247.76 KB, 945x777, sliced.png)

I'm hacking with Emacs sliced images, i want to allow a better rendering of images and text, where text and images freely can be mixed, placed next to each other in horizontal, images in Emacs are fontified text, where the height of the image would be the height of the line, only one line of text can be placed horizontally to the image and is always centered. I have currently read most source code in Emacs relating to images, positioning and have studied packages which use sliced images. And have implemented basic functions for sliced image insertion which handles the correct scaling, slicing and properties to allow images to be represented as a block of text, which the image is scaled, resized and sliced to fit. I have mostly automatized everything and added different insertion methods which react correctly to the surroundings, such as a coordinate (absolute positioning) based insertion allowing HTML like manipulation of text and images.

If anyone is interested in my project; send me a message 3nity(at)airmail.cc


Thanks for mentioning Logical Foundations. I looked it up and found a website that has various other related books to download https://softwarefoundations.cis.upenn.edu/
I rarely have time, but this goes on my list of stuff to read when the world slows down, I get independently wealthy, and my IQ increases.


File: 1679826839998.jpg (36.89 KB, 400x400, programming team.jpg)

I have read Logical Foundations and Verified Functional Algorithms and now I am working through Programming Language Foundations but it is taking a while as I usually only spend a single afternoon per week on it.

[Return][Go to top] [Catalog] [Post a Reply]
Delete Post [ ]
[ a / b / art / cy / lain / alt / o ] [ wired / meta ] [ home / information / affiliates / updates ] [ mebious ]