ionchy
/
CIS6700-Spring2025
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Minor edits

This commit is contained in:
Jonathan Chan 2025-04-18 16:52:02 -04:00
parent e5c0950bef
commit fb9e31fddf
3 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
cbpv.mng
View File

@ -8,7 +8,7 @@
\usepackage[margin=1in]{geometry} \usepackage[margin=1in]{geometry}
\usepackage{enumitem,float,booktabs,xspace,doi} \usepackage{enumitem,float,booktabs,xspace,doi}
\usepackage{amsmath,amsthm,amssymb} \usepackage{amsmath,amsthm,amssymb}
\usepackage[capitalize,nameinlink]{cleveref} \usepackage[capitalize,nameinlink,noabbrev]{cleveref}
\usepackage{mathpartir,mathtools,stmaryrd} \usepackage{mathpartir,mathtools,stmaryrd}
\setlist{nosep} \setlist{nosep}
@ -436,7 +436,7 @@ so I present them here as admissible rules.
All the hard work happens in these lemmas; All the hard work happens in these lemmas;
the fundamental theorem of soundness of syntactic typing with respect to semantic typing the fundamental theorem of soundness of syntactic typing with respect to semantic typing
then follows directly. then follows directly.
Normalization holds as an easy corollary. Normalization holds as a corollary.
{\mprset{fraction={-~}{-~}{-}} {\mprset{fraction={-~}{-~}{-}}
\drules[S]{$[[G ⊧ v : A]]$}{admissible semantic value typing}{Var,Unit,Inl,Inr,Thunk} \drules[S]{$[[G ⊧ v : A]]$}{admissible semantic value typing}{Var,Unit,Inl,Inr,Thunk}

BIN
cbpv.pdf (Stored with Git LFS)
View File

Binary file not shown.

4
cbpv.tex
View File

@ -8,7 +8,7 @@
\usepackage[margin=1in]{geometry} \usepackage[margin=1in]{geometry}
\usepackage{enumitem,float,booktabs,xspace,doi} \usepackage{enumitem,float,booktabs,xspace,doi}
\usepackage{amsmath,amsthm,amssymb} \usepackage{amsmath,amsthm,amssymb}
\usepackage[capitalize,nameinlink]{cleveref} \usepackage[capitalize,nameinlink,noabbrev]{cleveref}
\usepackage{mathpartir,mathtools,stmaryrd} \usepackage{mathpartir,mathtools,stmaryrd}
\setlist{nosep} \setlist{nosep}
@ -436,7 +436,7 @@ so I present them here as admissible rules.
All the hard work happens in these lemmas; All the hard work happens in these lemmas;
the fundamental theorem of soundness of syntactic typing with respect to semantic typing the fundamental theorem of soundness of syntactic typing with respect to semantic typing
then follows directly. then follows directly.
Normalization holds as an easy corollary. Normalization holds as a corollary.
{\mprset{fraction={-~}{-~}{-}} {\mprset{fraction={-~}{-~}{-}}
\drules[S]{$ \Gamma \vDash \ottnt{v} : \ottnt{A} $}{admissible semantic value typing}{Var,Unit,Inl,Inr,Thunk} \drules[S]{$ \Gamma \vDash \ottnt{v} : \ottnt{A} $}{admissible semantic value typing}{Var,Unit,Inl,Inr,Thunk}