-
Notifications
You must be signed in to change notification settings - Fork 3
/
main.bib
1126 lines (1019 loc) · 36.2 KB
/
main.bib
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
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
@inproceedings{DBLP:conf/cade/AllenCEKL00,
author = {Stuart F. Allen and
Robert L. Constable and
Richard Eaton and
Christoph Kreitz and
Lori Lorigo},
title = {The Nuprl Open Logical Environment},
booktitle = {Automated Deduction - CADE-17, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings},
pages = {170--176},
year = {2000},
crossref = {DBLP:conf/cade/2000},
timestamp = {Wed, 24 May 2017 15:40:41 +0200},
biburl = {https://dblp.org/rec/bib/conf/cade/AllenCEKL00},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cade/2000,
editor = {David A. McAllester},
title = {Automated Deduction - CADE-17, 17th International Conference on Automated
Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings},
series = {LNCS},
volume = {1831},
publisher = {Springer},
year = {2000},
isbn = {3-540-67664-3},
timestamp = {Wed, 24 May 2017 15:40:41 +0200},
biburl = {https://dblp.org/rec/bib/conf/cade/2000},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lpar/JouannaudS17,
author = {Jean{-}Pierre Jouannaud and
Pierre{-}Yves Strub},
title = {Coq without Type Casts: {A} Complete Proof of Coq Modulo Theory},
booktitle = {LPAR-21, Maun, Botswana, May 7-12, 2017},
pages = {474--489},
year = {2017},
crossref = {DBLP:conf/lpar/2017},
timestamp = {Thu, 23 Nov 2017 16:56:11 +0100},
biburl = {https://dblp.org/rec/bib/conf/lpar/JouannaudS17},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/lpar/2017,
editor = {Thomas Eiter and
David Sands},
title = {LPAR-21, 21st International Conference on Logic for Programming, Artificial
Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017},
series = {EPiC Series in Computing},
volume = {46},
publisher = {EasyChair},
year = {2017},
timestamp = {Thu, 23 Nov 2017 16:56:11 +0100},
biburl = {https://dblp.org/rec/bib/conf/lpar/2017},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@Manual{coq,
title = {The {C}oq proof assistant reference manual},
author = {{The Coq development team}},
organization = {LogiCal Project},
note = {Version 8.11},
url = {http://coq.inria.fr},
year = {2020}
}
@inproceedings{oury2005extensionality,
title={Extensionality in the calculus of constructions},
author={Oury, Nicolas},
booktitle={International Conference on Theorem Proving in Higher Order Logics},
pages={278--293},
year={2005},
organization={Springer}
}
@PHDTHESIS{Oury2006,
url = "http://www.theses.fr/2006PA112136",
title = "Egalité et filtrage avec types dépendants dans le calcul des constructions inductives",
author = "Oury, Nicolas",
year = "2006",
pages = "1 vol., 188 p.",
}
@inproceedings{hofmann1995conservativity,
title={Conservativity of equality reflection over intensional type theory},
author={Hofmann, Martin},
booktitle={International Workshop on Types for Proofs and Programs},
pages={153--164},
year={1995},
organization={Springer}
}
@Misc{andromeda,
key = {andromeda},
author = {Andrej Bauer and Gaëtan Gilbert and Philipp G.\ Haselwarter and Matija Pretnar and Chris Stone},
title = {The `{A}ndromeda' prover},
url = {http://www.andromeda-prover.org/},
year = {2016}
}
@Misc{nuprl,
key = {nuprl},
author = {Robert L. Constable and Joseph L. Bates},
title = {The {NuPrl} system, {PRL} project},
url = {http://www.nuprl.org/},
year = {2014}
}
@book{streicher1993investigations,
title={Investigations into intensional type theory},
author={Streicher, Thomas},
year={1993}
}
@inproceedings{sozeau:icfp07,
Address = {Freiburg, Germany},
Author = {Matthieu Sozeau},
Booktitle = {ICFP'07},
Copyright = {ACM, 2007. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ICFP'07, http://doi.acm.org/10.1145/1291151.1291156},
Date-Added = {2008-03-24 19:08:52 +0100},
Date-Modified = {2014-02-10 14:13:02 +0000},
Isbn = {978-1-59593-815-2},
Pages = {13--24},
Pdf = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq.pdf},
Publisher = {ACM Press},
Read = {Oui},
Slides = {http://www.irif.univ-paris-diderot.fr/~sozeau/research/publications/Program-ing_Finger_Trees_in_Coq-icfp07-011007.pdf},
Title = {{P}rogram-ing {F}inger {T}rees in {C}oq},
Year = {2007},
Bdsk-Url-1 = {http://doi.acm.org/10.1145/1291151.1291156}
}
@inproceedings{anand:hal-01671948,
TITLE = {{Typed Template Coq -- Certified Meta-Programming in Coq}},
AUTHOR = {Anand, Abhishek and Boulier, Simon and Tabareau, Nicolas and Sozeau, Matthieu},
URL = {https://hal.inria.fr/hal-01671948},
BOOKTITLE = {{The Fourth International Workshop on Coq for Programming Languages}},
ADDRESS = {Los Angeles, CA, United States},
YEAR = {2018},
MONTH = Jan,
PDF = {https://hal.inria.fr/hal-01671948/file/Anand-Boulier-Tabareau-Sozeau-CoqPL18.pdf},
HAL_ID = {hal-01671948},
HAL_VERSION = {v1},
}
@Misc{formalisation,
key = {formalisation},
author = {Sozeau, Matthieu and Tabareau, Nicolas and Winterhalter, Théo},
title = {Formalisation of ETT to ITT},
url = {https://github.com/TheoWinterhalter/ett-to-itt},
year = {2018}
}
@inproceedings{anand:hal-01809681,
TITLE = {{Towards Certified Meta-Programming with Typed Template-Coq}},
AUTHOR = {Anand, Abhishek and Boulier, Simon and Cohen, Cyril and Sozeau, Matthieu and Tabareau, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01809681},
BOOKTITLE = {{ITP 2018}},
ADDRESS = {Oxford, United Kingdom},
PAGES = {1-18},
YEAR = {2018},
MONTH = Jul,
PDF = {https://hal.archives-ouvertes.fr/hal-01809681/file/paper_39.pdf},
HAL_ID = {hal-01809681},
HAL_VERSION = {v1},
}
@inproceedings{DBLP:conf/itp/Sozeau10,
author = {Matthieu Sozeau},
title = {Equations: {A} Dependent Pattern-Matching Compiler},
booktitle = {{ITP} 2010, Edinburgh, UK, July 11-14, 2010. Proceedings},
pages = {419--434},
year = {2010},
crossref = {DBLP:conf/itp/2010},
timestamp = {Sun, 04 Jun 2017 10:07:20 +0200},
biburl = {https://dblp.org/rec/bib/conf/itp/Sozeau10},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/itp/2010,
editor = {Matt Kaufmann and
Lawrence C. Paulson},
title = {Interactive Theorem Proving, First International Conference, {ITP}
2010, Edinburgh, UK, July 11-14, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6172},
publisher = {Springer},
year = {2010},
isbn = {978-3-642-14051-8},
timestamp = {Sun, 04 Jun 2017 10:07:20 +0200},
biburl = {https://dblp.org/rec/bib/conf/itp/2010},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{bernardy2012proofs,
title={Proofs for free: Parametricity for dependent types},
author={Bernardy, Jean-philippe and Jansson, Patrik and Paterson, Ross},
journal={Journal of Functional Programming},
volume={22},
number={2},
pages={107--152},
year={2012},
publisher={Cambridge University Press}
}
@InProceedings{boulier17:next-syntac-model-type-theor,
author = {Simon Boulier and Pierre-Marie Pédrot and Nicolas Tabareau},
title = {The Next 700 Syntactical Models of Type Theory},
booktitle = {Certified Programs and Proofs -- CPP 2017},
year = 2017,
pages = {182--194},
month = {January}
}
@inproceedings{van2013explicit,
title={{Explicit convertibility proofs in pure type systems}},
author={van Doorn, Floris and Geuvers, Herman and Wiedijk, Freek},
booktitle={Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks \& meta-languages: theory \& practice},
pages={25--36},
year={2013},
organization={ACM}
}
@misc{bertot2004interactive,
title={Interactive Theorem Proving and Program Development},
author={Bertot, Yves and Castéran, Pierre},
year={2004},
publisher={Springer}
}
@book{norell2007towards,
Author = {Norell, Ulf},
Publisher = {Citeseer},
Title = {{Towards a practical programming language based on dependent type theory}},
Volume = {32},
Year = {2007}
}
@inproceedings{abel2011irrelevance,
title={Irrelevance in type theory with a heterogeneous equality judgement},
author={Abel, Andreas},
booktitle={International Conference on Foundations of Software Science and Computational Structures},
pages={57--71},
year={2011},
organization={Springer}
}
@article{harper2005equivalence,
title={On equivalence and canonical forms in the LF type theory},
author={Harper, Robert and Pfenning, Frank},
journal={ACM Transactions on Computational Logic (TOCL)},
volume={6},
number={1},
pages={61--101},
year={2005},
publisher={ACM}
}
@misc{hts-sota,
key = {hts-sota},
title = {A simple type system with two identity types},
author = {Voevodsky, Vladimir},
year = 2013,
url = {https://ncatlab.org/homotopytypetheory/files/HTS.pdf}
}
@article{altenkirch2016extending,
title={Extending homotopy type theory with strict equality},
author={Altenkirch, Thorsten and Capriotti, Paolo and Kraus, Nicolai},
journal={arXiv preprint arXiv:1604.03799},
year={2016}
}
@book{HofmannPhD,
author = {Martin Hofmann},
title = {Extensional constructs in intensional type theory},
series = {{CPHC/BCS} distinguished dissertations},
publisher = {Springer},
year = {1997},
isbn = {978-3-540-76121-1},
timestamp = {Tue, 05 Nov 2013 17:32:56 +0100},
biburl = {http://dblp.uni-trier.de/rec/bib/books/daglib/0088162},
bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{hottbook,
author = {{U}nivalent {F}oundations {P}rogram, The},
title = {Homotopy Type Theory: Univalent Foundations of Mathematics},
address = {Institute for Advanced Study},
year = 2013
}
@incollection{groupoid-interp,
Address = {New York},
Author = {Hofmann, Martin and Streicher, Thomas},
Booktitle = {Twenty-five years of constructive type theory ({V}enice, 1995)},
Date-Added = {2014-01-29 12:01:09 +0000},
Date-Modified = {2014-02-10 14:06:49 +0000},
Mrclass = {03B15 (68N15 68Q55)},
Mrnumber = {1686862},
Pages = {83--111},
Publisher = {Oxford Univ. Press},
Title = {{The Groupoid Interpretation of Type Theory}},
Volume = {36},
Year = {1998},
Bdsk-Url-1 = {http://www.tcs.informatik.uni-muenchen.de/lehre/SS97/types-vl/venedig.ps}
}
@article{coquand:cubical,
Author = {Marc Bezem and Thierry Coquand and Simon Huber},
Date-Added = {2014-02-10 13:24:43 +0000},
Date-Modified = {2014-02-10 14:19:03 +0000},
Month = {December},
Title = {A Model of Type Theory in Cubical Sets},
Url = {http://www.cse.chalmers.se/~coquand/mod1.pdf},
Year = {2013},
Bdsk-Url-1 = {http:%5C%5Cuf-ias-2012.wikispaces.com/file/view/semi.pdf},
Bdsk-Url-2 = {http://www.cse.chalmers.se/~coquand/mod1.pdf}
}
@article{kapulkin2012simplicial,
title={The simplicial model of univalent foundations},
author={Kapulkin, Chris and Lumsdaine, Peter LeFanu},
journal={arXiv preprint arXiv:1211.2851},
year={2012}
}
@phdthesis{mcbride2000dependently,
title={Dependently typed functional programs and their proofs},
author={McBride, Conor},
year={2000},
school={University of Edinburgh}
}
@article{DBLP:journals/corr/AnnenkovCK17,
author = {Danil Annenkov and
Paolo Capriotti and
Nicolai Kraus},
title = {Two-Level Type Theory and Applications},
journal = {CoRR},
volume = {abs/1705.03307},
year = {2017},
archivePrefix = {arXiv},
eprint = {1705.03307},
timestamp = {Wed, 07 Jun 2017 14:43:06 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/AnnenkovCK17},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AltenkirchCK16,
author = {Thorsten Altenkirch and
Paolo Capriotti and
Nicolai Kraus},
title = {Extending Homotopy Type Theory with Strict Equality},
year = {2016},
archivePrefix = {arXiv},
eprint = {1604.03799},
timestamp = {Wed, 07 Jun 2017 14:41:57 +0200},
biburl = {https://dblp.org/rec/bib/journals/corr/AltenkirchCK16},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{altenkirch2007observational,
title={Observational equality, now!},
author={Altenkirch, Thorsten and McBride, Conor and Swierstra, Wouter},
booktitle={Proceedings of the 2007 workshop on Programming languages meets program verification},
pages={57--68},
year={2007},
organization={ACM}
}
@inproceedings{mcbride2004epigram,
title={Epigram: Practical programming with dependent types},
author={McBride, Conor},
booktitle={International School on Advanced Functional Programming},
pages={130--170},
year={2004},
organization={Springer}
}
@INPROCEEDINGS{altenkirch99,
author={T. Altenkirch},
booktitle={Proceedings of LICS},
title={Extensional equality in intensional type theory},
year={1999},
volume={},
number={},
pages={412-420},
keywords={decidability;type theory;decidable;extensional propositional equality;intensional type theory;proof-irrelevant universe;Electrical capacitance tomography;Informatics;Network address translation;Tin},
ISSN={1043-6871},
month={}
}
@inproceedings{DBLP:conf/itp/AnandBCST18,
author = {Abhishek Anand and
Simon Boulier and
Cyril Cohen and
Matthieu Sozeau and
Nicolas Tabareau},
title = {Towards Certified Meta-Programming with Typed Template-Coq},
booktitle = {{ITP}
2018, Oxford,
UK, July 9-12, 2018, Proceedings},
pages = {20--39},
year = {2018},
crossref = {DBLP:conf/itp/2018},
timestamp = {Thu, 05 Jul 2018 14:58:47 +0200},
biburl = {https://dblp.org/rec/bib/conf/itp/AnandBCST18},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/itp/2018,
editor = {Jeremy Avigad and
Assia Mahboubi},
title = {Interactive Theorem Proving - 9th International Conference, {ITP}
2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford,
UK, July 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10895},
publisher = {Springer},
year = {2018},
isbn = {978-3-319-94820-1},
timestamp = {Thu, 05 Jul 2018 14:28:25 +0200},
biburl = {https://dblp.org/rec/bib/conf/itp/2018},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{Abel:2017:DCT:3177123.3158111,
author = {Abel, Andreas and Öhman, Joakim and Vezzosi, Andrea},
title = {Decidability of Conversion for Type Theory in Type Theory},
journal = {Proc. ACM Program. Lang.},
issue_date = {January 2018},
volume = {2},
number = {POPL},
month = dec,
year = {2017},
issn = {2475-1421},
pages = {23:1--23:29},
articleno = {23},
numpages = {29},
url = {http://doi.acm.org/10.1145/3158111},
doi = {10.1145/3158111},
acmid = {3158111},
publisher = {ACM},
address = {New York, NY, USA},
keywords = {Agda, Dependent types, Formalization, Logical relations},
}
@inproceedings{winterhalter:hal-01849166,
TITLE = {{Eliminating Reflection from Type Theory}},
AUTHOR = {Winterhalter, Théo and Sozeau, Matthieu and Tabareau, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-01849166},
BOOKTITLE = {{CPP 2019 - 8th ACM SIGPLAN International Conference on Certified Programs and Proofs}},
ADDRESS = {Lisbonne, Portugal},
PUBLISHER = {{ACM}},
PAGES = {91-103},
YEAR = {2019},
MONTH = Jan,
DOI = {10.1145/3293880.3294095},
KEYWORDS = {Proof theory ; Automated reasoning ; Dependent types ; Logic and verification ; Formalisation ; Logic ; Type theory ; Constructive mathematics ; Translation},
PDF = {https://hal.archives-ouvertes.fr/hal-01849166/file/cpp19.pdf},
HAL_ID = {hal-01849166},
HAL_VERSION = {v3},
}
@phdthesis{boulier2018extending,
title={Extending type theory with syntactic models},
author={Boulier, Simon Pierre},
year={2018}
}
@article{timany2018cumulative,
title={Cumulative inductive types in Coq},
author={Timany, Amin and Sozeau, Matthieu},
journal={LIPIcs: Leibniz International Proceedings in Informatics},
year={2018},
publisher={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}
}
@phdthesis{girard1972interpretation,
title={Interpr{\'e}tation fonctionnelle et {\'e}limination des coupures de l'arithm{\'e}tique d'ordre sup{\'e}rieur},
author={Girard, Jean-Yves},
year={1972},
school={{\'E}diteur inconnu}
}
@inproceedings{hurkens1995simplification,
title={A simplification of Girard's paradox},
author={Hurkens, Antonius JC},
booktitle={International Conference on Typed Lambda Calculi and Applications},
pages={266--278},
year={1995},
organization={Springer}
}
@article{pedrot:hal-02189128,
TITLE = {{A Reasonably Exceptional Type Theory}},
AUTHOR = {Pédrot, Pierre-Marie and Tabareau, Nicolas and Fehrmann, Hans Jacob and Tanter, Éric},
URL = {https://hal.inria.fr/hal-02189128},
JOURNAL = {{Proceedings of the ACM on Programming Languages}},
PUBLISHER = {{ACM}},
SERIES = {Issue ICFP},
VOLUME = {3},
PAGES = {1-29},
YEAR = {2019},
MONTH = Aug,
DOI = {10.1145/3341712},
KEYWORDS = {Efects ; Exceptions ; Functional constructs ; Parametricity ; CCS Concepts: $\bullet$ Theory of computation $\rightarrow$ Type theory ; CCS Concepts: $\bullet$ Theory of computation $\rightarrow$ Program verification ; CCS Concepts: $\bullet$ Theory of computation $\rightarrow$ Functional constructs},
PDF = {https://hal.inria.fr/hal-02189128/file/icfp19main-p108-p-48a52d2-41764-final.pdf},
HAL_ID = {hal-02189128},
HAL_VERSION = {v1},
}
@article{pedrot:hal-02383109,
TITLE = {{The Fire Triangle}},
AUTHOR = {Pédrot, Pierre-Marie and Tabareau, Nicolas},
URL = {https://hal.archives-ouvertes.fr/hal-02383109},
JOURNAL = {{Proceedings of the ACM on Programming Languages}},
PUBLISHER = {{ACM}},
PAGES = {1-28},
YEAR = {2020},
MONTH = Jan,
DOI = {10.1145/3371126},
PDF = {https://hal.archives-ouvertes.fr/hal-02383109/file/main.pdf},
HAL_ID = {hal-02383109},
HAL_VERSION = {v1},
}
@article{de1991plea,
title={A plea for weaker frameworks},
author={De Bruijn, NG},
journal={Logical frameworks},
pages={40--67},
year={1991}
}
@article{gilbert:hal-01859964,
TITLE = {{Definitional Proof-Irrelevance without K}},
AUTHOR = {Gilbert, Ga{\"e}tan and Cockx, Jesper and Sozeau, Matthieu and Tabareau, Nicolas},
URL = {https://hal.inria.fr/hal-01859964},
JOURNAL = {{Proceedings of the ACM on Programming Languages}},
HAL_LOCAL_REFERENCE = {ACL+},
HAL_LOCAL_REFERENCE = {BEST},
PUBLISHER = {{ACM}},
SERIES = {POPL'19},
PAGES = {1-28},
YEAR = {2019},
MONTH = Jan,
DOI = {10.1145/329031610.1145/3290316},
PDF = {https://hal.inria.fr/hal-01859964/file/main_popl.pdf},
HAL_ID = {hal-01859964},
HAL_VERSION = {v2},
}
@inproceedings{sozeau2014universe,
title={Universe polymorphism in Coq},
author={Sozeau, Matthieu and Tabareau, Nicolas},
booktitle={International Conference on Interactive Theorem Proving},
pages={499--514},
year={2014},
organization={Springer}
}
@article{harper1991type,
title={Type checking with universes},
author={Harper, Robert and Pollack, Robert},
journal={Theoretical computer science},
volume={89},
number={1},
pages={107--136},
year={1991},
publisher={Elsevier}
}
@incollection{specker1966typical,
title={Typical ambiguity},
author={Specker, Ernst},
booktitle={Studies in Logic and the Foundations of Mathematics},
volume={44},
pages={116--124},
year={1966},
publisher={Elsevier}
}
@article{feferman2004typical,
title={Typical ambiguity: trying to have your cake and eat it too},
author={Feferman, Solomon},
journal={One hundred years of Russell’s paradox},
pages={135--151},
year={2004}
}
@article{sozeau2019equations,
title={Equations reloaded: high-level dependently-typed functional programming and proving in Coq},
author={Sozeau, Matthieu and Mangin, Cyprien},
journal={Proceedings of the ACM on Programming Languages},
volume={3},
number={ICFP},
pages={1--29},
year={2019},
publisher={ACM New York, NY, USA}
}
@article{sozeau2019coq,
title={Coq Coq correct! verification of type checking and erasure for Coq, in Coq},
author={Sozeau, Matthieu and Boulier, Simon and Forster, Yannick and Tabareau, Nicolas and Winterhalter, Th{\'e}o},
journal={Proceedings of the ACM on Programming Languages},
volume={4},
number={POPL},
pages={1--28},
year={2020},
publisher={ACM New York, NY, USA}
}
@inproceedings{Let2008,
Author = {Pierre Letouzey},
Booktitle = {{Logic and Theory of Algorithms, Fourth Conference on Computability in Europe, CiE 2008}},
Date-Added = {2008-10-02 13:00:50 +0200},
Date-Modified = {2008-10-13 14:42:56 +0200},
Editor = {A. Beckmann and C. Dimitracopoulos and B. L{\"o}we},
Pdf = {http://www.pps.jussieu.fr/~letouzey/download/letouzey_extr_cie08.pdf},
Publisher = {Springer-Verlag},
Read = {Oui},
Series = {Lecture Notes in Computer Science},
Title = {{Coq Extraction, an Overview}},
Volume = 5028,
Year = 2008
}
@article{milner1978theory,
title={A theory of type polymorphism in programming},
author={Milner, Robin},
journal={Journal of computer and system sciences},
volume={17},
number={3},
pages={348--375},
year={1978},
publisher={Elsevier}
}
@article{kovacs2020signatures,
title={Signatures and Induction Principles for Higher Inductive-Inductive Types},
author={Kov{\'a}cs, Andr{\'a}s and Kaposi, Ambrus},
journal={Logical Methods in Computer Science},
volume={16},
year={2020},
publisher={Episciences. org}
}
@inproceedings{gimenez1998structural,
title={Structural recursive definitions in type theory},
author={Gim{\'e}nez, Eduardo},
booktitle={International Colloquium on Automata, Languages, and Programming},
pages={397--408},
year={1998},
organization={Springer}
}
@inproceedings{gimenez1994codifying,
title={Codifying guarded definitions with recursive schemes},
author={Gim{\'e}nez, Eduarde},
booktitle={International Workshop on Types for Proofs and Programs},
pages={39--59},
year={1994},
organization={Springer}
}
@inproceedings{forsberg2010inductive,
title={Inductive-inductive definitions},
author={Forsberg, Fredrik Nordvall and Setzer, Anton},
booktitle={International Workshop on Computer Science Logic},
pages={454--468},
year={2010},
organization={Springer}
}
@article{dybjer2000general,
title={A general formulation of simultaneous inductive-recursive definitions in type theory},
author={Dybjer, Peter},
journal={The Journal of Symbolic Logic},
volume={65},
number={2},
pages={525--549},
year={2000},
publisher={Cambridge University Press}
}
@article{abel2013copatterns,
title={Copatterns: programming infinite structures by observations},
author={Abel, Andreas and Pientka, Brigitte and Thibodeau, David and Setzer, Anton},
journal={ACM SIGPLAN Notices},
volume={48},
number={1},
pages={27--38},
year={2013},
publisher={ACM New York, NY, USA}
}
@article{cockx2016eliminating,
title={Eliminating dependent pattern matching without K},
author={Cockx, Jesper and Devriese, Dominique and Piessens, Frank},
journal={Journal of functional programming},
volume={26},
year={2016},
publisher={Cambridge University Press}
}
@inproceedings{altenkirch2019setoid,
title={Setoid Type Theory—A Syntactic Translation},
author={Altenkirch, Thorsten and Boulier, Simon and Kaposi, Ambrus and Tabareau, Nicolas},
booktitle={International Conference on Mathematics of Program Construction},
pages={155--196},
year={2019},
organization={Springer}
}
@article{cohen2016cubical,
title={Cubical type theory: a constructive interpretation of the univalence axiom},
author={Cohen, Cyril and Coquand, Thierry and Huber, Simon and M{\"o}rtberg, Anders},
journal={arXiv preprint arXiv:1611.02108},
year={2016}
}
@inproceedings{altenkirch1999extensional,
title={Extensional equality in intensional type theory},
author={Altenkirch, Thorsten},
booktitle={Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)},
pages={412--420},
year={1999},
organization={IEEE}
}
@article{tabareau2018equivalences,
title={Equivalences for free: univalent parametricity for effective transport},
author={Tabareau, Nicolas and Tanter, {\'E}ric and Sozeau, Matthieu},
journal={Proceedings of the ACM on Programming Languages},
volume={2},
number={ICFP},
pages={1--29},
year={2018},
publisher={ACM New York, NY, USA}
}
@inproceedings{bauer2017hott,
title={The HoTT library: a formalization of homotopy type theory in Coq},
author={Bauer, Andrej and Gross, Jason and Lumsdaine, Peter LeFanu and Shulman, Michael and Sozeau, Matthieu and Spitters, Bas},
booktitle={Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs},
pages={164--172},
year={2017}
}
@article{vezzosi2019cubical,
title={Cubical agda: a dependently typed programming language with univalence and higher inductive types},
author={Vezzosi, Andrea and M{\"o}rtberg, Anders and Abel, Andreas},
journal={Proceedings of the ACM on Programming Languages},
volume={3},
number={ICFP},
pages={1--29},
year={2019},
publisher={ACM New York, NY, USA}
}
@article{altenkirch2016type,
title={Type theory in type theory using quotient inductive types},
author={Altenkirch, Thorsten and Kaposi, Ambrus},
journal={ACM SIGPLAN Notices},
volume={51},
number={1},
pages={18--29},
year={2016},
publisher={ACM New York, NY, USA}
}
@inproceedings{hofmann1994interpretation,
title={On the interpretation of type theory in locally cartesian closed categories},
author={Hofmann, Martin},
booktitle={International Workshop on Computer Science Logic},
pages={427--441},
year={1994},
organization={Springer}
}
@article{cartmell1986generalised,
title={Generalised algebraic theories and contextual categories},
author={Cartmell, John},
journal={Annals of pure and applied logic},
volume={32},
pages={209--243},
year={1986},
publisher={Elsevier}
}
@inproceedings{voevodsky2016subsystems,
title={Subsystems and regular quotients of C-systems},
author={Voevodsky, Vladimir},
booktitle={Conference on Mathematics and its Applications,(Kuwait City, 2014)},
number={658},
pages={127--137},
year={2016}
}
@inproceedings{dybjer1995internal,
title={Internal type theory},
author={Dybjer, Peter},
booktitle={International Workshop on Types for Proofs and Programs},
pages={120--134},
year={1995},
organization={Springer}
}
@inproceedings{pitts2001nominal,
title={Nominal logic: A first order theory of names and binding},
author={Pitts, Andrew M},
booktitle={International Symposium on Theoretical Aspects of Computer Software},
pages={219--242},
year={2001},
organization={Springer}
}
@article{pfenning1988higher,
title={Higher-order abstract syntax},
author={Pfenning, Frank and Elliott, Conal},
journal={ACM sigplan notices},
volume={23},
number={7},
pages={199--208},
year={1988},
publisher={ACM New York, NY, USA}
}
@inproceedings{de1978lambda,
title={Lambda calculus with namefree formulas involving symbols that represent reference transforming mappings},
author={De Bruijn, NG},
booktitle={Indagationes Mathematicae (Proceedings)},
volume={81},
number={1},
pages={348--356},
year={1978},
organization={North-Holland}
}
@misc{formaltypetheory,
key = {formaltypetheory},
author = {Bauer, Andrej and Haselwarter, Philipp G. and Winterhalter, Théo},
title = {Formalising Type Theory in a modular way for translations between type theories},
url = {https://github.com/TheoWinterhalter/formal-type-theory},
year = {2016}
}
@article{abadi1991explicit,
title={Explicit substitutions},
author={Abadi, Martin and Cardelli, Luca and Curien, P-L and Lévy, J-J},
journal={Journal of functional programming},
volume={1},
number={4},
pages={375--416},
year={1991},
publisher={Cambridge University Press}
}
@article{gentzen1935untersuchungen,
title={Untersuchungen {\"u}ber das logische Schlie{\ss}en. I},
author={Gentzen, Gerhard},
journal={Mathematische zeitschrift},
volume={39},
number={1},
pages={176--210},
year={1935},
publisher={Springer}
}
@book{10.5555/1791547,
author = {Nipkow, Tobias and Wenzel, Markus and Paulson, Lawrence C.},
title = {Isabelle/HOL: A Proof Assistant for Higher-Order Logic},
year = {2002},
isbn = {3540433767},
publisher = {Springer-Verlag},
address = {Berlin, Heidelberg}
}
@article{sozeau:hal-02167423,
TITLE = {{The MetaCoq Project}},
AUTHOR = {Sozeau, Matthieu and Anand, Abhishek and Boulier, Simon and Cohen, Cyril and Forster, Yannick and Kunze, Fabian and Malecha, Gregory and Tabareau, Nicolas and Winterhalter, Théo},
URL = {https://hal.inria.fr/hal-02167423},
JOURNAL = {{Journal of Automated Reasoning}},
PUBLISHER = {{Springer Verlag}},
YEAR = {2020},
MONTH = Feb,
DOI = {10.1007/s10817-019-09540-0},
PDF = {https://hal.inria.fr/hal-02167423/file/The_MetaCoq_Project.pdf},
HAL_ID = {hal-02167423},
HAL_VERSION = {v1},
}
@article{miquel2001calcul,
title={Le Calcul des Constructions implicite: syntaxe et s{\'e}mantique},
author={Miquel, Alexandre},
journal={These de doctorat, Universit{\'e} Paris},
volume={7},
year={2001}
}
@inproceedings{aczel1998relating,
title={On relating type theories and set theories},
author={Aczel, Peter},
booktitle={International Workshop on Types for Proofs and Programs},
pages={1--18},
year={1998},
organization={Springer}
}
@inproceedings{xi2000imperative,
title={Imperative programming with dependent types},
author={Xi, Hongwei},
booktitle={Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No. 99CB36332)},
pages={375--387},
year={2000},
organization={IEEE}
}
@inproceedings{werner1997sets,
title={Sets in types, types in sets},
author={Werner, Benjamin},
booktitle={International Symposium on Theoretical Aspects of Computer Software},
pages={530--546},
year={1997},
organization={Springer}
}
@article{coquand1989metamathematical,
title={Metamathematical investigations of a calculus of constructions},
author={Coquand, Thierry},
year={1989}
}
@inproceedings{dybjerinductive,
title={Inductive sets and families in Martin-L of type theory and their set-theoretic semantics},
author={Dybjer, P},
booktitle={Proceedings of the First Workshop on Logical Frameworks},
pages={280--306}
}
@inproceedings{howe1991computational,
title={On computational open-endedness in Martin-Lof's type theory},
author={Howe, Douglas J},
booktitle={[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science},
pages={162--172},
year={1991},
organization={IEEE}
}
@article{godel1931formal,
title={{\"U}ber formal unentscheidbare S{\"a}tze der Principia Mathematica und verwandter Systeme I},
author={G{\"o}del, Kurt},
journal={Monatshefte f{\"u}r mathematik und physik},
volume={38},
number={1},
pages={173--198},
year={1931},
publisher={Springer}
}
@inproceedings{robinson1950essentially,
title={An essentially undecidable axiom system},
author={Robinson, Raphael M},
booktitle={Proceedings of the international Congress of Mathematics},
volume={1},
pages={729--730},
year={1950},
organization={American Mathematical Society 80 Waterman Street, Providence, RI}
}
@article{bezboruah1976godel,
title={G{\"o}del's second incompleteness theorem for Q},
author={Bezboruah, A and Shepherdson, John C.},
journal={The Journal of Symbolic Logic},
volume={41},
number={2},
pages={503--512},
year={1976},
publisher={Cambridge University Press}
}
@inproceedings{jaber2016definitional,
title={The definitional side of the forcing},
author={Jaber, Guilhem and Lewertowski, Gabriel and P{\'e}drot, Pierre-Marie and Sozeau, Matthieu and Tabareau, Nicolas},
booktitle={Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science},
pages={367--376},
year={2016}
}
@article{cardone2006history,
title={History of lambda-calculus and combinatory logic},
author={Cardone, Felice and Hindley, J Roger},
journal={Handbook of the History of Logic},
volume={5},
pages={723--817},
year={2006},
publisher={Elsevier, Amsterdam, to appear}
}