Login
You're viewing the discuss.systems public feed.
  • Feb 13, 2025, 10:25 AM

    This is something I do not like. The algorithms of the type system should be understandable, written in a page that you could perform yourself on paper. They should be meaningful for the user.

    They shouldn't be opaque.

    It is an interesting experiment for someone that is not a logician.

    💬 1🔄 1⭐ 0

Replies

  • 💬 1🔄 0⭐ 0
  • Feb 14, 2025, 9:04 AM

    @khinsen Apart from not being a logician, the error messages do not explain the algorithms.

    Also, Agda is a research project, meaning that new theories are always introduced. This is good and bad. A lot of errors can be found later.

    This has led many to limit themselves to a well understood part of theory, check for example @MartinEscardo typetopology .

    In the same vein, I use univalent mathematics, math in general, well understood concepts, instead of Agda 's features.

    💬 2🔄 0⭐ 0
  • Feb 14, 2025, 9:10 AM

    @apostolis Limiting oneself to a well understood subset is a wise move. Tools like Agda should support it.

    The fundamental issue I see, and which I address in the preprint, is that we don't make enough effort in digital science to separate mature from experimental methods. There is a place for both of course.

    💬 0🔄 0⭐ 0
  • 💬 0🔄 0⭐ 0