PL researcher thinking about the future of distributed systems
> PhD from UIUC
> Postdoc at SDU
> Cohost of the Type Theory Forall podcast
> dplyukhin.github.io
(1) Past models need dozens of rules to explain the semantics. Ours has ten.
(2) We give laws to help you design the right semantics. The laws work: we found three bugs in previous versions of Chorλ.
(3) Ours is similar to non-strict calculi, but with a "choreographic" flavor.
(1) Past models need dozens of rules to explain the semantics. Ours has ten.
(2) We give laws to help you design the right semantics. The laws work: we found three bugs in previous versions of Chorλ.
(3) Ours is similar to non-strict calculi, but with a "choreographic" flavor.
But seriously, does this mean you prefer deep embeddings over mixed embeddings for (say) a simple imperative language? I’m new to this whole conversation :p
But seriously, does this mean you prefer deep embeddings over mixed embeddings for (say) a simple imperative language? I’m new to this whole conversation :p