{"id":34231083,"url":"https://github.com/aphsai/thea_interpreter","last_synced_at":"2026-03-10T08:33:30.691Z","repository":{"id":72004059,"uuid":"168066466","full_name":"aphsai/thea_interpreter","owner":"aphsai","description":"a predecessor to a more ambitious project (that I'll hopefully have time for) called Cynthia","archived":false,"fork":false,"pushed_at":"2019-05-26T17:47:44.000Z","size":66,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-06-21T00:03:03.784Z","etag":null,"topics":["go","interpreter","language","programming","thea"],"latest_commit_sha":null,"homepage":"","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/aphsai.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-01-29T01:21:37.000Z","updated_at":"2019-05-26T17:47:46.000Z","dependencies_parsed_at":null,"dependency_job_id":"5358e8bc-0595-4c02-ad6f-56b4a6ec3422","html_url":"https://github.com/aphsai/thea_interpreter","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/aphsai/thea_interpreter","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aphsai%2Fthea_interpreter","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aphsai%2Fthea_interpreter/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aphsai%2Fthea_interpreter/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aphsai%2Fthea_interpreter/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aphsai","download_url":"https://codeload.github.com/aphsai/thea_interpreter/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aphsai%2Fthea_interpreter/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":30328251,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-03-10T05:25:20.737Z","status":"ssl_error","status_checked_at":"2026-03-10T05:25:17.430Z","response_time":106,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["go","interpreter","language","programming","thea"],"created_at":"2025-12-16T01:07:22.050Z","updated_at":"2026-03-10T08:33:29.874Z","avatar_url":"https://github.com/aphsai.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# thea_interpreter\n\n## Why\n\nI have an idea for something a little more ambitious, but I need to understand these things first before I jump into it. So, I'm making an interpreter (and maybe a compiler in the future) for a language I'm creating called Thea. Eventually, I will translate this knowledge into a new language called Cynthia.\n\nI don't really have a big plan for Thea at the moment, I think it's just going to be another quirky language, right now the gimmick is that the keywords are only two characters because I hate memorizing long winded and verbose bits of code.\n\nThough, I imagine reading something like `if (tr) rt fl; el rt tr;` (if true, return false, else, return true) is a bit difficult to read. It looks kind of cute to me.\n\nAlso, I think most keywords are just kind of useless? Like if I'm writing a recursive fibonacci function, I don't need to see the entire return keyword, my eyes just glaze over it, so it helps in filtering out noise in programming code.\n\n\u003cpre\u003e\n\u003cb\u003elt\u003c/b\u003e fib = \u003cb\u003efn\u003c/b\u003e(n) {\n\t\u003cb\u003eif\u003c/b\u003e (n \u003c 2) \u003cb\u003ert\u003c/b\u003e n;\n\t\u003cb\u003eel\u003c/b\u003e \u003cb\u003ert\u003c/b\u003e fib(n - 1) + fib(n - 2);\t\n}\n\u003c/pre\u003e\n\n\nThis looks clean to me. Tight.\n\nThat's what it is right now, maybe it'll change in the future if I think of a revolutionary new idea (hah).\n\n## Some of the things you can do with Thea\n\nArithmetic Expressions\n\n\u003cpre\u003e\n5 + 5;\n\u003c/pre\u003e\n\n\u003cpre\u003e\n10\n\u003c/pre\u003e\n\nVariable Bindings\n\n\u003cpre\u003e\n\u003cb\u003elt\u003c/b\u003e a = 5;\n\u003cb\u003elt\u003c/b\u003e b = 10;\nb * a;\n\u003c/pre\u003e\n\u003cpre\u003e\n50\n\u003c/pre\u003e\n\nFunctions\n\n\u003cpre\u003e\n\u003cb\u003elt\u003c/b\u003e a = \u003cb\u003efn\u003c/b\u003e(x, y, z) { x + y + z; }\na(1, 2, 3);\n\u003c/pre\u003e\n\n\u003cpre\u003e\n6\n\u003c/pre\u003e\n\nHigher-Order Functions\n\n\u003cpre\u003e\n\u003cb\u003elt\u003c/b\u003e a = \u003cb\u003efn\u003c/b\u003e(x) { \u003cb\u003efn\u003c/b\u003e (y) { x + y } };\n\u003cb\u003elt\u003c/b\u003e b = a(2);\nb(3);\n\u003c/pre\u003e\n\n\u003cpre\u003e\n5\n\u003c/pre\u003e\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faphsai%2Fthea_interpreter","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faphsai%2Fthea_interpreter","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faphsai%2Fthea_interpreter/lists"}