Skip to content

CEK rules for constr and case #7419

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

CEK rules for constr and case #7419

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ca9405f
Add missing empty list in CEK compute rule of constr
basetunnel Nov 14, 2025
37469c5
Reverse order of application frames in CEK return rule of case
basetunnel Nov 14, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions doc/plutus-core-spec/untyped-cek-machine.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -126,7 +126,7 @@ \section{The CEK machine}
s;\rho & \compute \delay{M} &~\mapsto~& s\return \VDelay{M}{\rho}\\
s;\rho & \compute \force{M} &~\mapsto~& \inForceFrame{} \cons s;\rho \compute M \\
s;\rho & \compute \appU{M}{N} &~\mapsto~& \inAppLeftFrame{(N,\rho)} \cons s ;\rho \compute M\\
s;\rho & \compute \constr{i}{M \cons \repetition{M}} &~\mapsto~& \inConstrFrame{i}{}{(\repetition{M},\rho)} \cons s ;\rho \compute M\\
s;\rho & \compute \constr{i}{M \cons \repetition{M}} &~\mapsto~& \inConstrFrame{i}{[]}{(\repetition{M},\rho)} \cons s ;\rho \compute M\\
s;\rho & \compute \constr{i}{[]} &~\mapsto~& s \return \VConstr{i}{[]}\\
s;\rho & \compute \kase{N}{\repetition{M}} &~\mapsto~& \inCaseFrame{(\repetition{M},\rho)} \cons s ;\rho \compute N\\
% No nullary builtins (yet)
Expand Down Expand Up @@ -155,7 +155,7 @@ \section{The CEK machine}
\inConstrFrame{i}{\repetition{V}}{([], \rho)} \cons s & \return V &~\mapsto~&
s \return \VConstr{i}{\repetition{V} \cons V} \\
\inCaseFrame{(M_1 \ldots M_n, \rho)} \cons s & \return \VConstr{i}{V_1 \ldots V_m} &~\mapsto~&
\inAppLeftFrame{V_m} \cons \cdots \cons \inAppLeftFrame{V_1} \cons s ;\rho \compute M_{i+1} \enskip \text{if $0 \leq i \leq n-1$}
\inAppLeftFrame{V_1} \cons \cdots \cons \inAppLeftFrame{V_m} \cons s ;\rho \compute M_{i+1} \enskip \text{if $0 \leq i \leq n-1$}
\end{alignat*}
\end{minipage}
\caption{CEK machine transitions for Plutus Core}
Expand Down
Loading