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
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
|
;;; beluga-mode.el --- Major mode for Beluga source code -*- coding: utf-8; lexical-binding:t -*-
;; Copyright (C) 2009-2018 Free Software Foundation, Inc.
;; Author: Stefan Monnier <monnier@iro.umontreal.ca>
;; Maintainer: beluga-dev@cs.mcgill.ca
;; Version: 0
;; Keywords:
;; This program is free software; you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
;; This program is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with this program. If not, see <http://www.gnu.org/licenses/>.
;;; Commentary:
;; BUGS
;; - Indentation thinks "." can only be the termination marker of
;; an LF declaration. This can mess things up badly.
;; - Indentation after curried terms like "fn x => fn y =>" is twice that
;; after "fn x y =>".
;;; Code:
(eval-when-compile (require 'cl-lib))
(require 'smie)
(require 'ansi-color)
(add-hook 'compilation-filter-hook 'ansi-color-compilation-filter)
(provide 'beluga-unicode-input-method)
(require 'quail)
(defconst beluga-input-method-name
"beluga-unicode"
"The name of the Beluga unicode input method.")
(quail-define-package
beluga-input-method-name ;; name
"UTF-8" ;; language
"B" ;; mode-line "title"
t ;; guidance
"Beluga unicode input method: actually replaces keyword strings with
a single unicode character instead of merely representing the keywords
in unicode using Font Lock mode."
nil nil nil nil nil nil nil nil nil nil t)
;; This very final t is the SIMPLE flag of quail-define-package, and
;; causes Quail to not affect the meanings of C-{f,b,n,p} or TAB.
(quail-define-rules
;; Greek letters
("\\alpha" ["α"])
("\\Alpha" ["Α"])
("\\beta" ["β"])
("\\Beta" ["Β"])
("\\gamma" ["γ"])
("\\Gamma" ["Γ"])
("\\delta" ["δ"])
("\\Delta" ["Δ"])
("\\epsilon" ["ε"])
("\\Epsilon" ["Ε"])
("\\zeta" ["ζ"])
("\\Zeta" ["Ζ"])
("\\eta" ["η"])
("\\Eta" ["Η"])
("\\theta" ["θ"])
("\\Theta" ["Θ"])
("\\iota" ["ι"])
("\\Iota" ["Ι"])
("\\kappa" ["κ"])
("\\Kappa" ["Κ"])
("\\lambda" ["λ"])
("\\Lambda" ["Λ"])
("\\lamda" ["λ"])
("\\Lamda" ["Λ"])
("\\mu" ["μ"])
("\\Mu" ["Μ"])
("\\nu" ["ν"])
("\\Nu" ["Ν"])
("\\xi" ["ξ"])
("\\Xi" ["Ξ"])
("\\omicron" ["ο"])
("\\Omicron" ["Ο"])
("\\pi" ["π"])
("\\Pi" ["Π"])
("\\rho" ["ρ"])
("\\Rho" ["Ρ"])
("\\sigma" ["σ"])
("\\Sigma" ["Σ"])
("\\tau" ["τ"])
("\\Tau" ["Τ"])
("\\upsilon" ["υ"])
("\\Upsilon" ["Υ"])
("\\phi" ["φ"])
("\\Phi" ["Φ"])
("\\chi" ["χ"])
("\\Chi" ["Χ"])
("\\psi" ["ψ"])
("\\Psi" ["Ψ"])
("\\omega" ["ω"])
("\\Omega" ["Ω"])
;; Common logical symbol
("\\conj" ["∧"])
("\\disj" ["∨"])
("\\imp" ["⊃"])
("\\top" ["⊤"])
("\\bot" ["⊥"])
("\\equiv" ["≣"])
;; Arrows
("->" ["→"])
("<-" ["←"])
("=>" ["⇒"])
;;LF
("|-" ["⊢"])
("\\not" ["¬"])
("::" ["∷"])
("FN" ["Λ"])
)
(defgroup beluga-mode ()
"Editing support for the Beluga language."
:group 'languages)
(defvar beluga-mode-map
(let ((map (make-sparse-keymap)))
(define-key map "\C-c\C-c" 'compile)
(define-key map "\C-c\C-l" 'beluga-highlight-holes)
(define-key map "\C-c\C-e" 'beluga-erase-holes)
(define-key map "\C-c\C-x" 'beluga-run-command)
(define-key map "\C-c\C-t" 'beluga-get-type)
(define-key map "\C-c\C-s" 'beluga-split-hole)
(define-key map "\C-c\C-i" 'beluga-intro-hole)
(define-key map "\C-c\C-j" 'beluga-hole-jump)
(define-key map "\C-c\C-p" 'beluga-hole-info)
map))
(defvar beluga-mode-syntax-table
(let ((st (make-syntax-table)))
(modify-syntax-entry ?% "< 14" st)
(modify-syntax-entry ?\{ "(}2 b" st)
(modify-syntax-entry ?\} "){3 b" st)
(modify-syntax-entry ?\n ">" st)
;; the following line breaks using / in identifiers
;; (modify-syntax-entry ?/ "$/" st)
;; For application of dependent arguments "exp A < ctx . term >", we'd want
;; <..> to match, but that breaks ->, <-, and other things.
;; (modify-syntax-entry ?< "(>" st)
;; (modify-syntax-entry ?> ")<" st)
; see https://emacs.stackexchange.com/a/4149 for a possible solution
(modify-syntax-entry ?# "'" st)
(modify-syntax-entry ?< "." st)
(modify-syntax-entry ?> "." st)
(modify-syntax-entry ?- "." st)
(modify-syntax-entry ?| "." st)
(modify-syntax-entry ?= "." st)
(modify-syntax-entry ?\' "_" st)
st))
(defun beluga--proc-live-p (process)
"Return non-nil if PROCESS is alive.
A process is considered alive if its status is `run', `open',
`listen', `connect' or `stop'."
(and (not (eq process nil))
(memq (process-status process)
'(run open listen connect stop))))
(defun beluga-font-lock-compose-symbol (alist)
"Compose a sequence of ascii chars into a symbol.
Regexp match data 0 points to the chars."
;; Check that the chars should really be composed into a symbol.
(let* ((start (match-beginning 0))
(end (match-end 0))
(syntaxes (cond
((eq (char-syntax (char-after start)) ?w) '(?w))
;; Special case for the . used for qualified names.
((and (eq (char-after start) ?\.) (= end (1+ start)))
'(?_ ?\\ ?w))
(t '(?_ ?\\))))
sym-data)
(if (or (memq (char-syntax (or (char-before start) ?\ )) syntaxes)
(memq (char-syntax (or (char-after end) ?\ )) syntaxes)
(memq (get-text-property start 'face)
'(font-lock-doc-face font-lock-string-face
font-lock-comment-face))
(and (consp (setq sym-data (cdr (assoc (match-string 0) alist))))
(let ((pred (cadr sym-data)))
(setq sym-data (car sym-data))
(funcall pred start))))
;; No composition for you. Let's actually remove any composition
;; we may have added earlier and which is now incorrect.
(remove-text-properties start end '(composition))
;; That's a symbol alright, so add the composition.
(compose-region start end sym-data)))
;; Return nil because we're not adding any face property.
nil)
(defun beluga-font-lock-symbols-keywords ()
(when (and (fboundp 'compose-region) beluga-font-lock-symbols)
(let ((alist nil))
(dolist (x beluga-font-lock-symbols-alist)
(when (and (if (fboundp 'char-displayable-p)
(char-displayable-p (if (consp (cdr x)) (cadr x) (cdr x)))
t)
(not (assoc (car x) alist))) ;Not yet in alist.
(push x alist)))
(when alist
`((,(regexp-opt (mapcar #'car alist) t)
(0 (beluga-font-lock-compose-symbol ',alist)
;; In Emacs-21, if the `override' field is nil, the face
;; expressions is only evaluated if the text has currently
;; no face. So force evaluation by using `keep'.
keep)))))))
(defconst beluga-syntax-id-re
"[[:alpha:]_][[:alnum:]!'-@~$*/^&+=_]*"
"A regexp for matching a Beluga identifier.")
(defconst beluga-syntax-fundec-re
(regexp-opt '("rec" "proof") 'symbols)
"A regexp for matching a function declaration.
Note that this will also match the 'and' keyword!")
(defvar beluga-imenu-generic-expression
`(("Schemas"
,(concat "^[ \t]*schema[ \t\n]+\\(" beluga-syntax-id-re "\\)") 1)
("Constructors"
,(concat "^\\(" beluga-syntax-id-re "\\)[ \t\n]*:") 1)
("Type Constructors"
,(concat "^\\(?:inductive[ \t]+\\(" beluga-syntax-id-re
"\\)\\|\\(?1:" beluga-syntax-id-re
"\\)[ \t\n]*:[^.]*\\<type\\>[ \t\n]*.\\)")
1)
("Functions"
,(concat beluga-syntax-fundec-re "[ \t\n]+\\(" beluga-syntax-id-re "\\)") 1)))
(define-obsolete-variable-alias 'beluga-interpreter-path
;; A "path" is a list of file names, as in $PATH, $MANPATH.
'beluga-interpreter-name "Sep-2010")
(defcustom beluga-interpreter-name "beluga"
"Name of the interpreter executable."
:type 'string)
;;---------------------------- Interactive mode ----------------------------;;
(define-error 'beluga-interactive-error "Beluga interactive error")
(defun beluga-interactive-error (&rest data)
(signal 'beluga-interactive-error data))
;; ------ process management ----- ;;
(defvar beluga--proc ()
"Contain the process running beli.")
(make-variable-buffer-local 'beluga--proc)
(defvar beluga--output-wait-time
0.025
"How long to wait for output from Beluga on each iteration.")
(defvar beluga--output-timeout
1.0
"How long to wait in total for output before giving up.")
(defvar beluga--output-timer 0.0)
(defun beluga--proc ()
(unless (beluga--proc-live-p beluga--proc) (beluga-start))
beluga--proc)
(defun beluga-start ()
"Start an inferior Beluga Interactive process with the -emacs option.
The process is put into a buffer called \"*beluga*\"."
(interactive)
(unless (beluga--proc-live-p beluga--proc)
(setq beluga--proc
(get-buffer-process
(make-comint "beluga"
beluga-interpreter-name
nil "-I" "-emacs" ))))
beluga--proc)
(defun beluga-quit ()
"Stop the Beluga interactive process by sending the quit command.
This is a graceful termination."
(interactive)
(beluga--rpc "quit"))
(defun beluga-stop ()
"Stop the beli process."
(interactive)
(when (processp 'beluga--proc)
(kill-process 'beluga--proc)))
;; ----- Stuff for hole overlays ----- ;;
(defvar beluga--holes-overlays ()
"Will contain the list of hole overlays so that they can be resetted.")
(make-variable-buffer-local 'beluga--holes-overlays)
(defun beluga-sorted-holes ()
(cl-labels
((hole-comp (a b)
(let* ((s1 (overlay-start a))
(s2 (overlay-start b)))
(< s1 s2))))
(sort beluga--holes-overlays #'hole-comp)))
(defface beluga-holes
'((t :background "cyan")) ;; :foreground "white"
"Face used to highlight holes in Beluga mode.")
(defun beluga--pos (line bol offset)
;; According to http://caml.inria.fr/mantis/view.php?id=5159,
;; `line' can refer to line numbers in various source files,
;; whereas `bol' and `offset' refer to "character" (byte?) positions within
;; the actual parsed stream.
;; So if there might be #line directives, we need to do:
;; (save-excursion
;; (goto-char (point-min))
;; (forward-line (1- line)) ;Lines count from 1 :-(
;; (+ (point) (- offset bol))))
;; But as long as we know there's no #line directive, we can ignore all that
;; and use the more efficient code below. When #line directives can appear,
;; we will need to make further changes anyway, such as passing the file-name
;; to select the appropriate buffer.
;; Emacs considers the first character in the file to be at index 1,
;; but the Beluga lexer starts counting at zero, so we need to add
;; one here.
(+ (point-min) offset))
(defun beluga--create-overlay (pos)
"Create an overlay at the position described by POS (a Loc.to_tuple)."
(let* (;; (file-name (nth 0 pos))
(start-line (nth 1 pos))
(start-bol (nth 2 pos))
(start-off (nth 3 pos))
(stop-line (nth 4 pos))
(stop-bol (nth 5 pos))
(stop-off (nth 6 pos))
(ol
(make-overlay (beluga--pos start-line start-bol start-off)
(beluga--pos stop-line stop-bol stop-off))))
(overlay-put ol 'face 'beluga-holes)
ol))
(defun beluga-erase-holes ()
(interactive)
(mapc #'delete-overlay beluga--holes-overlays)
(setq beluga--holes-overlays nil))
;; ----- Interaction with the interactive mode ----- ;;
;; Sending and receiving strings from the inferior process.
;; Ultimately, all you really need to use is beluga--rpc to send a
;; command to the interactive mode and get back a string response.
(defun beluga--wait (proc)
(assert (eq (current-buffer) (process-buffer proc)))
(setq beluga--output-timer 0.0)
(while (progn
(goto-char comint-last-input-end)
(not (re-search-forward ".*?;" nil t)))
(accept-process-output proc beluga--output-wait-time)
(setq beluga--output-timer (+ beluga--output-timer beluga--output-wait-time))
(when (> beluga--output-timer beluga--output-timeout)
(error "Beluga command didn't produce complete output"))))
(defun beluga--chomp (str)
"Chomp leading and tailing whitespace from STR."
(replace-regexp-in-string (rx (or (: bos (* (any " \t\n")))
(: (* (any " \t\n")) eos)))
""
str))
(defun beluga--trim (str)
(let ((str2 (beluga--chomp str)))
(substring str2 0 (1- (length str2)))))
(defun beluga--send (cmd)
"Send CMD to beli."
; (interactive)
(let ((proc (beluga--proc)))
(with-current-buffer (process-buffer proc)
;; We could also just use `process-send-string', but then we wouldn't
;; have the input text in the buffer to separate the various prompts.
(goto-char (point-max))
(insert (concat "%:" cmd))
(comint-send-input)
(beluga--wait proc))))
(defun beluga--receive ()
"Read the last output of beli."
(let ((proc (beluga--proc)))
(with-current-buffer (process-buffer proc)
(beluga--wait proc)
(beluga--trim (buffer-substring-no-properties comint-last-input-end (point-max))))))
(defun beluga--rpc (cmd)
(beluga--send cmd)
(beluga--receive))
(defun beluga--is-response-error (resp)
"Determine whether a Beluga RPC response (RESP) is an error."
(string= "-" (substring resp 0 1)))
(defun beluga--rpc! (cmd)
"Variant of beluga--rpc that signals an error if CMD fails."
(let ((resp (beluga--rpc cmd)))
(when (beluga--is-response-error resp)
(beluga-interactive-error (list (format "%s" (substring resp 2)))))
resp))
(defvar beluga--last-load-time
'(0 0 0 0)
"The last time the file was loaded into the Beluga interpreter.
This variable is updated by `beluga--maybe-save-load-current-buffer'.")
(make-variable-buffer-local 'beluga--last-load-time)
(defun beluga--should-reload-p ()
"Decide whether the current buffer should be reloaded into beli.
The `visited-file-modtime' is compared to `beluga--last-load-time'.
If the former is greater than the latter, then the former is
returned. Else, nil is returned."
(let ((mtime (visited-file-modtime)))
(when (> (float-time mtime) (float-time beluga--last-load-time))
mtime)))
;; ----- Beluga Interactive basic functions ----- ;;
;; Each of these functions directly corresponds to a command in src/core/command.ml
;; Since the construction of these functions is totally tedious and
;; straightforward, we define a macro to do the real work.
;; This macro takes:
;; * the name of the function to define, e.g. beluga--printhole
;; * the real name of the command to invoke, e.g. "printhole"
;; * the arguments of the function, e.g. '((hole . "%s"))
;;
;; Note: the type of each argument is specified as a printf-style
;; format code. That's because the construction of the command will
;; construct a string formatting routine using these codes.
;;
;; What about constant portions of the string?
;; If you want to supply a constant portion in the format string,
;; simply provide a string as-is in the argument list.
;; e.g. ((hole . "%s") "with" (exp . "%s"))
;;
;; Two separate functions are generated by the macro invocation. The
;; first uses exactly the given function name, but the second appends
;; "!". This bang-variant will use beluga--rpc! under the hood, so you
;; get an exception-raising variant of every function for free.
(defun beluga--generate-format-string (args)
"Construct the format string from the ARGS."
(cons
"%s"
(mapcar
(lambda (x)
(if (stringp x)
x
(cdr x)))
args)))
(defun beluga--generate-arg-list (args)
"Construct a list of symbols representing the function arguments from ARGS."
(mapcar 'car (cl-remove-if 'stringp args)))
(defun beluga--define-command (rpc name realname args)
(let ((arglist (beluga--generate-arg-list args))
(fmt (beluga--generate-format-string args)))
`(defun ,name ,arglist
(,rpc
(format
;; construct the format string
,(mapconcat 'identity fmt " ")
;; construct the argument list
,realname ,@arglist)))))
(defmacro beluga-define-command (name realname args)
`(progn
,(beluga--define-command 'beluga--rpc name realname args)
,(beluga--define-command 'beluga--rpc! (intern (concat (symbol-name name) "!")) realname args)))
(beluga-define-command beluga--basic-chatteron "chatteron" nil)
(beluga-define-command beluga--basic-chatteroff "chatteroff" nil)
(beluga-define-command beluga--basic-load "load" ((path . "%s")))
(beluga-define-command beluga--basic-clearholes "clearholes" nil)
(beluga-define-command beluga--basic-countholes "countholes" nil)
(beluga-define-command beluga--basic-lochole "lochole" ((hole . "%s")))
(beluga-define-command beluga--basic-lochole-n "lochole" ((hole . "%d")))
(beluga-define-command beluga--basic-printhole "printhole" ((hole . "%s")))
(beluga-define-command beluga--basic-printhole-n "printhole" ((hole . "%d")))
(beluga-define-command beluga--basic-types "types" nil)
(beluga-define-command beluga--basic-constructors-lf "constructors" ((type . "%s")))
(beluga-define-command beluga--basic-fill "fill" ((hole . "%s") "with" (exp . "%s")))
(beluga-define-command beluga--basic-split "split" ((hole . "%s") (var . "%s")))
(beluga-define-command beluga--basic-intro "intro" ((hole . "%s")))
(beluga-define-command beluga--basic-constructors "constructors-comp" ((type . "%s")))
(beluga-define-command beluga--basic-signature "fsig" ((fun . "%s")))
(beluga-define-command beluga--basic-printfun "fdef" ((fun . "%s")))
(beluga-define-command beluga--basic-query "query" ((expected . "%s") (tries . "%s") (type . "%s")))
(beluga-define-command beluga--basic-get-type "get-type" ((line . "%d") (col . "%d")))
(beluga-define-command beluga--basic-reset "reset" nil)
(beluga-define-command beluga--basic-quit "quit" nil)
(beluga-define-command beluga--basic-lookuphole "lookuphole" ((hole . "%s")))
;; ----- Higher-level commands ----- ;;
;; These build off the basic commands, and will typically do something
;; like parse the response or display it in a message.
(defun beli ()
"Start beli mode."
(interactive)
(beluga-start))
(defun beluga-run-command (cmd)
"Run CMD in beli."
(interactive "MCommand: ")
(message "%s" (beluga--rpc cmd)))
(defun beluga--maybe-save ()
(if (buffer-modified-p)
(if (y-or-n-p "Save current file? ")
(save-buffer)
())))
(defun beluga-get-type ()
"Get the type at the current cursor position (if it exists)."
(interactive)
(message "%s" (beluga--basic-get-type (count-lines 1 (point)) (current-column))))
(defun beluga--load-current-buffer (&optional mtime)
"Load the current buffer in Beluga Interactive.
This command signals an error if loading fails.
The optional MTIME parameter, if given, will be written to `beluga--last-load-time'."
(let ((resp (beluga--basic-load! (buffer-file-name))))
(when mtime
(setq beluga--last-load-time mtime))
resp))
(defun beluga--maybe-save-load-current-buffer ()
"Load the current buffer if it has either never been loaded, or
modified since the last time it was loaded.
This will update `beluga--last-load-time' if a load is performed."
;; prompt the user to save the buffer if it is modified
(beluga--maybe-save)
;; retrieve the last time the file was written to disk, checking
;; whether a reload should occur
(let ((mtime (beluga--should-reload-p)))
(when mtime ;; mtime non-nil means we must reload
(beluga--load-current-buffer mtime))))
(defun beluga--lochole-n! (hole-num)
(read (beluga--basic-lochole-n! hole-num)))
(defun beluga--countholes! ()
"Get the number of holes in the file."
(string-to-number (beluga--basic-countholes!)))
(defun beluga--lookup-hole! (hole)
"Look up a hole number by its name (HOLE)."
(string-to-number (beluga--basic-lookuphole! hole)))
(defun beluga--highlight-holes ()
"Create overlays for each of the holes and color them."
(beluga-erase-holes)
(let ((numholes (beluga--countholes!)))
(dotimes (i numholes)
(let* ((pos (beluga--lochole-n! i))
(ol (beluga--create-overlay pos))
(info (beluga--basic-printhole-n! i)))
(overlay-put ol 'help-echo info)
(push ol beluga--holes-overlays)
))))
(defun beluga--get-hole-overlay! (hole)
"Get the overlay associated with HOLE."
(nth (beluga--lookup-hole! hole) (beluga-sorted-holes)))
(defun beluga--apply-quail-completions (str)
(if (string= current-input-method beluga-input-method-name)
(replace-regexp-in-string "=>" "⇒"
(replace-regexp-in-string "|-" "⊢" str))
str))
(defun beluga--insert-formatted (str start)
(goto-char start)
(insert (beluga--apply-quail-completions str))
(indent-region start (+ start (length str))))
(defun beluga--error-no-such-hole (n)
(message "Couldn't find hole %s - make sure the file is loaded" n))
(defconst beluga-named-hole-re
"\\_<?\\(\\sw+\\)\\_>")
(defun beluga-named-hole-at-point ()
"Retrieve the name of the hole at point, if any.
If e.g. point is over \"?abracadabra\", then this function returns
\"abracadabra\". Else, if point is not over a valid hole, then this
function returns nil."
(let ((thing (thing-at-point 'symbol)))
(when (and thing (string-match beluga-named-hole-re thing))
(match-string 1 thing))))
(defun beluga--prompt-with-hole-at-point (prompt)
"Prompt the user to specify a hole, giving the named hole at point
as the default if any."
(let ((name (beluga-named-hole-at-point)))
(if name
(read-string (format "%s (%s): " prompt name)
nil nil name)
(read-string (format "%s: " prompt)))))
(defun beluga--begin-command ()
"Perform necessary setup to begin a compound Beluga Interactive command.
Specifically, the following are performed, if necessary:
- Starting the Beluga inferior process.
- Saving the current buffer.
- Loading the current buffer into Beluga.
- Highlighting holes."
(beluga-start)
(beluga--maybe-save-load-current-buffer)
(beluga--highlight-holes))
(defun beluga--prompt-string (prompt)
"Prompts the user to input a string."
(read-string (format "%s: " prompt)))
;; ----- Top-level commands ----- ;;
(defun beluga-load ()
"Load the current file in Beluga Interactive.
This command will start the interactive mode if necessary and
prompt for saving."
(interactive)
(beluga-start)
(let ((r (beluga--maybe-save-load-current-buffer)))
(if r
(message "%s" r)
(message "Buffer does not require reload."))))
(defun beluga-highlight-holes ()
"Create overlays for each of the holes and color them."
(interactive)
(beluga--begin-command))
(defun beluga-hole-info (hole)
(interactive
(list
(beluga--prompt-with-hole-at-point "Hole to query")))
(beluga--begin-command)
(let ((resp (beluga--basic-printhole! hole)))
(message resp)))
(defun beluga-split-hole (hole var)
"Split on HOLE."
(interactive
(list
(beluga--prompt-with-hole-at-point "Hole to split at")
(beluga--prompt-string "Variable to split")))
(beluga--begin-command)
(let ((resp (beluga--basic-split! hole var))
(ovr (beluga--get-hole-overlay! hole)))
(if ovr
(let ((start (overlay-start ovr))
(end (overlay-end ovr)))
(delete-overlay ovr)
(delete-region start end)
(beluga--insert-formatted (format "(%s)" resp) start)
(save-buffer)
(beluga--load-current-buffer)
(beluga--highlight-holes))
(beluga--error-no-such-hole hole))))
(defun beluga-intro-hole (hole)
"Introduce variables into HOLE"
(interactive
(list
(beluga--prompt-with-hole-at-point "Hole to introduce variables into")))
(beluga--begin-command)
(let ((resp (beluga--basic-intro! hole))
(ovr (beluga--get-hole-overlay! hole)))
(if ovr
(let ((start (overlay-start ovr))
(end (overlay-end ovr)))
(delete-overlay ovr)
(delete-region start end)
(beluga--insert-formatted resp start)
(save-buffer)
(beluga--load-current-buffer)
(beluga--highlight-holes))
(beluga--error-no-such-hole hole))))
(defun beluga-hole-jump (hole)
(interactive "sHole to jump to: ")
(beluga--begin-command)
(let ((ovr (beluga--get-hole-overlay! hole)))
(if ovr
(goto-char (+ 1 (overlay-start ovr)))
(beluga--error-no-such-hole hole))))
(define-obsolete-function-alias 'hole-jump #'beluga-hole-jump "Jul-2018")
;; ----- Beluga indentation and navigation via SMIE ----- ;;
(defconst beluga-syntax-pragma-re
"--\\(\\(name\\|query\\|infix\\|prefix\\|assoc\\).*?\\.\\|\\w+\\)"
"A regexp for matching a Beluga pragma.
Long pragmas continue until a `.` is found, e.g. `--name oft D.`.
Short pragmas consist of only one word, e.g. `--nostrengthen`.
It's easy to use this regex to check which type of pragma (long or short)
was matched: simply check whether `match-string' 2 is non-nil. In that case,
a long pragma was matched and the result is the name of the long pragma.
Otherwise, `match-string' 1 will contain the name of the matched short.")
(defconst beluga-slim-arrows
'("->" "<-" "→" "←")
"A list of the slim arrow strings.")
(defconst beluga-fat-arrows
'("=>" "⇒")
"A list of the fat arrow strings.")
(defconst beluga-punct-re
(regexp-opt `(,@beluga-fat-arrows ,@beluga-slim-arrows "\\" "." "<" ">" "," ";" "..")))
(defconst beluga-syntax-keyword-re
(regexp-opt
'("FN" "and" "block" "case" "inductive" "LF" "coinductive"
"stratified" "else" "ffalse" "fn" "if" "in" "impossible" "let"
"mlam" "of" "rec" "proof" "schema" "some" "then" "type" "ctype" "ttrue"
"typedef"
"module" "struct" "end" "#stratified" "#positive" "fun")
'symbols)
"A regular expression to match any beluga keyword.")
(defface beluga-font-lock-annotation
'((t :inherit italic))
"Face used for Beluga's /.../ annotations.")
(defconst beluga-font-lock-keywords
`((,beluga-syntax-pragma-re . ,font-lock-warning-face)
,beluga-syntax-keyword-re
("/\\s-*\\_<\\(total\\)\\_>.*?/"
(0 'beluga-font-lock-annotation)
(1 'font-lock-keyword-face prepend))
(,(concat
"^\\(" beluga-syntax-id-re "\\)"
"\\s-*" ":"
"\\([^.]*\\_<type\\_>\\s-*.\\)?")
;; This is a regexp that can span multiple lines, so it may not
;; always highlight properly. `font-lock-multiline' tries to help.
(0 (if (match-end 2) '(face nil font-lock-multiline t)))
(1 (if (match-end 2)
font-lock-type-face font-lock-variable-name-face)))
(,(concat "^\\(?:schema\\|inductive\\|coinductive\\|LF\\|stratified\\)" "\\s-+"
"\\(" beluga-syntax-id-re "\\)")
(1 font-lock-type-face))
(,(concat beluga-syntax-fundec-re "\\s-+\\(" beluga-syntax-id-re "\\)")
(2 font-lock-function-name-face))
))
(defcustom beluga-indent-basic 4
"Basic amount of indentation."
:type 'integer)
(defun beluga-smie-forward-token ()
; skip all whitespace and comments
(forward-comment (point-max))
(cond
((looking-at "\\.[ \t]*$")
;; One of the LF-terminating dots.
(progn (forward-char 1) ";."))
((looking-at beluga-syntax-pragma-re)
;; move point to the end of the long-pragma name if a long-pragma was matched.
;; otherwise, move it to the end of the short pragma name.
(goto-char (or (match-end 2) (match-end 1)))
;; set to non-nil by beluga-syntax-pragma-re if the pragma is a long-form pragma
(if (match-string 2)
"--longpragma"
"--shortpragma"))
(t
; otherwise, we return a chunk of text that starts at point and
; ends according to the following `cond` check.
(buffer-substring-no-properties
(point)
(progn
(cond
((looking-at beluga-punct-re) (goto-char (match-end 0)))
((not (zerop (skip-syntax-forward "w_'"))))
;; In case of non-ASCII punctuation.
((not (zerop (skip-syntax-forward ".")))))
(point))))))
(defun beluga-short-pragma-before-p ()
"Decide whether there is a short pragma before point.
Return the starting position of the short pragma; else, nil."
(save-excursion
;; idea: move backward across word-characters, and then check if
;; there are two dashes before point.
(skip-syntax-backward "w")
(save-match-data
(when (looking-back "--" (- (point) 2))
(match-beginning 0)))))
(defun beluga-smie-backward-token ()
(forward-comment (- (point-max)))
(cond
((and (eq ?\. (char-before))
(looking-at "[ \t]*$") ;; "[ \t]*\\(?:$\\|[0-9]\\(\\)\\)"
(not (looking-back "\\.\\." (- (point) 2))))
;; Either an LF-terminating dot, or a projection-dot.
(progn (forward-char -1) ";."))
((setq pos (beluga-short-pragma-before-p))
(goto-char pos)
"--shortpragma")
(t
(buffer-substring-no-properties
(point)
(progn
(cond
((looking-back beluga-punct-re (- (point) 2) 'greedy)
(goto-char (match-beginning 0)))
((not (zerop (skip-syntax-backward "w_'"))))
;; In case of non-ASCII punctuation.
((not (zerop (skip-syntax-backward ".")))))
(point))))))
(defun beluga-smie-grammar (bnf resolvers precs)
(smie-prec2->grammar
(smie-merge-prec2s
(apply #'smie-bnf->prec2 bnf resolvers)
(smie-precs->prec2 precs))))
(defconst beluga-smie-grammar
;; The "." used for terminating LF declarations is syntactically completely
;; different from the "." used in the binding forms. Conflating the two
;; leads here to a lot of precedence conflicts, so we try and guess the two
;; based on a heuristic in the tokenizing code.
(beluga-smie-grammar
;; FIXME: without this dummy, "=>" is marked as "open paren" because it
;; can only bind to `atom' on the left.
'((atom ("--dummy--"))
(def (exp "=" exp) (atom ":" exp))
(decl
(atom ":" type)
(datatypes)
("schema" sdef)
("let" def)
("--shortpragma")
("--longpragma" atom)
(recs))
(datatypes
("inductive" datatype-def)
("coinductive" datatype-def)
("LF" datatype-def)
("stratified" datatype-def)
(datatypes "and" datatypes))
(simpletype
(simpletype "->" simpletype)
(simpletype "→" simpletype)
(simpletype "←" simpletype)
(simpletype "<-" simpletype))
(recs
("rec" def)
("proof" def)
(recs "and" recs))
(decls
(decl)
(decls ";" decls)
(decls ";." decls))
;; FIXME: only allow simple types here, otherwise we get nasty
;; precedence conflicts between "." and ",". In practice, this seems to
;; be sufficient.
(sdecl
(atom ":" type))
(sdecls
(sdecl)
(sdecls "," sdecls))
(dotted-type
(sdecls "|-" type)
(sdecls "⊢" type))
(type
(simpletype)
("\\" atom "." type) ;dotted-type
("block" sdecls "." type) ;dotted-type
;; ("{" blabla "}" type) ; FIXME!
;; FIXME: the projection via "." creates precedence conflicts.
;; (type "." atom)
)
(sdef
(atom "=" schema))
(schema
(type)
;; Not sure if it's correct, and create precedence conflicts.
;; ("some" sdecls "block" sdecls "." schema)
)
(datatype-name
(atom ":" type))
(datatype-def
(datatype-name "=" datatype-branches))
(datatype-branches
(datatype-branches "|" datatype-branches)
(atom ":" type))
(exp
("if" exp "then" exp "else" exp)
(type)
("let" def "in" exp)
("fun" atom "=>" exp)
("fun" atom "⇒" exp)
("fn" atom "=>" exp)
("fn" atom "⇒" exp)
("FN" atom "=>" exp)
("FN" atom "⇒" exp)
("mlam" atom "=>" exp)
("mlam" atom "⇒" exp)
("<" dotted-type ">")
("case" exp "of" cases))
(exps
(exps ";" exps)
(exp))
;; Separate cases/branch so that "|" is recognized as associative.
(cases
(branch)
(cases "|" cases))
(branch
(atom "=>" exp)
(atom "⇒" exp)))
; resolvers
`(((assoc ";" ";."))
((assoc ,@beluga-slim-arrows))
((assoc ","))
((assoc "and"))
((nonassoc "of") (assoc "|")) ; Trailing | ambiguity.
;; '((nonassoc "\\") (nonassoc ".")) ; Trailing . ambiguity.
;; '((nonassoc "block") (nonassoc ".")) ; Trailing . ambiguity.
)
;; The above BNF grammar should cover this already, so this ends up only
;; useful to check that the BNF entails the expected precedences.
; precs
`((assoc ";")
(assoc ",")
(left ":")
(assoc ,@beluga-slim-arrows)
(nonassoc " -dummy- ")))) ;Bogus anchor at the end.
(defconst beluga-pattern-fat-arrow
`(or ,@beluga-fat-arrows)
"A pattern for use in pcase that matches any fat arrow string.")
(defun beluga-rule-parent-p (parents)
`(smie-rule-parent-p ,@parents))
(defun beluga-smie-indent-rules (method token)
(pcase `(,method . ,token)
(`(:elem . basic)
beluga-indent-basic)
; describe the tokens that introduce lists (with no separators)
(`(:list-intro . ,(or ":" "fn" "fun" "FN" "mlam"))
't)
; if the token is a pipe preceded by an '=' or 'of', then we
; indent by adding the basic offset
(`(:before . ,(and "|" (guard (smie-rule-prev-p "=" "of" "fun"))))
2)
; if the token is a pipe, (and the preceding check didn't pass, so
; it isn't the first pipe in a sequence) then we consider it a
; separator
(`(method . ,"|")
(smie-rule-separator method))
(`(:after . ,"of")
beluga-indent-basic)
(`(:after . ,"in")
(when (smie-rule-hanging-p)
(smie-rule-parent)))
(`(:after . ,(and "=" (guard (smie-rule-parent-p "rec"))))
(smie-rule-parent))
(`(:after . ,(and "=" (guard (smie-rule-parent-p "proof"))))
(smie-rule-parent))
; if the token is a form that will use => eventually but is
; preceded by a =>, then this is a chain, e.g.
; mlam G => mlam Q => fn x => fn y =>
; (code should be here, not indented 8 characters)
(`(:before
.
,(and
(or "case" "fn" "FN" "mlam" "fun")
(guard `(smie-rule-prev-p ,@beluga-fat-arrows))))
(smie-rule-parent))
(`(:after . ".")
(smie-rule-parent))
(`(:after . ,(and ":" (guard (smie-rule-parent-p "{"))))
(smie-rule-parent 1))
(`(:after . ,(or ":" "let" "if"))
(smie-rule-parent beluga-indent-basic))
(`(:before
.
,(and "=" (guard `(smie-rule-parent-p ,@beluga-type-declaration-keywords))))
(smie-rule-parent))
))
;;---------------------------- Loading of the mode ----------------------------;;
;;;###autoload
(add-to-list 'auto-mode-alist '("\\.s?bel\\'" . beluga-mode))
(defconst beluga-type-declaration-keywords
'("inductive" "coinductive" "LF" "stratified")
"The different keywords that introduce a type definition.")
(defconst beluga-type-declaration-keywords-re
(regexp-opt beluga-type-declaration-keywords 'symbols)
"A regular expression that matches any type definition keyword.")
;;;###autoload
(define-derived-mode beluga-mode prog-mode "Beluga"
"Major mode to edit Beluga source code."
(set (make-local-variable 'imenu-generic-expression)
beluga-imenu-generic-expression)
(set (make-local-variable 'outline-regexp)
(concat beluga-syntax-fundec-re "\\|^(inductive\\|coinductive\\|LF\\|stratified)\\_>"))
(set (make-local-variable 'require-final-newline) t)
(when buffer-file-name
(set (make-local-variable 'compile-command)
;; Quite dubious, but it's the intention that counts.
(concat beluga-interpreter-name
" "
(shell-quote-argument buffer-file-name))))
(set (make-local-variable 'comment-start) "%")
(set (make-local-variable 'comment-start-skip) "%[%{]*[ \t]*")
(set (make-local-variable 'comment-end-skip) "[ \t]*\\(?:\n\\|}%\\)")
(comment-normalize-vars)
(set (make-local-variable 'electric-indent-chars)
(append '(?|) (if (boundp 'electric-indent-chars)
electric-indent-chars
'(?\n))))
;QUAIL
(add-hook 'beluga-mode-hook
(lambda () (set-input-method "beluga-unicode")))
;Turn off hilighting
(setq input-method-highlight-flag nil)
(smie-setup
beluga-smie-grammar
'beluga-smie-indent-rules
:forward-token #'beluga-smie-forward-token
:backward-token #'beluga-smie-backward-token)
(set (make-local-variable 'parse-sexp-ignore-comments) t)
(set
(make-local-variable 'font-lock-defaults)
'(beluga-font-lock-keywords
nil
nil
()
nil
(font-lock-syntactic-keywords . nil)))
(message "beluga-mode loaded"))
(provide 'beluga-mode)
;;; beluga-mode.el ends here
|