research
∙
06/23/2023
Extended Addressing Machines, explicit substitutions, PCF, definability, full abstraction
Extended addressing machines (EAMs) have been introduced to represent hi...
share
research
∙
12/09/2022
Extended Addressing Machines for PCF, with Explicit Substitutions
Addressing machines have been introduced as a formalism to construct mod...
research
∙
07/01/2021
Addressing Machines as models of lambda-calculus
Turing machines and register machines have been used for decades in theo...
research
∙
04/15/2019
The Bang Calculus and the Two Girard's Translations
We study the two Girard's translations of intuitionistic implication int...
research
∙
09/07/2018
Revisiting Call-by-value Bohm trees in light of their Taylor expansion
The call-by-value lambda calculus can be endowed with permutation rules,...
research
∙
02/20/2018
