On the notion of good encoding

Daniele Gorla

Traditionally, expressiveness of programming languages is evaluated by mostly relying on the possibility for a fully abstract encoding. We start by showing that this notion can be unsatisfactory and then move to notions that are better suited for comparing different programming paradigms.

Even if the running examples rely on formalisms drawn from concurrency theory (i.e. pi-calculus and related calculi), the talk is not targeted to specialists and contains few technicalities.