/sci/ - Science & Math

>>16089119
How do I learn Type Theory?

Good Morning /Sci/entists!

Welcome to my Science Foundation meeting. If I had a building it would have maids with huge boobs and they'd be giving all of you milk and cookies.

In Computer Science there is an idea called Programming Language which is used to make stuff. Programming language has two kinds. General Language and Domain-Specific Language.

General Language can do anything. It's best use is to implement Domain-Specific Language.

Domain-Specific Language can only talk about one problem, bit does so much more clearly and effectively than a General Language can.

Imagine you have a maid cafe and you need to give maids instructions. Using Domain-Specific Language you could write something like:

GET COOKIES
GO TO TABLE 5
HEART HANDS
GIVE COOKIES
HEART HANDS
GO TO KITCHEN

And the maid gives a table some cookies. And you did that without having to write any C because operating the maid is abstracted into a Domain-Specific Language.

Formal System is a list that that gets axioms and then you prove stuff from the axioms.

The most important question is this. Are there Domain-Specific Formal Systems? Can we make Formal Systems which talk about specific problems and are very good with only those kinds of problems?

Can we find an optimal Formal System for a given problem and make talking about and solving that problem easier by using the Domain-Specific Formal System?

Can we map keywords for a Domain-Specific Language to axioms in a Formal System? Can we construct a Domain-Specific Language from any Domain-Specific Formal Systems?

Can we make a Domain-Specific Formal System where it is easier to prove certain things? That lets us operate math without knowing it's "low-level" details like how the example Domain-Specific Language hid C?

This can be used to help count more numbers or make a representation of the Maid Mind Computer Program which is a smaller number so it gets counted faster.

Thank you /Sci/entists for reading my post.