2021年1月9日にオンラインで開催された第62回プログラミング・シンポジウムにて発表したスライドです．主にSATySFi本体の直近1年での進展のほか，有志の方々が実装してくださった周辺ツールやライブラリを紹介する内容です．

1. 62
2021 1 9

2. • prosym SATYSFI
–
•
–
• DSL
–
–
• /
• SATYSFI → LATEX, HTML
2

3. • prosym SATYSFI
–
•
–
• DSL
–
–
• /
• SATYSFI → LATEX, HTML
3
……

4. • SATySFi
•
•
•
•

5. Better LATEX
•
•
5
cf. LATEX
•
•
! Undefined control sequence.
! Missing $ inserted.
! Missing number, treated as zero.

6. 6
• 2017
•
– “ ”
–
–
–
[ˈsætɪsˌfaɪ]
https://github.com/gfngfn/SATySFi

7. 7
2
+section{SATySFi; }<
+p{
emph{2 }
}
>
let-inline ctx emph it =
let ctx =
ctx |> set-cjk-font
`HiraKakuPro-N`
in
read-inline ctx it
“ ” “ ”
• LATEX
• { … }
< … >
• OCaml
•

8. 8
https://drive.google.com/file/d/1muaWGgyAGfIYJNyKfKvvAzN8vur1sTG3/view?usp=sharing

9. 9
https://drive.google.com/file/d/1jIr1IFCzGeK_xH3wcPYTD4qfZfTruHbh/view?usp=sharing
cite string list
string

10. 10
https://drive.google.com/file/d/1kOCTR6dNnSDQ4e3Vq4WOCEVPls2WJcqV/view?usp=sharing

11. • SATySFi
•
•
•
•

12. 😄
😩
•
12

13. DSL
13
amidakuji(```
|X|-|=|/| |
| |-||-|X|
|=|X|-||=|
|-||-|=|-|
|X|=|-|| |
```);
amidakuji([
[Cross ; Line ; … ];
[Empty ; Line ; … ];
[Double; Cross; … ];
…
]);

14. DSL
•
DSL
[Davies 1996] [Taha & Sheard 2000]
14

15. •
– stage 0, 1, 2, …
• stage 0 stage 1
– Lisp quasiquote
– MetaML [Taha & Sheard 2000] MetaOCaml [Kiselyov 2014]
•
–
–
15

16. •
– ~(…) stage 0
– ~
stage 1
–
– MacroML [Ganz, Sabry & Taha 2001]
16
repeat@~(3){foo}
%
% foofoofoo

17. •
•
– @`…`
17
amidakuji@~(@```
|X|-|=|/| |
| |-||-|X|
|=|X|-||=|
|-||-|=|-|
|X|=|-|| |
```);

18. 18
https://drive.google.com/file/d/1X-56ORxZHgNiqH5_ylwQi7XkT0DYLyXA/view?usp=sharing
DSL

19. 19
DSL
https://drive.google.com/file/d/1BQhXnoOA_ZPp8bYnLB5Oo_5WN5E83y8S/view?usp=sharing
DSL
3, 4
1

20. • SATySFi
•
•
•
•

21. • SATYSFI Satyrographos [Sakamoto 2018]
– github.com/na4zagin3/satyrographos
– OCaml opam
–
– Sakamoto (@na4zagin3)
• Satyrographos
• Satyrographos: SATySFi
• [Matsunaga 2020]
– satyrographos-packages.netlify.app
– 2021 1 50
(1/3)
21

22. • satysfi-base [Nishiwaki, Murase & Kaneko 2019]
– github.com/nyuichi/satysfi-base
–
•
• etc.
• etc.
–
– DSL
• Steamer [Ishii 2018] SLyDIFi [Mogami 2019]
– github.com/konn/satysfi-steamer
– github.com/monaqa/slydifi
–
(2/3)
22

23. • easytable [Mogami 2020] github.com/monaqa/satysfi-easytable
–
• matrixcd [Abe 2020] github.com/abenori/satysfi-matrixcd
– tikz-cd
• make-latex [Kaneko 2020] github.com/puripuri2100/SATySFi-make-latex
– SATYSFI
LATEX
•
•
(3/3)
23

24. • Slack
– satysfi.slack.com
– Kaneko (@puripuri2100)
• SATYSFI Conf 2020
– Kaneko (@puripuri2100)
Mogami (@mo_naqa)
2020 7 25 cluster
24

25. • SATySFi
•
•
•
•

26. •
–
–
•
– LATEX HTML
•
–
• ……
26

27. •
–
–
•
– LATEX HTML
•
–
• ……
27

28. • OCaml
– API
“ ”
Stack
28
module Stack : (sig
type α t
val empty : α t
val push : α -> α t -> α t
val pop : α t -> (α * α t) option
end) = struct
type α t = α list
let empty = []
let push x s = x :: s
⋮
end

29. • OCaml
– API
“ ”
Stack
29
module Stack : (sig
type α t
val empty : α t
val push : α -> α t -> α t
val pop : α t -> (α * α t) option
end) = struct
type α t = α list
let empty = []
let push x s = x :: s
⋮
end
Stack

30. 30
module Stack : (sig
type α t
val empty : α t
val push : α -> α t -> α t
val pop : α t -> (α * α t) option
end) = struct
type α t = α list
let empty = []
let push x s = x :: s
⋮
end
Stack
α Stack.t
• OCaml
– API
“ ”
Stack

31. •
–
1
•
•
–
•
31
%
@require: stdjareport
@require: code
⋮

32. •
F-ing modules [Rossberg, Russo & Dreyer 2014]
–
– “ ”
• 1 1
–
–
• @require
–
SATYSFI Sesterl
32

33. 33
@require code
module PyCode =
Code.Make(struct
val base-font = (`Menlo`, 1., 0.)
val highlight = Code.Syntax.python3
end)
⋮
{… PyCode.show(`print(“Hi!”)`); …}
•
– code
– API
•
@require code
⋮
{… code(`print(“Hi!”)`); …}
Code.Make
PyCode

34. • SATySFi
•
•
•
•

35. •
– https://github.com/gfngfn/SATySFi
–
–
• DSL
•
•
– F-ing modules
–
–
35

36. B5 / 160
https://booth.pm/
ja/items/1127224
satysfi book

37. • Rowan Davies. A temporal-logic approach to binding-time analysis. In Proc. of LICS’96, pages
184–195, 1996.
• Steve Ganz, Amr Sabry, and Walid Taha. Macros as multi-stage computations: type-safe,
generative, binding macros in MacroML. In Proc. of ICFP’01, pages 74–85, 2001.
• Oleg Kiselyov. The design and implementation of BER MetaOCaml. In Functional and Logic
Programming. FLOPS 2014. Lecture Notes in Computer Science, vol 8475, 2014.
• Andreas Rossberg, Claudio Russo, and Derek Dreyer. F-ing modules. Journal of Functional
Programming, 24(5), pp. 529–607, 2014.
• Walid Taha and Tim Sheard. Multi-stage programming with explicit annotations. Theoretical
Computer Science, 248 (1-2), pages 211–242, 2000.
37