Penrose - 通过纯文本键入数学符号来创建图表

hbghlyj

penrose.cs.cmu.edu/
一个集合论的例子:

它由以下 Domain, Substance, Style programs 指定
setTheory.domain:

1. type Set
3. predicate Not(Prop p1)
4. predicate Intersecting(Set s1, Set s2)
5. predicate IsSubset(Set s1, Set s2)

复制代码

tree.substance:

1. Set A, B, C, D, E, F, G
3. IsSubset(B, A)
4. IsSubset(C, A)
5. IsSubset(D, B)
6. IsSubset(E, B)
7. IsSubset(F, C)
8. IsSubset(G, C)
10. Not(Intersecting(E, D))
11. Not(Intersecting(F, G))
12. Not(Intersecting(B, C))
14. AutoLabel All

复制代码

venn.style:

1. canvas {
2.   width = 800
3.   height = 700
4. }
6. forall Set x {
7.   x.icon = Circle {
8.     strokeWidth : 0
9.   }
11.   x.text = Equation {
12.     string : x.label
13.     fontSize : "25px"
14.   }
16.   ensure contains(x.icon, x.text)
17.   encourage sameCenter(x.text, x.icon)
18.   x.textLayering = x.text above x.icon
19. }
21. forall Set x; Set y
22. where IsSubset(x, y) {
23.   ensure smallerThan(x.icon, y.icon)
24.   ensure disjoint(y.text, x.icon, 10)
25.   ensure contains(y.icon, x.icon, 5)
26.   x.icon above y.icon
27. }
29. forall Set x; Set y
30. where Not(Intersecting(x, y)) {
31.   ensure disjoint(x.icon, y.icon)
32. }
34. forall Set x; Set y
35. where Intersecting(x, y) {
36.   ensure overlapping(x.icon, y.icon)
37.   ensure disjoint(y.text, x.icon)
38.   ensure disjoint(x.text, y.icon)
39. }

复制代码