I recently bump my website generator from hexo to hugo. The content of my blog is under reconstruction.
On Precision of Domain Combination (1)2025-09-18 𝕀n static analysis based on abstract interpretation, convex abstract domains such as the interval, octagon, or polyhedra domains are often employed to capture numerical invariants. However, these …
Read More → | posts |
On Program Semantics2025-09-11 𝕋he semantics of a program is defined classically in a very general way in small step operational form, as a transition system: $(\Sigma, \tau, I)$, where $\Sigma$ is a set of states, $I \subseteq …
Read More → | posts |
Adequacy and Full Abstraction2025-08-10 𝕀n programming language theory, we often relate:
[…] together with notions of program equivalence and a translation between them.
The notions of Adequacy and Full Abstraction characterize how …
Read More → | posts |
Notes on PL 14: Lambda Calculus Encodings2025-01-31 𝕋he pure \(\lambda\)-calculus contains only functions as values. It is not exactly easy to write large or interesting programs in the pure \(\lambda\)-calculus. We can however encode objects, such as …
Read More → | posts |
Notes on PL 06: Denotational Semantics2024-10-02 𝕎e have now seen two operational models for programming languages: small-step and large-step. In this nnote, we consider a different semantic model, called denotational semantics.
The idea in …
Read More → | posts |
Notes on PL 05: IMP Properties2024-09-25 𝕋he small-step and large-step semantics are equivalent as captured by the following theorem.
Theorem. For all commands $c$ and stores $\sigma$ and $\sigma'$ we have […] The proof is left as an …
Read More → | posts |
Notes on PL 04: the IMP Language2024-09-16 𝕎e will now consider a more realistic programming language, one where we can assign values to variables and execute control constructs such as if and while. The syntax for this imperative language, …
Read More → | posts |
Notes on PL 03 Large Step Semantics2024-09-09 𝕀n the last lecture we defined a semantics for our language of arithmetic expressions using a small-step evaluation relation $\rightarrow \subseteq \mathbf{Config}\times \mathbf{Config}$ (and its …
Read More → | posts |
Notes on PL 02: Inductive Definitions and Proofs2024-09-02 𝕀n this note, we will use the semantics of our simple language of arithmetic expressions, […] to express useful program properties, and we will prove these properties by induction.
[…] …
Read More → | posts |
Notes on PL 01: Introduction to Semantics2024-08-26 𝕎hat is the meaning of a program? When we write a program, we represent it using sequences of characters. But these strings are just concrete syntax—they do not tell us what the program actually …
Read More → | posts |