You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: paper/paper.md
+8-2Lines changed: 8 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -46,7 +46,7 @@ authors:
46
46
- name: Hu, Jason Z. S.
47
47
orcid: 0000-0001-6710-6262
48
48
affiliation: 11
49
-
- name: Xia, Li-yiao
49
+
- name: Xia, Li-yao
50
50
orcid: 0000-0003-2673-4400
51
51
affiliation: 12
52
52
- name: You, Shu-Hung
@@ -95,7 +95,7 @@ Agda [@agda2024manual] is a dependently-typed functional
95
95
language that serves both as a traditional programming language
96
96
and as an interactive theorem prover (ITP).
97
97
In other words, its type system is expressive enough to formulate
98
-
complex formal requirements as types, and its compiler allows users to interactively build terms and check that they satisfy these requirements.
98
+
complex formal requirements on programs as types, and its compiler allows users to interactively build terms and check that they satisfy these requirements.
99
99
Through the Curry-Howard lens [@DBLP:journals/cacm/Wadler15],
100
100
these types and terms can be seen respectively as theorem
101
101
statements and proofs.
@@ -216,4 +216,10 @@ Many of the contributions to the library by the authors of this paper were made
216
216
217
217
- Jason Z. S. Hu made his contributions during his funded Master's and PhD study.
218
218
219
+
- Shu-Hung You was partially supported when contributing to the library by the
220
+
U.S. National Science Foundation under Awards No. 2237984 and No.
221
+
2421308. Any opinions, findings and conclusions or recommendations
222
+
expressed in this material are those of the author(s) and do not
223
+
necessarily reflect the views of the National Science Foundation.
0 commit comments