Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Project - Indexing existing Abstract Models (2024-2025?) #20

Closed
61 tasks
FadiShawki opened this issue Jan 26, 2024 · 9 comments
Closed
61 tasks

Project - Indexing existing Abstract Models (2024-2025?) #20

FadiShawki opened this issue Jan 26, 2024 · 9 comments

Comments

@FadiShawki
Copy link
Member

FadiShawki commented Jan 26, 2024

Project - Indexing existing Abstract Models (2024-2025?)

Once a proper interface for Rays is setup, one of the things I'd like to do with it, is to point it to a lot of existing abstract models of computation/mathematics/calculi/theorem-provers/compilers/proof assistants/automated program synthesizers/.../programming languages. And create a way of analyzing/comparing them which does not include manual human labor of specifying their grammars.


Comments on [[2024-04-05]]

This thing is probably way too big a project, but thinking about it will probably get much easier in the coming years. I'm preemptively putting this here mainly because I want to find out if there are currently (or have been) people attempting something like this.

The only stuff I've been able to find so far is either incredibly limited in scope or is doing too much of this by hand. Would love to find out that there's someone who has been working on this already though :upside_down:

Seamless direct (partial) inter-compilation/.../translation of things will probably become much more tractable at some point in the near future ^ Though all the more insane complexity of software/firmware/hardware to me seem to pose the most challenges.


  • This entire thing should be compiled into a writing/study of existing stuff

  • Whole project makes it necessary to get the practical low-level systems in this too.
    • Lookup existing projects in that space, decompilers, interfaces for binary analysis etc..

This is a current list of the projects I found so far related to this project - and possibly some to apply the beast to:

Some other names I found but didn't save a link to:

  • DisCoPy2, Aletha, Inkresat, F star, smt-comp, starexec, verdict, vau calculus, SF-Calculus, Monoidal Computer, Certora Prover, smt workshop, Imandra, Waldmeister, POG, QuiZX, Globular, proofweb, holyhammer, B, Event-B, TLA+, Atelier B, Rodin, TLAPS, OpenTheory, FoCaLize, Zenon, iProver, CoqinE, veriT, BWare, B-Method, ArchSAT, sel4, HOL4, Flexiformalized math, OMDoc, Schurr 1999, GP/GP2 Plump 2009, GRAPE / Grape PRess - Weber 2017/2021, AGG Taentzer 2004, FUJABA Nickel 2000, GReAT Agrawal 2006, GROOVE Rensik 2004, TPS, PhoX, Markdown, JPEG, JPG, PNG, MINLOG, Jape, ae (alt-ergo), dimacs, iCNF, smtlib, zf (zipperposition), HELM, MathWeb, MathScheme, MathClasses, ForMath Project, Opetopic Type Theory, RedPRL, yaccyt, redtt, PVS, Matita, Guru, Dependent ML, Gallina, Cayenne, Arend
  • Ro, aUI
Some Interface design / ... / visualization / game / generation projects

Some interesting/pending questions regarding this project:

  • What are mistakes in trying to spin up new projects/languages?
  • What can be (partially) compiled to what using what? (Natively supported vs finding (accidental) symmetries to allow for compilation)
    • Apply this question again by loosely changing constraints?
  • Compiled grammar vs analysis of runtimes?
  • Just exclude the ones without open licenses. ; or if the project is big enough might as well contact all of them to lift the licenses

Some other ways of possibly extending this list (non-completed tangents):


Some more relevant historical stuff:


Some old notes for possible ways to expand the list:

Indexing existing archives/knowledge bases for preservation and possible future analysis...

Proof Assistant exploration, [[Proof_assistant.pdf]], [[Formal_verification.pdf]], [[Computer-assisted_proof.pdf]], [[Automated_reasoning.pdf]], [[QED_manifesto.pdf]], [[Proof_compression.pdf]]
,[[Automated_theorem_proving.pdf]], [[Compiler-compiler.pdf]],[[History_of_compiler_construction.pdf]], [[Compiler.pdf]], [[Decompiler.pdf]], [[Corrado Böhm]]

@FadiShawki FadiShawki converted this from a draft issue Jan 26, 2024
@FadiShawki FadiShawki linked a pull request Jan 29, 2024 that will close this issue
@FadiShawki
Copy link
Member Author

This is probably a very relevant thing: Where invariance in this case is something like a branching ray as a cursor along a ray indicating an invariance: i.e. copies over every entry.

"Also, interesting to note might be that Von Neumann and Birkhoff attempted to ground quantum mechanics using order theory (their attempt was not very successful at that)."
Me: "I think my intuition is trying to say something like. I want it ordered to talk about it usefully. But high-arity cases are probably more in line with ignoring/invariances of that order."

Feb 22.

@FadiShawki
Copy link
Member Author

FadiShawki commented Mar 7, 2024

Rays are probably a Characteristica_universalis

Some more:

[Erlang](https://en.wikipedia.org/wiki/Erlang_(programming_language), metalang99, SL, Abstract object theory (AOT), Causal graph, chemlambda, Representation theory, Lattice theory, Metamathematics, archon
Ro, aUI

Some more relevant historical stuff:

Characteristica_universalis, Lingua_generalis, Philosophical_language, Proofs_from_THE_BOOK, The_Glass_Bead_Game, Universal_language, Langlands program, Mathesis universalis

[Phenomenology](https://en.wikipedia.org/wiki/Phenomenology_(philosophy) apparently also interested in these things

Some more ways to extend the list (non-completed tangents):

This entire thing should be compiled into a writing/study of existing stuff

  • Compile into a writing

@FadiShawki
Copy link
Member Author

@FadiShawki
Copy link
Member Author

@FadiShawki
Copy link
Member Author

Some Interface design / ... / visualization / game / generation projects

Possible extensions:

@FadiShawki
Copy link
Member Author

I'll organize this properly later

Interface...
AtomicData.dev, Ink & Switch, tikzit

....
Solid,

Chemistry: Assembly Theory

More expansions


  • Whole project makes it necessary to get the practical low-level systems in this too.

    • Lookup existing projects in that space, decompilers, interfaces for binary analysis etc..
  • HoTT Game,

@FadiShawki
Copy link
Member Author

  • [[Mealy machines]]
  • Bi-directional programming languages (Monoidal cafe?). Same with the [[Category Theory]] para lenses etc.. just the ray selection (arbitrarily branching)?

Hardware/firmware/embedded systems etc...
TODO Actually expand this list...
HSA, HIP, CUDA, firmware, .....

expand...

@FadiShawki
Copy link
Member Author

Moved the project from my archive to a separate repository. Minimal language implementations will still be in the universal language repo, but anything else about this project I'll throw in here: https://github.com/orbitmines/library

@github-project-automation github-project-automation bot moved this from Future Projects to Done in OrbitMines Jun 3, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
Status: Done
Development

Successfully merging a pull request may close this issue.

1 participant