1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909
|
;; coq.el Major mode for Coq proof assistant
;; Copyright (C) 1994 - 1998 LFCS Edinburgh.
;; Author: Healfdene Goguen
;; Maintainer: Pierre Courtieu <courtieu@lri.fr>
;; coq.el,v 8.0 2004/04/17 23:39:58 da Exp
(require 'proof)
(require 'holes) ; in generic directory
;; coq-syntaxe is required below
;; ----- coq-shell configuration options
(defcustom coq-prog-name "coqtop -emacs"
"*Name of program to run as Coq."
:type 'string
:group 'coq)
;; Command to initialize the Coq Proof Assistant
(defcustom coq-default-undo-limit 100
"Maximum number of Undo's possible when doing a proof."
:type 'number
:group 'coq)
(defconst coq-shell-init-cmd
(format "Set Undo %s. " coq-default-undo-limit))
;; da 15/02/03: moved setting of coq-version-is-vX to coq-syntax to
;; fix compilation
(require 'coq-syntax)
(require 'coq-indent)
;; Command to reset the Coq Proof Assistant
;; Pierre: added Impl... because of a bug of Coq until V6.3
;; (included). The bug is already fixed in the next version (V7). So
;; we will backtrack this someday.
(defconst coq-shell-restart-cmd
"Reset Initial.\n Implicit Arguments Off. ")
(defvar coq-shell-prompt-pattern (concat "^" proof-id " < ")
"*The prompt pattern for the inferior shell running coq.")
;; FIXME da: this was disabled (set to nil) -- why?
(defvar coq-shell-cd "Cd \"%s\". "
"*Command of the inferior process to change the directory.")
(defvar coq-shell-abort-goal-regexp "Current goal aborted"
"*Regexp indicating that the current goal has been abandoned.")
(defvar coq-shell-proof-completed-regexp "Subtree proved!"
"*Regular expression indicating that the proof has been completed.")
(defvar coq-goal-regexp
"\\(============================\\)\\|\\(subgoal [0-9]+ is:\\)\n")
;; Configuration
(setq tags-always-exact t) ; Tags is unusable with Coq library otherwise:
(defun coq-library-directory ()
(let ((c (substring (shell-command-to-string "coqtop -where") 0 -1 )))
(if (string-match c "not found")
"/usr/local/lib/coq"
c)))
(defcustom coq-tags (concat (coq-library-directory) "/theories/TAGS")
"the default TAGS table for the Coq library"
:type 'string
:group 'coq)
(defconst coq-interrupt-regexp "User Interrupt."
"Regexp corresponding to an interrupt")
;; ----- web documentation
(defcustom coq-www-home-page "http://coq.inria.fr/"
"Coq home page URL."
:type 'string
:group 'coq)
;; ----- coq specific menu is defined in coq-abbrev.el
(cond
(coq-version-is-V8 (require 'coq-abbrev))
(t (require 'coq-abbrev-V7))
)
(defun coq-insert-section (s)
(interactive "sSection name: ")
(let ((p (point)))
(insert "Section " s ".\n#\nEnd " s ".")
(replace-string-by-holes-backward-move-point 1 empty-hole-string)
(goto-char p)
(set-point-next-hole-destroy))
)
(defconst module-kinds-table
'(("Module" 1) ("Module Type" 2) ("Declare Module" 3))
"Enumerates the different kinds of modules.")
(defconst modtype-kinds-table
'(("" 1) (":" 2) ("<:" 3))
"Enumerates the different kinds of type information for modules.")
(defun coq-insert-module ()
(interactive)
(let* ((mods (completing-read "kind of module (tab to see list): " module-kinds-table))
(s (read-string "Module name: "))
(typkind (completing-read "kind of type (optional, tab to see list): " modtype-kinds-table))
(p (point)))
(if (string-equal typkind "")
(progn
(insert mods " " s ".\n#\nEnd " s ".")
(replace-string-by-holes-backward-move-point 1 empty-hole-string)
(goto-char p))
(insert mods " " s " " typkind " #.\n#\nEnd " s ".")
(replace-string-by-holes-backward-move-point 2 empty-hole-string)
(goto-char p)
(set-point-next-hole-destroy))
)
)
; (completing-read "Section name: " )
;; ----- outline
(defvar coq-outline-regexp
(concat "(\\*\\|" (proof-ids-to-regexp
'(
"Tactic" "Axiom" "Parameter" "Parameters" "Variable" "Variables" "Syntax" "Grammar" "Syntactic" "Load" "Require" "Import" "Hint" "Hints" "Hypothesis" "Correctness" "Module" "Section" "Chapter" "Goal" "Lemma" "Theorem" "Fact" "Remark" "Record" "Inductive" "Mutual" "Definition" "Fixpoint" "Save" "Qed" "Defined" "End" "Coercion"))))
(defvar coq-outline-heading-end-regexp "\\*\)\n\\|\\.\n")
(defvar coq-shell-outline-regexp coq-goal-regexp)
(defvar coq-shell-outline-heading-end-regexp coq-goal-regexp)
(defconst coq-kill-goal-command "Abort. ")
(defconst coq-forget-id-command "Reset %s. ")
(defconst coq-back-n-command "Back %s. ") ; Pierre: added
(defconst coq-state-changing-tactics-regexp
(proof-ids-to-regexp coq-state-changing-tactics))
(defconst coq-state-preserving-tactics-regexp
(proof-ids-to-regexp coq-state-preserving-tactics))
(defconst coq-tactics-regexp
(proof-ids-to-regexp coq-tactics))
(defconst coq-state-changing-commands-regexp
(proof-ids-to-regexp coq-keywords-state-changing-commands))
(defconst coq-state-preserving-commands-regexp
(proof-ids-to-regexp coq-keywords-state-preserving-commands))
(defvar coq-retractable-instruct-regexp
(proof-ids-to-regexp coq-retractable-instruct))
(defvar coq-non-retractable-instruct-regexp
(proof-ids-to-regexp coq-non-retractable-instruct))
(defvar coq-keywords-section
(cond
(coq-version-is-V74 '("Section" "Module\\-+Type" "Declare\\s-+Module" "Module"))
(t '("Section"))))
(defvar coq-section-regexp
(concat "\\(" (proof-ids-to-regexp coq-keywords-section) "\\)")
; "\\(\\<Section\\>\\|\\<Module\\>\\-+\\<Type\\>\\|\\<Module\\>\\)"
)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Derived modes - they're here 'cos they define keymaps 'n stuff ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(eval-and-compile
(define-derived-mode coq-shell-mode proof-shell-mode
"coq-shell" nil
(coq-shell-mode-config)))
(eval-and-compile
(define-derived-mode coq-response-mode proof-response-mode
"CoqResp" nil
(coq-response-config)))
(eval-and-compile
(define-derived-mode coq-mode proof-mode
"coq" nil
(coq-mode-config)))
(eval-and-compile
(define-derived-mode coq-goals-mode proof-goals-mode
"CoqGoals" nil
(coq-goals-mode-config)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Code that's coq specific ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun coq-set-undo-limit (undos)
(proof-shell-invisible-command (format "Set Undo %s. " undos)))
;;
;; FIXME Papageno 05/1999: must take sections in account.
;;
;; da: have now combined count-undos and find-and-forget, they're the
;; same now we deal with nested proofs and send general sequence
;; "Abort. ... Abort. Back n. Undo n."
;;
(defconst coq-keywords-decl-defn-regexp
(proof-ids-to-regexp (append coq-keywords-decl coq-keywords-defn))
"Declaration and definition regexp.")
; Pierre: This is a try, for use in find-and-forget. It seems to work but
; is it correct with respect to the asynchronous communication between Coq
; and emacs?
; DA: should be okay, communication is not as asynchronous as you think
(defun coq-proof-mode-p ()
"Allows to know if we are currentlly in proof mode.
Look at the last line of the *coq* buffer to see if the prompt is the
toplevel \"Coq <\". Returns nil if yes. This assumes that no
\"Resume\" or \"Suspend\" command has been used."
(not (string-match "^Coq < " proof-shell-last-prompt)))
;; Pierre: May 29 2002 added a "Back n. " command in order to
;; synchronize more accurately.
;; DA: rewrote to combine behaviour with count-undos, to work with
;; nested proofs.
(defun coq-is-comment-or-proverprocp (span)
(memq (span-property span 'type) '(comment proverproc)))
(defun coq-is-goalsave-p (span) (eq (span-property span 'type) 'goalsave))
(defun coq-is-module-equal-p (str) ;;cannot appear vith coq < 7.4
(and (proof-string-match "\\`\\(Declare\\s-\\)?\\s-*\\<Module\\>.*:=" str)
(not (proof-string-match "\\<with\\>" str))))
(defun coq-is-def-p (str)
(proof-string-match (concat "\\`Definition\\s-+\\(" proof-id "\\)\\s-*") str))
(defun coq-is-decl-defn-p (str)
(proof-string-match
(concat "\\`\\(" coq-keywords-decl-defn-regexp "\\)\\s-*\\("
proof-id "\\)\\s-*[\\[,:.]") str))
(defun coq-state-preserving-command-p (str)
(proof-string-match (concat "\\`\\(" coq-state-preserving-commands-regexp "\\)") str))
(defun coq-state-preserving-tactic-p (str)
(proof-string-match (concat "\\`\\(" coq-state-preserving-tactics-regexp "\\)") str))
(defun coq-state-changing-command-p (str)
(proof-string-match (concat "\\`\\(" coq-state-changing-commands-regexp "\\)") str))
; if no second id --> name of the module/section is (match-string 2 str)
; otherwise it is (match-string 5 str)
; to know if there is a second id: (match-string 2 str)="Type" ?
(defun coq-section-or-module-start-p (str)
(proof-string-match
(concat "\\`" coq-section-regexp
"\\s-+\\(" proof-id "\\)\\(\\s-*\\(" proof-id "\\)\\)?") str))
;;(span-at (point) 'type)
;;(span-property (span-at (point) 'type) 'cmd)
(defun coq-find-and-forget (span)
(let (str ans (naborts 0) (nbacks 0) (nundos 0))
(while (and span (not ans))
(setq str (span-property span 'cmd))
(cond
((coq-is-comment-or-proverprocp span)) ; do nothing
;; Module <Type> T ... :=... . inside proof -> like Definition...:=...
;; (should actually be disallowed in coq)
; Should go in last cond, but I have a problem trying to avoid next cond to match.
((and (coq-proof-mode-p) (coq-is-module-equal-p str)) (incf nbacks))
;; FIXME: combine with coq-keywords-decl-defn-regexp case below?
;; [ Maybe not: Section is being treated as a _goal_ command
;; now, so this test has to appear before the goalsave ]
((coq-section-or-module-start-p str)
(if (equal (match-string 2 str) "Type") ;Module Type id: take the third word
(setq ans (format coq-forget-id-command (match-string 5 str)))
(setq ans (format coq-forget-id-command (match-string 2 str))))
;; If we're resetting to beginning of a section from inside, need to fix the
;; nesting depth. FIXME: this is not good enough: the scanning loop exits
;; immediately but Reset has implicit Aborts which are not being counted
;; here. Really we need to set the "master reset" command which subsumes the
;; others, but still count the depth.
(unless (coq-is-goalsave-p span) (decf proof-nesting-depth)))
((coq-is-goalsave-p span)
;; da: try using just Back since "Reset" causes loss of proof state.
(if (span-property span 'nestedundos)
;; Pierre: more robust when some unknown commands are not well backtracked
(if (and (= (span-property span 'nestedundos) 0) (not (coq-proof-mode-p)))
(setq ans (format coq-forget-id-command (span-property span 'name)))
(setq nbacks (+ 1 nbacks (span-property span 'nestedundos))))))
;; Unsaved goal commands: each time we hit one of these
;; we need to issue Abort to drop the proof state.
((coq-goal-command-p str) (incf naborts))
;; If we are already outside a proof, issue a Reset. [ improvement would be
;; to see if the undoing will take us outside a proof, and use the first Reset
;; found if so: but this is tricky to co-ordinate with the number of Backs,
;; perhaps? ]
((and (not (coq-proof-mode-p));; (eq proof-nesting-depth 0)
(coq-is-decl-defn-p str))
(setq ans (format coq-forget-id-command (match-string 2 str))))
;; Outside a proof: cannot be a tactic, if unknown: do back
;; (we may decide otherwise, it is false anyhow, use elisp
;; vars instead for the perfect thing).
((and (not (coq-proof-mode-p)) (not (coq-state-preserving-command-p str)))
(incf nbacks))
;; inside a proof: if known command then back if necessary, nothing otherwise,
;; if known "need not undo tactic" then nothing; otherwise : undo (unknown
;; tactics are considered needing undo, use elisp vars for the 1% remaining).
;; no undo if abort
((coq-proof-mode-p)
(cond
((coq-state-changing-command-p str) (incf nbacks))
((and (eq 0 naborts)
(not (coq-state-preserving-command-p str))
(not (coq-state-preserving-tactic-p str)))
(incf nundos)))))
(setq span (next-span span 'type)))
;; Now adjust proof-nesting depth according to the number of proofs we've passed
;; out of. FIXME: really this adjustment should be on the successful completion
;; of the Abort commands, as a callback.
(setq proof-nesting-depth (- proof-nesting-depth naborts))
(setq ans
(concat
(if (stringp ans) ans)
(if (> naborts 0)
;; ugly, but blame Coq
(let ((aborts "Abort. "))
(while (> (decf naborts) 0)
(setq aborts (concat "Abort. " aborts)))
aborts))
(if (> nbacks 0)
(concat "Back " (int-to-string nbacks) ". "))
(if (> nundos 0)
(concat "Undo " (int-to-string nundos) ". "))))
(if (null ans) proof-no-command;; FIXME: this is an error really (assert nil);
(if (string-equal ans "") proof-no-command ; not here because if
; we backtrack a state preserving command, we must do
; *nothing*, not even a CR (in v74, no prompt is returned
; with "\n")
ans))))
(defvar coq-current-goal 1
"Last goal that emacs looked at.")
(defun coq-goal-hyp ()
(cond
((looking-at "============================\n")
(goto-char (match-end 0))
(cons 'goal (int-to-string coq-current-goal)))
((looking-at "subgoal \\([0-9]+\\) is:\n")
(goto-char (match-end 0))
(cons 'goal (match-string 1))
(setq coq-current-goal (string-to-int (match-string 1))))
((looking-at proof-shell-assumption-regexp)
(cons 'hyp (match-string 1)))
(t nil)))
(defun coq-state-preserving-p (cmd)
(not (proof-string-match coq-retractable-instruct-regexp cmd)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Commands specific to coq ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun coq-SearchIsos ()
"Search a term whose type is isomorphic to given type
This is specific to coq-mode."
(interactive)
(let (cmd)
(proof-shell-ready-prover)
(setq cmd (read-string
(if coq-version-is-V7 "SearchPattern: " "SearchIsos: ")
nil 'proof-minibuffer-history))
(proof-shell-invisible-command
(format (if coq-version-is-V7 "SearchPattern %s. "
"SearchIsos %s. ") cmd))))
(defun coq-guess-or-ask-for-string (s)
(let ((guess
(if (region-exists-p)
(buffer-substring-no-properties (region-beginning) (region-end))
(symbol-near-point))))
(read-string
(if guess (concat s " (" guess "):")(concat s ":"))
nil 'proof-minibuffer-history guess))
)
(defun coq-Print ()
"Ask for an ident and print the corresponding term"
(interactive)
(let (cmd)
(proof-shell-ready-prover)
(setq cmd (coq-guess-or-ask-for-string "Print"))
(proof-shell-invisible-command
(format "Print %s. " cmd))))
(defun coq-Check ()
"Ask for a term and print its type"
(interactive)
(let (cmd)
(proof-shell-ready-prover)
(setq cmd (coq-guess-or-ask-for-string "Check"))
(proof-shell-invisible-command
(format "Check %s. " cmd))))
(defun coq-Show ()
"Ask for a number i and show the ith goal"
(interactive)
(let (cmd)
(proof-shell-ready-prover)
(setq cmd (read-string "Show Goal number: " nil 'proof-minibuffer-history))
(proof-shell-invisible-command
(format "Show %s. " cmd))))
(defun coq-PrintHint ()
"Print all hints applicable to the current goal"
(interactive)
(proof-shell-invisible-command "Print Hint. "))
(defun coq-end-Section ()
"Ends a Coq section."
(interactive)
(let ((count 1)) ; The number of section already "Ended" + 1
(let ((section
(save-excursion
(progn
(while (and (> count 0)
(search-backward-regexp
"Chapter\\|Section\\|End" 0 t))
(if (char-equal (char-after (point)) ?E)
(setq count (1+ count))
(setq count (1- count))))
(buffer-substring-no-properties
(progn (beginning-of-line) (forward-word 1) (point))
(progn (end-of-line) (point)))))))
(insert (concat "End" section)))))
(defun coq-Compile ()
"compiles current buffer"
(interactive)
(let* ((n (buffer-name))
(l (string-match ".v" n)))
(compile (concat "make " (substring n 0 l) ".vo"))))
(proof-defshortcut coq-Intros "Intros " [(control ?i)])
(proof-defshortcut coq-Apply "Apply " [(control ?a)])
;(proof-defshortcut coq-begin-Section "Section " [(control ?s)])
(define-key coq-keymap [(control ?s)] 'coq-insert-section)
(define-key coq-keymap [(control ?m)] 'coq-insert-module)
(define-key coq-keymap [(control ?e)] 'coq-end-Section)
(define-key coq-keymap [(control ?o)] 'coq-SearchIsos)
(define-key coq-keymap [(control ?p)] 'coq-Print)
(define-key coq-keymap [(control ?c)] 'coq-Check)
(define-key coq-keymap [(control ?h)] 'coq-PrintHint)
;; da: I've moved this three buffer layout into the main code now,
;; making it default for three bufer mode. The function
;; `proof-layout-windows' lays out according to current display
;; mode: you can use this (C-c C-l) to do what binding below did.
;;(define-key coq-keymap [(control f3)] 'coq-three-b)
; This is arguable, but completion with a three key shortcut is bad,
; and the feault meta-/ is bad on some keyboards (especially french ones)
(define-key global-map [(control backspace)] 'expand-abbrev)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Indentation ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; FIXME mmw: code disabled; Is the new indentation scheme general
;; enough to handle Coq as well?
;;; "Case" is represented by 'c' on the stack, and
;;; "CoInductive" is represented by 'C'.
;(defun coq-stack-to-indent (stack)
; (cond
; ((null stack) 0)
; ((null (car (car stack)))
; (nth 1 (car stack)))
; (t (let ((col (save-excursion
; (goto-char (nth 1 (car stack)))
; (current-column))))
; (cond
; ((eq (car (car stack)) ?c)
; (save-excursion (move-to-column (current-indentation))
; (cond
; ((eq (char-after (point)) ?|) (+ col 3))
; ((proof-looking-at "end") col)
; (t (+ col 5)))))
; ((or (eq (car (car stack)) ?I) (eq (car (car stack)) ?C))
; (+ col (if (eq ?| (save-excursion
; (move-to-column (current-indentation))
; (char-after (point)))) 2 4)))
; (t (1+ col)))))))
;
;(defun coq-parse-indent (c stack)
; (cond
; ((eq c ?C)
; (cond ((proof-looking-at "Case")
; (cons (list ?c (point)) stack))
; ((proof-looking-at "CoInductive")
; (forward-char (length "CoInductive"))
; (cons (list c (- (point) (length "CoInductive"))) stack))
; (t stack)))
; ((and (eq c ?e) (proof-looking-at "end") (eq (car (car stack)) ?c))
; (cdr stack))
;
; ((and (eq c ?I) (proof-looking-at "Inductive"))
; (forward-char (length "Inductive"))
; (cons (list c (- (point) (length "Inductive"))) stack))
;
; ((and (eq c ?.) (or (eq (car (car stack)) ?I) (eq (car (car stack)) ?C)))
; (cdr stack))
;
; (t stack)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; To guess the command line options ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun coq-guess-command-line (filename)
"Guess the right command line options to compile FILENAME using `make -n'"
(let ((dir (file-name-directory filename)))
(if (file-exists-p (concat dir "Makefile"))
(let*
((compiled-file (concat (substring
filename 0
(string-match ".v$" filename)) ".vo"))
(command (shell-command-to-string
(concat "cd " dir ";"
"gmake -n -W " filename " " compiled-file
"| sed s/coqc/coqtop/"))))
(concat
(substring command 0 (string-match " [^ ]*$" command))
" -emacs"))
coq-prog-name)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Coq shell startup and exit hooks ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun coq-pre-shell-start ()
(setq proof-prog-name coq-prog-name)
(setq proof-mode-for-shell 'coq-shell-mode)
(setq proof-mode-for-goals 'coq-goals-mode)
(setq proof-mode-for-response 'coq-response-mode)
)
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Configuring proof and pbp mode and setting up various utilities ;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(defun coq-mode-config ()
(setq proof-terminal-char ?\.)
(setq proof-script-command-end-regexp
(if coq-version-is-V7
"\\(?:\\w\\|\\s-\\|\\s)\\|\\(?:\\.\\.\\)+\\)\\.\\(\\s-\\|\\'\\)"
"[.]"))
(setq proof-script-comment-start "(*")
(setq proof-script-comment-end "*)")
(setq proof-unnamed-theorem-name "Unnamed_thm") ; Coq's default name
(setq proof-assistant-home-page coq-www-home-page)
(setq proof-mode-for-script 'coq-mode)
(setq proof-guess-command-line 'coq-guess-command-line)
;; Commands sent to proof engine
(setq proof-showproof-command "Show. "
proof-context-command "Print All. "
proof-goal-command "Goal %s. "
proof-save-command "Save %s. "
proof-find-theorems-command "Search %s. ")
;; FIXME da: Does Coq have a help or about command?
;; proof-info-command "Help"
;; 3.4: this is no longer used: setting to nil
;; enforces use of find-and-forget always.
(setq proof-kill-goal-command nil)
(setq proof-goal-command-p 'coq-goal-command-p
proof-find-and-forget-fn 'coq-find-and-forget
pg-topterm-goalhyp-fn 'coq-goal-hyp
proof-state-preserving-p 'coq-state-preserving-p)
(setq proof-save-command-regexp coq-save-command-regexp
proof-really-save-command-p 'coq-save-command-p ;pierre:deals with Proof <term>.
proof-save-with-hole-regexp coq-save-with-hole-regexp
proof-goal-with-hole-regexp coq-goal-with-hole-regexp
proof-nested-undo-regexp coq-state-changing-commands-regexp
proof-script-imenu-generic-expression coq-generic-expression
)
(setq
;indentation is implemented in coq-indent.el
; proof-indent-enclose-offset (- proof-indent)
; proof-indent-enclose-offset 0
; proof-indent-close-offset 0
; proof-indent-open-offset 0
proof-indent-any-regexp coq-indent-any-regexp
; proof-indent-inner-regexp coq-indent-inner-regexp
; proof-indent-enclose-regexp coq-indent-enclose-regexp
proof-indent-open-regexp coq-indent-open-regexp
proof-indent-close-regexp coq-indent-close-regexp
)
;; span menu
(setq proof-script-span-context-menu-extensions 'coq-create-span-menu)
;; (setq proof-auto-multiple-files t) ; until Coq has real support
;; da: Experimental support for multiple files based on discussions
;; at TYPES 2000.
;; (Pierre, please fix this as Coq users would like, and for Coq V7 !)
(setq coq-proof-shell-inform-file-processed-cmd
"Reset Initial. Compile Module %m. ")
;; FIXME da: Coq is rather quiet when reading files with "Load <foo>."
;; and sometimes even Require seems quiet? PG would like some guarantees
;; that messages are issued. Also, the code to guess the complete file
;; name is flaky, would be better if Coq displayed full path info for PG.
(setq coq-proof-shell-process-file
;; FIXME da: Coq output Reinterning message should not
;; be suppressed by "Begin Silent" for PG, and should be
;; marked by eager annotation (special char).
;; For Coq 7, we should get rid of 8 bit chars in PG, too.
(cons "Reinterning \\(.+\\)\\.\\.\\.done"
(lambda (str)
(let*
((modname (match-string 1 str))
;; FIXME: next lines will return a directory but maybe
;; not right one if proof-script-buffer happens to be nil!
(buf (or proof-script-buffer
proof-previous-script-buffer))
(dir (if (buffer-live-p buf)
(with-current-buffer buf
default-directory)
;; This next guess is pretty hopeless.
default-directory)))
(message "%s%s.v" dir modname)
(format "%s%s.v" dir modname)))))
;; FIXME da: coq-proof-shell-inform-file-retracted-cmd, etc, need
;; defvars somewhere to avoid compiler warnings (or TBD: easy-config)
(setq coq-proof-shell-inform-file-retracted-cmd
;; da: This is a HORRIBLE fragile hack! Instead of issuing a
;; command to the prover we have to run a "coqdep" command to
;; find out the dependencies.
(lambda (fname)
(let*
;; Assume buffer is in correct directory, assume current directory
;; is writeable, assume we have GNU make, etc, etc.
;; I hope Coq V7 will provide this operation for us as
;; a builtin (it should print out a series of messages which
;; are matched by proof-shell-retract-files-regexp, one for
;; each dependency).
;; [In fact, I think this is what should happen when
;; Require is undone]
((depstr
(substring (shell-command-to-string
(concat
"coqdep *.v | grep "
(file-name-nondirectory
(file-name-sans-extension fname)) ".v"
" | awk '{print $1}' | sed 's/.vo:/.v/'")) 0 -1))
(deps (split-string depstr))
(current-included proof-included-files-list))
;; Now hack the proof-included-files-list to remove the
;; dependencies of the retracted file and remove the
;; locked regions
;; FIXME: this is too low-level delving in PG. Should
;; do with proof-shell-retract-files-regexp really.
(mapcar (lambda (dep)
(setq proof-included-files-list
(delete (file-truename dep)
proof-included-files-list)))
deps)
(proof-restart-buffers
(proof-files-to-buffers
(set-difference current-included
proof-included-files-list)))
;; Return a comment thingy inserted into the shell
;; buffer to help debugging.
(format "Print (* Proof General ran coqdep command for %s, result: %s. Removed files: %s *)" fname depstr deps))))
;;Coq V7 changes this
(setq proof-shell-start-silent-cmd
(if coq-version-is-V7 "Set Silent. " "Begin Silent. ")
proof-shell-stop-silent-cmd
(if coq-version-is-V7 "Unset Silent. " "End Silent. "))
; (setq proof-shell-start-silent-cmd "Begin Silent. "
; proof-shell-stop-silent-cmd "End Silent. ")
(coq-init-syntax-table)
;; font-lock
(setq font-lock-keywords coq-font-lock-keywords-1)
(proof-config-done)
;; outline
(make-local-variable 'outline-regexp)
(setq outline-regexp coq-outline-regexp)
(make-local-variable 'outline-heading-end-regexp)
(setq outline-heading-end-regexp coq-outline-heading-end-regexp)
;; tags
(and (boundp 'tag-table-alist)
(setq tag-table-alist
(append '(("\\.v$" . coq-tags)
("coq" . coq-tags))
tag-table-alist)))
(setq blink-matching-paren-dont-ignore-comments t)
;; hooks and callbacks
(add-hook 'proof-pre-shell-start-hook 'coq-pre-shell-start nil t))
(defun coq-shell-mode-config ()
(setq
proof-shell-prompt-pattern coq-shell-prompt-pattern
proof-shell-cd-cmd coq-shell-cd
proof-shell-filename-escapes '(("\\\\" . "\\\\") ("\"" . "\\\""))
proof-shell-abort-goal-regexp coq-shell-abort-goal-regexp
proof-shell-proof-completed-regexp coq-shell-proof-completed-regexp
proof-shell-error-regexp coq-error-regexp
proof-shell-interrupt-regexp coq-interrupt-regexp
proof-shell-assumption-regexp coq-id
pg-subterm-first-special-char ?\360
proof-shell-wakeup-char ?\371 ; done: prompt
;; The next three represent path annotation information
pg-subterm-start-char ?\372 ; not done
pg-subterm-sep-char ?\373 ; not done
pg-subterm-end-char ?\374 ; not done
pg-topterm-char ?\375 ; done
proof-shell-eager-annotation-start "\376\\|\\[Reinterning"
proof-shell-eager-annotation-start-length 12
proof-shell-eager-annotation-end "\377\\|done\\]" ; done
proof-shell-annotated-prompt-regexp
(concat proof-shell-prompt-pattern
(char-to-string proof-shell-wakeup-char)) ; done
proof-shell-result-start "\372 Pbp result \373"
proof-shell-result-end "\372 End Pbp result \373"
proof-shell-start-goals-regexp "[0-9]+ subgoals?"
proof-shell-end-goals-regexp proof-shell-annotated-prompt-regexp
proof-shell-init-cmd ; (concat
coq-shell-init-cmd
; Coq has no global settings?
; (proof-assistant-settings-cmd))
proof-shell-restart-cmd coq-shell-restart-cmd
pg-subterm-anns-use-stack t)
(coq-init-syntax-table)
(setq font-lock-keywords coq-font-lock-keywords-1)
(proof-shell-config-done))
(defun coq-goals-mode-config ()
(setq pg-goals-change-goal "Show %s. ")
(setq pg-goals-error-regexp coq-error-regexp)
(coq-init-syntax-table)
(setq font-lock-keywords coq-font-lock-keywords-1)
(proof-goals-config-done))
(defun coq-response-config ()
(coq-init-syntax-table)
(setq font-lock-keywords coq-font-lock-keywords-1)
(proof-response-config-done))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Flags and other settings for Coq.
;;
;; da: neither of these work very well.
;; I think "time" must just be for special search isos top level,
;; and "Focus" on works during a proof, so sending the setting
;; at the start of a session is wrong.
;(defpacustom time-search-isos nil
; "Whether to display timing of SearchIsos in Coq."
; :type 'boolean
; :setting ("Time. " . "Untime. "))
(defpacustom print-only-first-subgoal nil
"Whether to just print the first subgoal in Coq."
:type 'boolean
:setting ("Focus. " . "Unfocus. "))
(defpacustom auto-compile-vos nil
"Whether to automatically compile vos and track dependencies."
:type 'boolean
:eval (if coq-auto-compile-vos
(setq proof-shell-inform-file-processed-cmd
coq-proof-shell-inform-file-processed-cmd
proof-shell-process-file
coq-proof-shell-process-file
proof-shell-inform-file-retracted-cmd
coq-proof-shell-inform-file-retracted-cmd)
(setq proof-shell-inform-file-processed-cmd nil
proof-shell-process-file nil
proof-shell-inform-file-retracted-cmd nil)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Subterm markup -- it was added to Coq by Healf, but got removed.
;; Let's try faking something by regexp matching.
;; FIXME: not operational yet
(defun coq-fake-constant-markup ()
"Markup constants in Coq goal output by matching on regexps.
This is a horrible and approximate way of doing subterm markup.
\(Code used to be in Coq, but got lost between versions 5 and 7).
This is a hook setting for `pg-after-fontify-output-hook' to
enable identifiers to be highlighted and allow useful
mouse activation."
(goto-char (point-min))
(while (re-search-forward "\(\w+[^\w]\)" nil t)
(replace-match "\372\200\373\\1\374" nil t)))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Context-senstive in-span menu additions
;;
;; da: message to Pierre: I just put these in as examples,
;; maybe you can suggest some better commands to use on
;; `thm'. (Check maybe not much use since appears before
;; in the buffer anyway)
(defun coq-create-span-menu (span idiom name)
(if (string-equal idiom "proof")
(let ((thm (span-property span 'name)))
(list (vector
"Check"
`(proof-shell-invisible-command
,(format "Check %s." thm)))
(vector
"Print Proof"
`(proof-shell-invisible-command
,(format "Print Proof %s." thm))))))
(if (string-equal idiom "proof")
(let ((thm (span-property span 'name)))
(list (vector
"Check"
`(proof-shell-invisible-command
,(format "Check %s." thm))))))
)
;load the default coq abbrev file if no coq abbrev file is already read
(if (and (boundp 'coq-mode-abbrev-table)
(not (equal coq-mode-abbrev-table (make-abbrev-table))))
(message "An abbrev table exists for coq, no default loaded")
(progn
(quietly-read-abbrev-file "coq-abbrev.el")
(message "coq default abbreviations loaded"))
)
(provide 'coq)
;;; Local Variables: ***
;;; tab-width:2 ***
;;; fill-column: 85 ***
;;; indent-tabs-mode:nil ***
;;; End: ***
|