Abstract—We present a logical correspondence between natural semantics and abstract machines. This correspondence enables machine from a natural semantics. Our logical correspondence mirrors the Reynolds functional correspondence but places it in a logical setting, as both semantics are encoded in a substructural logical framework. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.