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 |
This is a big file! Only the last 128KiB is shown. Click here to download the full log.
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:60.34-36
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 60 | finger_tree::F2(x, y) => f(x) ++ f(y),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + x{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + y{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + z{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:61.37-39 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:61.37-39
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 61 | finger_tree::F3(x, y, z) => f(x) ++ f(y) ++ f(z),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + x{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + y{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + z{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:61.45-47 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:61.45-47
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 61 | finger_tree::F3(x, y, z) => f(x) ++ f(y) ++ f(z),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + x{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + y{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:69.34-36 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:69.34-36
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 69 | finger_tree::N2(x, y) => f(x) ++ f(y),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + x{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + y{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + z{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:70.37-39 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:70.37-39
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 70 | finger_tree::N3(x, y, z) => f(x) ++ f(y) ++ f(z),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + x{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + y{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + z{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:70.45-47 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:70.45-47
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 70 | finger_tree::N3(x, y, z) => f(x) ++ f(y) ++ f(z),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + l{_} : ::std::data::raw::finger_tree::Finger[elem{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : ::std::data::raw::finger_tree::Tree[::std::data::raw::finger_tree::Node[elem{_}]]
00:01:22 ocaml5.1.1-sylvan_stage0> + r{_} : ::std::data::raw::finger_tree::Finger[elem{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:81.31-33 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:81.31-33
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 81 | ++ foldMapTree(foldMapNode(f, _), m)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + l{_} : ::std::data::raw::finger_tree::Finger[elem{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : ::std::data::raw::finger_tree::Tree[::std::data::raw::finger_tree::Node[elem{_}]]
00:01:22 ocaml5.1.1-sylvan_stage0> + r{_} : ::std::data::raw::finger_tree::Finger[elem{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/seq.syl:82.31-33 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/seq.syl:82.31-33
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 82 | ++ foldMapFinger(f, r),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + acc{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::prelude::classes::foldable::Foldable[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::intrinsics::HasField[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/prelude/classes/foldable.syl:31.2-40 has a where
00:01:22 ocaml5.1.1-sylvan_stage0> + clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 0 impls for ::std::intrinsics::HasField:
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/classes/foldable.syl:31.2-40
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 31 | foldMap(toDualEndo, xs).unDual.appEndo(init)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + acc{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::prelude::classes::foldable::Foldable[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (fn(acc{_} : type) -{...e{_}}> acc{_} : type)
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (fn(acc{_} : type) -{...e{_}}> acc{_} : type)
00:01:22 ocaml5.1.1-sylvan_stage0> + - the type of the expression at ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + has arguments applied that would require it to have a different type
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 31 | foldMap(toDualEndo, xs).unDual.appEndo(init)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + acc{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::prelude::classes::foldable::Foldable[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::algebra::endomorphism::Endo[e{_}, acc{_}] : type)
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::algebra::endomorphism::Endo[e{_}, acc{_}] : type) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (fn(acc{_} : type) -{...e{_}}> acc{_} : type)
00:01:22 ocaml5.1.1-sylvan_stage0> + - the type of the expression at ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + has arguments applied that would require it to have a different type
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 31 | foldMap(toDualEndo, xs).unDual.appEndo(init)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + acc{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::prelude::classes::foldable::Foldable[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (fn(acc{_} : type) -{...e{_}}> acc{_} : type)
00:01:22 ocaml5.1.1-sylvan_stage0> + - the type of the expression at ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + has arguments applied that would require it to have a different type
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 31 | foldMap(toDualEndo, xs).unDual.appEndo(init)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + acc{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::prelude::classes::foldable::Foldable[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (::std::intrinsics::FieldType[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, (::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]), "appEndo"] : Type[::std::intrinsics::FieldRepr[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], ::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"], "appEndo"]])
00:01:22 ocaml5.1.1-sylvan_stage0> ...TRUNCATED BY DUNE...
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [::std::algebra::endomorphism::Endo[e{_}, acc{_}]]], EqRefl[RuntimeReprBoxed]]]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[EqRefl[Type], EqSym[?{_}]]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> EqCongApp[?{_}, ?{_}]) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten0{_} : (::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : RuntimeRepr) = (RuntimeReprBoxed : RuntimeRepr)
00:01:22 ocaml5.1.1-sylvan_stage0> + flatten1{_} : (::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"] : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]) = ((::std::algebra::endomorphism::Endo[e{_}, acc{_}] |> ?{_}) : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]])
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : Type[::std::intrinsics::FieldRepr[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[::std::algebra::endomorphism::Endo[e{_}, acc{_}]], "unDual"]]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/classes/foldable.syl:31.2-46
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 31 | foldMap(toDualEndo, xs).unDual.appEndo(init)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[(::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::dual_monoid::Dual[a{_}], "unDual"] |> EqCongApp[EqRefl[Type], EqTrans[AxiomNewtypeFieldRepr[./std/algebra/dual_monoid.syl:8.12-16, [a{_}]], EqRefl[RuntimeReprBoxed]]])]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/algebra/dual_monoid.syl:14.20-22 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/dual_monoid.syl:14.20-22
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 14 | Dual(rhs.unDual ++ lhs.unDual);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::monoid::Monoid[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/algebra/dual_monoid.syl:18.30-36 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 11 impls for ::std::algebra::monoid::Monoid:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[String] at ./std/prelude/types/string.syl:41.5-19
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[Bytes] at ./std/prelude/types/bytes.syl:40.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:50.11-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::data::option::Option[a{_}]] at ./std/data/option.syl:43.8-25
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:15.11-35
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[Array[elem{_}]] at ./std/data/array.syl:45.11-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:74.8-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:59.8-27
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[()] at ./std/algebra/monoid.syl:17.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:15.11-29
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::monoid::Monoid[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:17.8-23
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/dual_monoid.syl:18.30-36
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 18 | def mempty: Dual[a] := Dual(mempty);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semiring::Semiring[(::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::semiring::Additive[a{_}], "unAdditive"] |> EqCongApp[EqRefl[Type], EqTrans[AxiomNewtypeFieldRepr[./std/algebra/semiring.syl:50.12-20, [a{_}]], EqRefl[RuntimeReprBoxed]]])]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/algebra/semiring.syl:56.28-29 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 2 impls for ::std::algebra::semiring::Semiring:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[Int] at ./std/prelude/types/int.syl:36.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[()] at ./std/algebra/semiring.syl:41.5-17
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/semiring.syl:56.28-29
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 56 | Additive(lhs.unAdditive + rhs.unAdditive);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semiring::Semiring[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/algebra/semiring.syl:60.38-42 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 2 impls for ::std::algebra::semiring::Semiring:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[Int] at ./std/prelude/types/int.syl:36.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[()] at ./std/algebra/semiring.syl:41.5-17
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/semiring.syl:60.38-42
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 60 | def mempty: Additive[a] := Additive(zero);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semiring::Semiring[(::std::intrinsics::FieldType[RuntimeReprBoxed, ::std::algebra::semiring::Multiplicative[a{_}], "unMultiplicative"] |> EqCongApp[EqRefl[Type], EqTrans[AxiomNewtypeFieldRepr[./std/algebra/semiring.syl:65.12-26, [a{_}]], EqRefl[RuntimeReprBoxed]]])]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/algebra/semiring.syl:71.40-41 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 2 impls for ::std::algebra::semiring::Semiring:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[Int] at ./std/prelude/types/int.syl:36.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[()] at ./std/algebra/semiring.syl:41.5-17
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/semiring.syl:71.40-41
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 71 | Multiplicative(lhs.unMultiplicative * rhs.unMultiplicative);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semiring::Semiring[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/algebra/semiring.syl:75.50-53 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 2 impls for ::std::algebra::semiring::Semiring:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[Int] at ./std/prelude/types/int.syl:36.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semiring::Semiring[()] at ./std/algebra/semiring.syl:41.5-17
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/algebra/semiring.syl:75.50-53
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 75 | def mempty: Multiplicative[a] := Multiplicative(one);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : (fn() -{LocalMutable[?{_}], ...?{_}}> Array[elem{_}] : type) = (fn[scope{_}: MutableScope]() -{LocalMutable[scope{_}]}> Array[elem{_}] : type)
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (fn[scope{_}: MutableScope]() -{LocalMutable[scope{_}]}> Array[elem{_}] : type) = (fn() -{LocalMutable[?{_}], ...?{_}}> Array[elem{_}] : type)
00:01:22 ocaml5.1.1-sylvan_stage0> + - it is used to solve for (fn(fn[scope{_}: MutableScope]() -{LocalMutable[scope{_}]}> Array[elem{_}] : type) -> Array[elem{_}] : type) = (fn(fn() -{LocalMutable[?{_}], ...?{_}}> Array[elem{_}] : type) -> Array[elem{_}] : type)
00:01:22 ocaml5.1.1-sylvan_stage0> + - the type of the expression at ./std/data/array.syl:34.8-39.10 has arguments
00:01:22 ocaml5.1.1-sylvan_stage0> + applied that would require it to have a different type
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/array.syl:34.8-39.10
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 34 | withLocalMutable(fn[scope]() => {
00:01:22 ocaml5.1.1-sylvan_stage0> + | /-^
00:01:22 ocaml5.1.1-sylvan_stage0> + 35 | | def out := newMutableArray(readArray(lhs, 0), lhsLength + rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 36 | | copyArrayToMutableArray(out, 0, lhs, 0, lhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 37 | | copyArrayToMutableArray(out, lhsLength, rhs, 0, rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 38 | | freezeMutableArray(out)
00:01:22 ocaml5.1.1-sylvan_stage0> + 39 | | })
00:01:22 ocaml5.1.1-sylvan_stage0> + | \--^
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0019]: could not solve for type:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + scope{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : MutableScope
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/array.syl:35.21-36
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 35 | def out := newMutableArray(readArray(lhs, 0), lhsLength + rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0019]: could not solve for type:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/array.syl:34.25-39.9
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 34 | withLocalMutable(fn[scope]() => {
00:01:22 ocaml5.1.1-sylvan_stage0> + | /------------------^
00:01:22 ocaml5.1.1-sylvan_stage0> + 35 | | def out := newMutableArray(readArray(lhs, 0), lhsLength + rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 36 | | copyArrayToMutableArray(out, 0, lhs, 0, lhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 37 | | copyArrayToMutableArray(out, lhsLength, rhs, 0, rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + 38 | | freezeMutableArray(out)
00:01:22 ocaml5.1.1-sylvan_stage0> + 39 | | })
00:01:22 ocaml5.1.1-sylvan_stage0> + | \-^
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0019]: could not solve for type:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + scope{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/array.syl:35.21-78
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 35 | def out := newMutableArray(readArray(lhs, 0), lhsLength + rhsLength);
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/array.syl:59.17-19 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/array.syl:59.17-19
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 59 | loop(acc ++ f(readArray(xs, i)), i + 1)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + elem{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + hd{_} : elem{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + tl{_} : ::std::data::linked_list::LinkedList[elem{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/data/linked_list.syl:28.41-61 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/linked_list.syl:28.41-61
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 28 | LinkedList::Cons(hd, tl) => loop(append(accum, f(hd)), tl),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~~~~~~~~~~~~~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + l{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + r{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::prelude::classes::eq::Eq[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/option.syl:18.30-32 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 15 impls for ::std::prelude::classes::eq::Eq:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::uintn::UIntN] at ./std/prelude/types/uintn.syl:14.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::uint8::UInt8] at ./std/prelude/types/uint8.syl:14.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::uint64::UInt64] at ./std/prelude/types/uint64.syl:14.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::uint32::UInt32] at ./std/prelude/types/uint32.syl:14.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::uint16::UInt16] at ./std/prelude/types/uint16.syl:14.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[String] at ./std/prelude/types/string.syl:20.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::intn::IntN] at ./std/prelude/types/intn.syl:14.5-13
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::int8::Int8] at ./std/prelude/types/int8.syl:14.5-13
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::int64::Int64] at ./std/prelude/types/int64.syl:14.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::int32::Int32] at ./std/prelude/types/int32.syl:14.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::types::int16::Int16] at ./std/prelude/types/int16.syl:14.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[Int] at ./std/prelude/types/int.syl:19.5-12
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[Bytes] at ./std/prelude/types/bytes.syl:19.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::prelude::classes::ord::Ordering] at ./std/prelude/classes/ord.syl:12.5-17
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::eq::Eq[::std::data::option::Option[a{_}]] at ./std/data/option.syl:14.8-21
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/option.syl:18.30-32
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 18 | (Some(l), Some(r)) => l == r,
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + l{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + r{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::prelude::classes::ord::Ord[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/option.syl:29.30-33 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 14 impls for ::std::prelude::classes::ord::Ord:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::uintn::UIntN] at ./std/prelude/types/uintn.syl:19.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::uint8::UInt8] at ./std/prelude/types/uint8.syl:19.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::uint64::UInt64] at ./std/prelude/types/uint64.syl:19.5-16
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::uint32::UInt32] at ./std/prelude/types/uint32.syl:19.5-16
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::uint16::UInt16] at ./std/prelude/types/uint16.syl:19.5-16
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[String] at ./std/prelude/types/string.syl:24.5-16
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::intn::IntN] at ./std/prelude/types/intn.syl:19.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::int8::Int8] at ./std/prelude/types/int8.syl:19.5-14
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::int64::Int64] at ./std/prelude/types/int64.syl:19.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::int32::Int32] at ./std/prelude/types/int32.syl:19.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::prelude::types::int16::Int16] at ./std/prelude/types/int16.syl:19.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[Int] at ./std/prelude/types/int.syl:23.5-13
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[Bytes] at ./std/prelude/types/bytes.syl:23.5-15
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::prelude::classes::ord::Ord[::std::data::option::Option[a{_}]] at ./std/data/option.syl:23.8-22
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/option.syl:29.30-33
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 29 | (Some(l), Some(r)) => l <=> r,
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + l{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + r{_} : a{_}
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[a{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/data/option.syl:39.35-37 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/data/option.syl:39.35-37
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 39 | (Some(l), Some(r)) => Some(l ++ r),
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a1{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + a2{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + b1{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + b2{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::intrinsics::HasTupleComponent[(a1{_} : type, b1{_} : type), 0]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/functor/bifunctor.syl:39.24-29 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 0 impls for ::std::intrinsics::HasTupleComponent:
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/functor/bifunctor.syl:39.24-29
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 39 | ) -> (a2, b2) := (fst(val.0), snd(val.1));
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + a1{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + a2{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + b1{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + b2{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::intrinsics::HasTupleComponent[(a1{_} : type, b1{_} : type), 1]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the expression at ./std/functor/bifunctor.syl:39.36-41 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 0 impls for ::std::intrinsics::HasTupleComponent:
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/functor/bifunctor.syl:39.36-41
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 39 | ) -> (a2, b2) := (fst(val.0), snd(val.1));
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~~~~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/prelude/types/bytes.syl:54.17-19 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/types/bytes.syl:54.17-19
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 54 | loop(acc ++ f(UInt8 { unboxed := bytesRead(xs, i) }), i + 1)
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + error[E0018]: could not solve for:
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + e{_} : Effects
00:01:22 ocaml5.1.1-sylvan_stage0> + m{_} : type
00:01:22 ocaml5.1.1-sylvan_stage0> + where$0{_} : ::std::algebra::monoid::Monoid[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> + ----------------------------------------
00:01:22 ocaml5.1.1-sylvan_stage0> + ?{_} : ::std::algebra::semigroup::Semigroup[m{_}]
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + this constraint exists because:
00:01:22 ocaml5.1.1-sylvan_stage0> + - the operation at ./std/prelude/types/string.syl:58.14-16 has a where clause
00:01:22 ocaml5.1.1-sylvan_stage0> +
00:01:22 ocaml5.1.1-sylvan_stage0> + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:22 ocaml5.1.1-sylvan_stage0> + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:22 ocaml5.1.1-sylvan_stage0> + --> ./std/prelude/types/string.syl:58.14-16
00:01:22 ocaml5.1.1-sylvan_stage0> + |
00:01:22 ocaml5.1.1-sylvan_stage0> + 58 | f(rune) ++ foldMap(f, stringSlice(xs, runeLen, len - runeLen))
00:01:22 ocaml5.1.1-sylvan_stage0> + | ^~
00:01:22 ocaml5.1.1-sylvan_stage0> + Encountered 111 errors.
00:01:22 ocaml5.1.1-sylvan_stage0> vim: set ft=cram :
00:01:23 error: builder for '/nix/store/m0wyvamx9aj1q7a84isp71wwhbbxjbxw-ocaml5.1.1-sylvan_stage0-0.0.1-pre.drv' failed with exit code 1;
00:01:23 last 25 log lines:
00:01:23 > +
00:01:23 > + this constraint exists because:
00:01:23 > + - the operation at ./std/prelude/types/string.syl:58.14-16 has a where clause
00:01:23 > +
00:01:23 > + found 12 impls for ::std::algebra::semigroup::Semigroup:
00:01:23 > + - ::std::algebra::semigroup::Semigroup[String] at ./std/prelude/types/string.syl:37.5-22
00:01:23 > + - ::std::algebra::semigroup::Semigroup[Bytes] at ./std/prelude/types/bytes.syl:36.5-21
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::data::seq::Seq[elem{_}]] at ./std/data/seq.syl:45.11-31
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::data::option::Option[a{_}]] at ./std/data/option.syl:33.8-28
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::data::linked_list::LinkedList[elem{_}]] at ./std/data/linked_list.syl:10.11-38
00:01:23 > + - ::std::algebra::semigroup::Semigroup[Array[elem{_}]] at ./std/data/array.syl:23.11-33
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::codec::pretty::Doc[meta{_}]] at ./std/codec/pretty.syl:64.11-31
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Multiplicative[a{_}]] at ./std/algebra/semiring.syl:69.8-36
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::algebra::semiring::Additive[a{_}]] at ./std/algebra/semiring.syl:54.8-30
00:01:23 > + - ::std::algebra::semigroup::Semigroup[()] at ./std/algebra/semigroup.syl:15.5-18
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::algebra::endomorphism::Endo[e{_}, a{_}]] at ./std/algebra/endomorphism.syl:10.11-32
00:01:23 > + - ::std::algebra::semigroup::Semigroup[::std::algebra::dual_monoid::Dual[a{_}]] at ./std/algebra/dual_monoid.syl:12.8-26
00:01:23 > + --> ./std/prelude/types/string.syl:58.14-16
00:01:23 > + |
00:01:23 > + 58 | f(rune) ++ foldMap(f, stringSlice(xs, runeLen, len - runeLen))
00:01:23 > + | ^~
00:01:23 > + Encountered 111 errors.
00:01:23 >
00:01:23 > vim: set ft=cram :
00:01:23 >
00:01:23 For full logs, run 'nix-store -l /nix/store/m0wyvamx9aj1q7a84isp71wwhbbxjbxw-ocaml5.1.1-sylvan_stage0-0.0.1-pre.drv'.
real 1m23.260s
user 0m1.036s
sys 0m0.601s
|