Jack Papel Team 00:07
Person = <name, age, height, talk, die> ∀name∈String ∀age∈R ∀height∈Height ∀talk∈Λ ∀die∈Λ
createPerson={<<name, age, height> <
name
age
height
say={<words <
print(name + ": " + words)
>>}
sayRepeatedly={<words <
for(x∈R:0<x<10 {<x <
print(name + ": " + words)
>>})
>>}
die={<{} <
name.talk("blegh")
print(name + " died")
>>}
>>}00:09 So in set theory, a function is represented as a set of ordered pairs. For example, f(x) = x + 2 is represented by {... <0, 2> <1, 3> <2, 5> ...}
00:09 An ordered pair is represented by {{a}{a, b}}
00:10 So ideally, in an interpreter for this language, {{a}{a,b}} would be treated the same as <a, b>
00:10 So you could rewrite the above code in a very cursed way if you really wanted to
00:15 createPerson={{{{{name {name age}} {{name {name age}} height}}} {{{name {name age}} {{name {name age}} height}}
name
age
height
say={{{words} {words {
print(name + ": " + words)
}}}
sayRepeatedly={{{words} {words {
for(x∈R:0<x<10 {{{x} {x {
print(name + ": " + words)
}}}})
}}}}
die={{{{}} {{} {
{name.talk("blegh")}
{name.talk("blegh") print(name + " died")}
}}}}
}}}00:15 There's definitely a mismatched bracket somewhere in there
00:18 Person = {{{{name {name age}} {{name, {name age}} height}} {{{name {name age}} {{name, {name age}} height}} talk}} {{{{name {name age}} {{name, {name age}} height}} {{{name {name age}} {{name, {name age}} height}} talk}} die}} ∀name∈String ∀age∈R ∀height∈Height ∀talk∈Λ ∀die∈Λ
00:18 I know what you're thinking: What's the advantage to this?
00:19 Cause um it's so better
00:20 Feel free to stop that timer now lol
00:22 I'm pretty sure this language covers all the things you need for a language. Maybe I'm missing some
00:23 Oh and here's calling that constructor and calling the say method:
createPerson(<"bob" 38 {5 9}>)
.say("Hello!")00:23 Parentheses optional
00:24 The language makes use of 5 unicode characters:
∀ ∈ ∪ ∩ Λ
00:25 Everything in the language is a set. It is the only primitive
00:26 Classes are sets, types are sets, functions are sets
00:26 for, if, while are sets
00:27 And there is no mutability
00:29 The great thing about sets is that you can represent an open bracket as a 0 and a close bracket as a 1, meaning space efficiency!
