Not signed in (Sign In)

Start a new discussion

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry bundles calculus categories category category-theory chern-weil-theory cohesion cohesive-homotopy-theory cohesive-homotopy-type-theory cohomology colimits combinatorics complex-geometry computable-mathematics computer-science constructive constructive-mathematics cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry differential-topology digraphs duality elliptic-cohomology enriched fibration finite foundations functional-analysis functor galois-theory gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory history homological homological-algebra homology homotopy homotopy-theory homotopy-type-theory index-theory infinity integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal-logic model model-category-theory monoidal monoidal-category-theory morphism motives motivic-cohomology multicategories newpage noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pasting philosophy physics planar pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string-theory subobject superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorUrs
    • CommentTimeSep 12th 2019

    This is the list from proof assistant – Examples, and was (incompleteky) copied by hand into related entries, but we should make it (as done hereby) a standalone to be !includeed under “Related concepts” in relevant entries

    All I did in editing was to group the proof assistants into “based on type/set theory” and “applicable to homotopy type theory”. Experts please hit “edit” and improve on it

    v1, current

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeSep 12th 2019

    Should Haskell be part of the list?

    • CommentRowNumber3.
    • CommentAuthoratmacen
    • CommentTimeSep 12th 2019

    Re #2, no. Haskell is an ordinary programming language. Actually, I think it’s not really right that a proof assistant is a kind of programming language. Most proof assistants resemble and/or include a programming language though. Going to edit.

    • CommentRowNumber4.
    • CommentAuthoratmacen
    • CommentTimeSep 12th 2019

    Removed Haskell.

    diff, v2, current

    • CommentRowNumber5.
    • CommentAuthorUrs
    • CommentTimeSep 12th 2019

    Better than removing it would be to include it with proper heading. Maybe “Type-checked programming languages”?

    • CommentRowNumber6.
    • CommentAuthoratmacen
    • CommentTimeSep 12th 2019

    But why would that go on this include? I see Haskell is listed at programming language.

    • CommentRowNumber7.
    • CommentAuthorUrs
    • CommentTimeSep 12th 2019

    Is there a good chance that a newbie reader stumbling upon a page for proof assistants might be interested in learning about the existence of fully typed programming languages?

    • CommentRowNumber8.
    • CommentAuthoratmacen
    • CommentTimeSep 12th 2019
    • (edited Sep 12th 2019)
    I wouldn’t know. What do you mean by “fully typed”? (I probably wouldn’t know anyway.)
    • CommentRowNumber9.
    • CommentAuthorTim_Porter
    • CommentTimeSep 12th 2019

    Haskell is‘a statically typed, purely functional programming language with type inference and lazy evaluation.” I suggest that a link be added to related pages to include mention of functional programming languages and Haskell in particular.

    • CommentRowNumber10.
    • CommentAuthorMike Shulman
    • CommentTimeSep 12th 2019

    We could, I guess, include a link to a functional programming languages page, but that doesn’t really seem to be to be part of the purpose of a “list of proof assistants” intended to be included in other pages. If some including page also wants a list of functional programming languages, why not have it directly include that?

    Actually, looking at some of the pages where this is included, it also seems a bit weird to me to collapse a list of proof assistants with a list of formalization projects. Why not make them two separate lists?

    Also, why is Metamath given its own bullet point while Mizar/NuPRL/Isabelle/HOL have to share one? Surely the latter four differ among themselves at least as much as they differ from Metamath.

    What distinguishes a “project for formalization of mathematics” from a “library of code in a proof assistant”? For instance, I generally talk about the HoTT/Coq library in the same breath as UniMath as libraries for HoTT in Coq.

    Should we list quantomatic?

    • CommentRowNumber11.
    • CommentAuthorUrs
    • CommentTimeSep 12th 2019
    • (edited Sep 12th 2019)

    There is no deep theory of bullet points underlying this. Please go ahead and edit as you see fit.

Add your comments
  • Please log in or leave your comment as a "guest post". If commenting as a "guest", please include your name in the message as a courtesy. Note: only certain categories allow guest posts.
  • To produce a hyperlink to an nLab entry, simply put double square brackets around its name, e.g. [[category]]. To use (La)TeX mathematics in your post, make sure Markdown+Itex is selected below and put your mathematics between dollar signs as usual. Only a subset of the usual TeX math commands are accepted: see here for a list.

  • (Help)