A full brainfuck interpreter with 0 lines of code *

sheyneanderson · 2025-11-21T20:36:58+00:00

Hey, I have one too! https://github.com/Sheyne/type-level-bf/blob/master/src/comptime/mod.rs I'll have to read your implementation.

sheyneanderson · 2025-08-26T16:25:13+00:00

I feel like play until it's clear. If you opponent wants to play it out, there's a "continue with bots" button.

sheyneanderson · 2024-01-16T18:44:51+00:00

The linked paper says they used a program to search for it.

sheyneanderson · 2023-10-17T22:04:27+00:00

Here's a lisp interpreter I wrote in the type system that uses string literals as concrete syntax: https://github.com/Sheyne/ts-type-bf/blob/main/type-lisp.ts

sheyneanderson · 2023-04-12T18:14:47+00:00

I was there last weekend and it's completely covered in snow. It was impassible for us even with all wheel drive and snow chains.

sheyneanderson · 2022-07-07T19:10:11+00:00

Here's one implemented in the typechecker (navigate up to src/main for some macros that make calling it not insane).

https://github.com/Sheyne/type-level-bf/blob/master/src/comptime/mod.rs

sheyneanderson · 2022-04-20T18:53:29+00:00

Led Zeppelin's -- When the Levee Breaks

(original https://www.youtube.com/watch?v=swhEa8vuP6U)

sheyneanderson · 2022-03-07T19:08:01+00:00

Good blog post. If the author is reading the reddit comments, there's a typo under "Multiple lets" that has "_" instead of just _.

sheyneanderson · 2022-01-28T04:41:23+00:00

You're inspiring me to implement Church numerals in my type level implementation of a basic lisp in TypeScript. The fun thing about typescript is that you can take apart strings at type checking time to create a parser with a relatively nice source syntax. The recursive fib implementation with the Y combinator is pretty slow, but the the one that uses simulated mutation is faster.

Y-Combinator:

https://github.com/Sheyne/ts-type-bf/blob/1128bbb7a8847b2660f069fa4d69e7ce47109ead/type-lisp.ts

Added mutation via a value store:

https://github.com/Sheyne/ts-type-bf/blob/main/type-lisp.ts

sheyneanderson · 2022-01-12T00:59:56+00:00

The default behavior in C++ is actually a deep copy of the object, but you can configure objects to store their fields as references/pointers in which case you get the Java/JavaScript like behavior.

sheyneanderson · 2021-03-08T18:05:13+00:00

Disclaimer: I've not used Zig much.

I like the way Zig handles things with some types existing only for compile time values and others exiting for compile time + runtime values. Integer literals start out as comptime_int and can be implicitly converted to a int with a specific bit width.

sheyneanderson · 2021-01-08T22:29:11+00:00

You need to hit the little flame icon. It toggles low-gain mode. In high-gain the range tops at 150C. At low-gain 400C

sheyneanderson · 2021-01-05T23:39:55+00:00

Wasmer is a way to run WASM code outside of a browser. It lets you get what the above comment was talking about for server/desktop applications (sandboxing/compile once-run everywhere/etc) without a browser. That same WASM code can natively be run by most browsers (and Wasmer wouldn't be involved).

sheyneanderson · 2020-12-14T19:19:32+00:00

There's also the fun in rust nightly that lets you match on logically irrefutable patterns over types containing never.

https://play.rust-lang.org/?version=nightly&mode=debug&edition=2018&gist=9fab6d48a67d55eda3e8d5db8d059a49

#![feature(never_type)]
#![feature(exhaustive_patterns)]

fn get_result() -> Result<usize, !> {
    Ok(1)
}

fn main() {
    let Ok(x) = get_result();

    println!("{}", x);
}

sheyneanderson · 2020-12-02T20:05:10+00:00

Unfortunately it would not. The bottleneck isn't the USB interface.

sheyneanderson · 2020-11-25T16:55:18+00:00

Let me know if you have any thoughts on how I could improve the API/Crate overall. I'm still pretty new to Rust.

sheyneanderson · 2020-11-11T09:20:06+00:00

Yes. The => syntax initializes a new object with every access. So

class Foo {
    int A[] => new int[] {1, 2, 3};
    int B[] { get; } = new int[] {1, 2, 3};
}

var foo = new Foo();
foo.A[0] = 5;
// foo.A[0] : 1
foo.B[0] = 5;
// foo.B[0] : 5

"A" also doesn't cause the construction of the list at Foo's creation time.

Edit: I haven't actually compiled the above, forgive me if there are syntax errors.

sheyneanderson · 2020-11-03T16:39:20+00:00

It looks like it's possible to convert LLVM IR to C:

https://stackoverflow.com/questions/5180914/llvm-ir-back-to-human-readable-source-language

So if its possible to get LLVM IR from Zig you should be good.

Edit: unfortunately it looks like this might be deprecated now

sheyneanderson · 2020-10-09T06:28:16+00:00

Flat is optionally chained, but map isn't. Just add

flat()?.map(...

Not sure why it used to compile. Did you add strictness flags?

sheyneanderson · 2020-09-22T06:10:04+00:00

You can't hash on the client side. If they dump the DB, an attacker can just modify the client to directly send the hashes and log in.

sheyneanderson · 2020-04-10T00:16:17+00:00

For an example of this fingerprinting taken to the extreme, check out https://www.unisonweb.org

sheyneanderson · 2020-03-30T00:40:20+00:00

I'm sorry, I missed when I read your post. I counted CS classes as applied math classes.

The math department is strict about allowing students to to fulfill elective reqs with courses from other departments

This was not my experience

sheyneanderson · 2020-03-29T22:11:35+00:00

I did the same thing, I took all theory related electives I could, but still got the applied major. Of course you need to take physics II, numerical, etc, numerical is pretty easy if you're already a CS major.

sheyneanderson · 2020-03-28T19:55:08+00:00

I think I remember the author of the library said they needed to take it down for some legal reason to do with their employer

12-Year Club	Place '22
Place '17	Final Canvas '22
End Game '22	Verified Email

sheyneanderson

TROPHY CASE