Jump to content

Talk:Proof assistant

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Horaceb (talk | contribs) at 10:38, 5 July 2016. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

WikiProject iconComputer science Start‑class High‑importance
WikiProject iconThis article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
HighThis article has been rated as High-importance on the project's importance scale.
Things you can help WikiProject Computer science with:

WikiProject iconMathematics Start‑class Mid‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-priority on the project's priority scale.


See also (merge?) Computer-assisted proof Outs 10:05, 12 September 2007 (UTC)[reply]

Human help

  • "a human can guide the search for proofs"

Agda


Small Kernel

I have experience of using Agda and Coq, and as far as I know their source code neither of them has a small kernel. --Konstantin.Solomatov (talk) 05:15, 20 July 2014 (UTC)[reply]

Comparison table: contents and meaning?

It would be great to add the logic language and rules used by the system (even if some PA like Isabel can deal with more than one set of rules).

I edited the table where I thought some of the feature evaluations were unclear. What are "partial" dependent types, for instance? There either are or aren't some types dependent on specific values. So far as I know, that's the definition of dependent types. If someone wants to put "partial" back, could they please explain what it means? Similarly for proof automation, ACL2 and PVS---which do not have small trusted computing bases---were listed as having "partial" automation because the automation is unverified; i.e., it is in the TCB. That seems already addressed in the Small Kernel section, to me.

This is a minor improvement, but I think overall it's not clear why the specific set of features in the table were chosen, or what exactly constitutes "partial" or N/A. Nothing in the table has a citation, for instance, to show that some reputable source both considers these criteria significant and agrees with the results presented here.

MisterCarl (talk) 22:23, 20 September 2012 (UTC)[reply]