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
# frozen_string_literal: true
require "dhall/builtins"
module Dhall
class Expression
def normalize
map_subexpressions(&:normalize)
end
def fusion(*); end
end
class Application
def normalize
return fuse.normalize if fuse
normalized = super
return normalized.fuse if normalized.fuse
if normalized.function.is_a?(Builtin)
return normalized.function.call(*normalized.arguments)
end
normalized
end
def fuse
if function.is_a?(Application)
@fused ||= function.function.fusion(*function.arguments, *arguments)
return @fused if @fused
end
@fused ||= function.fusion(*arguments)
end
end
class Function
end
class Forall; end
class Bool
end
class Variable
end
class Operator
class Or
def normalize
lhs.normalize | rhs.normalize
end
end
class And
def normalize
lhs.normalize & rhs.normalize
end
end
class Equal
def normalize
lhs.normalize.dhall_eq(rhs.normalize)
end
end
class NotEqual
def normalize
normalized = super
if normalized.lhs == Bool.new(value: false)
normalized.rhs
elsif normalized.rhs == Bool.new(value: false)
normalized.lhs
elsif normalized.lhs == normalized.rhs
Bool.new(value: false)
else
normalized
end
end
end
class Plus
def normalize
normalized = super
if normalized.lhs == Natural.new(value: 0)
normalized.rhs
elsif normalized.rhs == Natural.new(value: 0)
normalized.lhs
else
normalized.lhs + normalized.rhs
end
end
end
class Times
def normalize
normalized = super
if [normalized.lhs, normalized.rhs]
.any? { |x| x == Natural.new(value: 0) }
Natural.new(value: 0)
elsif normalized.lhs == Natural.new(value: 1)
normalized.rhs
elsif normalized.rhs == Natural.new(value: 1)
normalized.lhs
else
normalized.lhs * normalized.rhs
end
end
end
class TextConcatenate
def normalize
normalized = super
if normalized.lhs == Text.new(value: "")
normalized.rhs
elsif normalized.rhs == Text.new(value: "")
normalized.lhs
else
normalized.lhs << normalized.rhs
end
end
end
class ListConcatenate
def normalize
lhs.normalize.concat(rhs.normalize)
end
end
end
class List
end
class EmptyList
end
class Optional
end
class OptionalNone
end
class Merge
end
class RecordType
end
class Record
end
class RecordFieldAccess
end
class RecordProjection
end
class UnionType
end
class Union
end
class If
def normalize
if (pred = predicate.normalize).is_a?(Bool)
return pred.reduce(self.then, self.else)
end
normalized = with(
predicate: pred,
then: self.then.normalize,
else: self.else.normalize
)
if normalized.trivial?
pred
elsif normalized.then == normalized.else
normalized.then
else
normalized
end
end
def trivial?
self.then == Bool.new(value: true) &&
self.else == Bool.new(value: false)
end
end
class Number
end
class Natural; end
class Integer; end
class Double; end
class Text
end
class TextLiteral
def normalize
chunks = super.chunks.flat_map { |chunk|
chunk.is_a?(TextLiteral) ? chunk.chunks : chunk
}.chunk { |x| x.is_a?(Text) }.flat_map do |(_, group)|
if group.first.is_a?(Text)
[Text.new(value: group.map(&:value).join)]
else
group
end
end
chunks.length == 1 ? chunks.first : with(chunks: chunks)
end
end
class Import
end
class LetBlock
end
class TypeAnnotation
end
end