{"id":17026285,"url":"https://github.com/st3v3nmw/morph","last_synced_at":"2025-07-02T21:05:10.079Z","repository":{"id":106923020,"uuid":"497545697","full_name":"st3v3nmw/morph","owner":"st3v3nmw","description":"A mostly pure functional programming language","archived":true,"fork":false,"pushed_at":"2023-05-10T14:19:46.000Z","size":11,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-02T21:04:48.647Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/st3v3nmw.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}},"created_at":"2022-05-29T09:34:59.000Z","updated_at":"2025-05-01T19:00:13.000Z","dependencies_parsed_at":"2024-01-24T16:27:41.802Z","dependency_job_id":null,"html_url":"https://github.com/st3v3nmw/morph","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/st3v3nmw/morph","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/st3v3nmw%2Fmorph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/st3v3nmw%2Fmorph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/st3v3nmw%2Fmorph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/st3v3nmw%2Fmorph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/st3v3nmw","download_url":"https://codeload.github.com/st3v3nmw/morph/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/st3v3nmw%2Fmorph/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":263215288,"owners_count":23431893,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":[],"created_at":"2024-10-14T07:31:33.543Z","updated_at":"2025-07-02T21:05:10.010Z","avatar_url":"https://github.com/st3v3nmw.png","language":"Rust","funding_links":[],"categories":["Uncategorized"],"sub_categories":["Uncategorized"],"readme":"## morph\n\n### Steps\n\n- [ ] Lexer\n- [ ] Parser\n- [ ] Semantic Analyzer\n- [ ] IR Lowering\n    - [ ] Type Checking \u0026 Inference\n    - [ ] Desugaring\n- [ ] LLVM IR Code Generation\n- [ ] Build Binary\n\n### Random Thoughts\n\n- Paradigm: Mostly pure functional programming language\n    - `impure` blocks, like Rust's `unsafe`, for now\n- Functions\n    - Functions are first class citizens\n    - Tail recursion \u0026 tail call optimization\n    - Higher order functions\n    - Pipes: (|\u003e)\n    - Partial function application/currying\n    - Closures\n    - Decorators e.g. `@memoize`\n    - Async/Await?\n- Type System\n    - Types are first class citizens like in Idris\n    - Statically typed\n    - Strongly typed?\n    - Algebraic types (sum \u0026 product types)\n    - `unit` i.e. `()`\n    - No null pointers, Haskell's `Maybe\u003cT\u003e`.. `Some\u003cT\u003e` or `None`\n    - Strong type inference\n    - Hindley–Milner type system?\n    - Generic types? Parameterized types?\n    - Dependent types?\n        - Aiming for types that are so powerful you can prove mathematical theorems with `morph`\n        - `forall`, `there exists`\n- Evaluation Strategy\n    - Everything is an expression\n    - Lazy execution\n    - Generators?\n    - Zero cost abstractions\n    - Implicit parallelism\n        - Expressions are thread-safe\n        - Static cost estimation\n        - Cyclomatic complexity?\n        - Theoretical limits: Amdahl's law\n- Control Flow\n    - Pattern Matching\n        - Match blocks, like Rust's\n- Memory management\n    - Rust's ownership model?\n    - Garbage collection?\n- IO\n    - Monads?\n- Vectorization/Array Programming\n- Metaprogramming\n    - AST-based macros\n- Backend\n    - LLVM\n- Formal verification?\n\n### Standard Library\n\n- Implicitly imported\n\n#### Functions\n\n- `all()`: Do all elements satisfy a condition?\n- `any()`: Does any element satisfy a predicate?\n- `map()`\n- `reduce()`\n- `filter()`\n- `max()`\n- `min()`\n- `reverse()`\n- `sum()`\n- `zip()`\n\n#### Types\n\n1. List (+, append, [], all, any, filter, foreach, indexOf, join, len)\n2. \n\n#### Abstract Algebra\n\nOperations, Groups, Rings, Fields, Vector Spaces, etc\n\n#### IO\n\n#### Regex\n\n#### Pseudo-random number generator\n\n#### ML\n\n#### Parser Combinator\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fst3v3nmw%2Fmorph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fst3v3nmw%2Fmorph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fst3v3nmw%2Fmorph/lists"}