-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathecethesis.out
75 lines (75 loc) · 4.7 KB
/
ecethesis.out
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
\BOOKMARK [0][-]{chapter.1}{Chapter 1 Introduction}{}% 1
\BOOKMARK [0][-]{chapter.2}{Chapter 2 Context Free Syntax}{}% 2
\BOOKMARK [1][-]{section.2.1}{K Explanation}{chapter.2}% 3
\BOOKMARK [2][-]{subsection.2.1.1}{K Labels}{section.2.1}% 4
\BOOKMARK [2][-]{subsection.2.1.2}{Strict}{section.2.1}% 5
\BOOKMARK [1][-]{section.2.2}{Syntax Explanation}{chapter.2}% 6
\BOOKMARK [1][-]{section.2.3}{Implementation of Section 10.2}{chapter.2}% 7
\BOOKMARK [1][-]{section.2.4}{Implementation of Section 10.5}{chapter.2}% 8
\BOOKMARK [2][-]{subsection.2.4.1}{Modules}{section.2.4}% 9
\BOOKMARK [2][-]{subsection.2.4.2}{ImpDecls}{section.2.4}% 10
\BOOKMARK [2][-]{subsection.2.4.3}{TopDecls}{section.2.4}% 11
\BOOKMARK [2][-]{subsection.2.4.4}{Decls}{section.2.4}% 12
\BOOKMARK [2][-]{subsection.2.4.5}{LExp}{section.2.4}% 13
\BOOKMARK [2][-]{subsection.2.4.6}{AExp}{section.2.4}% 14
\BOOKMARK [0][-]{chapter.3}{Chapter 3 Configuration}{}% 15
\BOOKMARK [1][-]{section.3.1}{Alpha}{chapter.3}% 16
\BOOKMARK [1][-]{section.3.2}{Beta}{chapter.3}% 17
\BOOKMARK [2][-]{subsection.3.2.1}{Example}{section.3.2}% 18
\BOOKMARK [1][-]{section.3.3}{Delta}{chapter.3}% 19
\BOOKMARK [2][-]{subsection.3.3.1}{Example}{section.3.3}% 20
\BOOKMARK [1][-]{section.3.4}{Import Data Structure}{chapter.3}% 21
\BOOKMARK [1][-]{section.3.5}{Modules}{chapter.3}% 22
\BOOKMARK [0][-]{chapter.4}{Chapter 4 Context-Sensitive Checks}{}% 23
\BOOKMARK [1][-]{section.4.1}{Data Types}{chapter.4}% 24
\BOOKMARK [2][-]{subsection.4.1.1}{Polymorphim}{section.4.1}% 25
\BOOKMARK [1][-]{section.4.2}{Datatype Constructors}{chapter.4}% 26
\BOOKMARK [2][-]{subsection.4.2.1}{Type}{section.4.2}% 27
\BOOKMARK [2][-]{subsection.4.2.2}{Data}{section.4.2}% 28
\BOOKMARK [2][-]{subsection.4.2.3}{Newtype}{section.4.2}% 29
\BOOKMARK [2][-]{subsection.4.2.4}{Context}{section.4.2}% 30
\BOOKMARK [1][-]{section.4.3}{Initial Data Structures}{chapter.4}% 31
\BOOKMARK [2][-]{subsection.4.3.1}{Example T}{section.4.3}% 32
\BOOKMARK [2][-]{subsection.4.3.2}{K Code}{section.4.3}% 33
\BOOKMARK [1][-]{section.4.4}{context-sensitive Checks}{chapter.4}% 34
\BOOKMARK [2][-]{subsection.4.4.1}{Name Collision}{section.4.4}% 35
\BOOKMARK [2][-]{subsection.4.4.2}{Type Constructor Collision}{section.4.4}% 36
\BOOKMARK [2][-]{subsection.4.4.3}{Alpha Cycle Check}{section.4.4}% 37
\BOOKMARK [2][-]{subsection.4.4.4}{Argument Sort Check}{section.4.4}% 38
\BOOKMARK [2][-]{subsection.4.4.5}{Polymorphic Parameter Check}{section.4.4}% 39
\BOOKMARK [0][-]{chapter.5}{Chapter 5 Inferencing}{}% 40
\BOOKMARK [1][-]{section.5.1}{Type theory}{chapter.5}% 41
\BOOKMARK [2][-]{subsection.5.1.1}{Simply Typed Lambda Calculus}{section.5.1}% 42
\BOOKMARK [2][-]{subsection.5.1.2}{System F}{section.5.1}% 43
\BOOKMARK [2][-]{subsection.5.1.3}{Hindley-Milner}{section.5.1}% 44
\BOOKMARK [2][-]{subsection.5.1.4}{Meta Language}{section.5.1}% 45
\BOOKMARK [1][-]{section.5.2}{Data Structures}{chapter.5}% 46
\BOOKMARK [2][-]{subsection.5.2.1}{Transform T into Beta}{section.5.2}% 47
\BOOKMARK [2][-]{subsection.5.2.2}{Construct Beta}{section.5.2}% 48
\BOOKMARK [2][-]{subsection.5.2.3}{Construct Delta}{section.5.2}% 49
\BOOKMARK [1][-]{section.5.3}{Definition of Substitution}{chapter.5}% 50
\BOOKMARK [1][-]{section.5.4}{Inference Algorithm}{chapter.5}% 51
\BOOKMARK [2][-]{subsection.5.4.1}{Variable Rule}{section.5.4}% 52
\BOOKMARK [2][-]{subsection.5.4.2}{Constant Rule}{section.5.4}% 53
\BOOKMARK [2][-]{subsection.5.4.3}{Lambda Rule}{section.5.4}% 54
\BOOKMARK [2][-]{subsection.5.4.4}{Application Rule}{section.5.4}% 55
\BOOKMARK [2][-]{subsection.5.4.5}{IfThenElse Rule}{section.5.4}% 56
\BOOKMARK [1][-]{section.5.5}{Mutual Recursion}{chapter.5}% 57
\BOOKMARK [2][-]{subsection.5.5.1}{LetIn Rule}{section.5.5}% 58
\BOOKMARK [1][-]{section.5.6}{Helper Functions}{chapter.5}% 59
\BOOKMARK [1][-]{section.5.7}{Fresh Instance}{chapter.5}% 60
\BOOKMARK [1][-]{section.5.8}{GEN}{chapter.5}% 61
\BOOKMARK [1][-]{section.5.9}{Unification Algorithm}{chapter.5}% 62
\BOOKMARK [2][-]{subsection.5.9.1}{Identity}{section.5.9}% 63
\BOOKMARK [2][-]{subsection.5.9.2}{Non-Identity}{section.5.9}% 64
\BOOKMARK [2][-]{subsection.5.9.3}{K Code}{section.5.9}% 65
\BOOKMARK [1][-]{section.5.10}{Composition of Substitutions}{chapter.5}% 66
\BOOKMARK [1][-]{section.5.11}{Example}{chapter.5}% 67
\BOOKMARK [0][-]{chapter.6}{Chapter 6 Multiple Module Support}{}% 68
\BOOKMARK [1][-]{section.6.1}{Algorithm}{chapter.6}% 69
\BOOKMARK [0][-]{chapter.7}{Chapter 7 Conclusion}{}% 70
\BOOKMARK [0][-]{appendix.A}{Appendix A haskell-syntax.k}{}% 71
\BOOKMARK [0][-]{appendix.B}{Appendix B haskell-configuration.k}{}% 72
\BOOKMARK [0][-]{appendix.C}{Appendix C haskell-preprocessing.k}{}% 73
\BOOKMARK [0][-]{appendix.D}{Appendix D haskell-type-inferencing.k}{}% 74
\BOOKMARK [0][-]{appendix*.18}{References}{}% 75