Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines

05/13/2022
by   Małgorzata Biernacka, et al.
0

We present fully abstract encodings of the call-by-name and call-by-value λ-calculus into HOcore, a minimal higher-order process calculus with no name restriction. We consider several equivalences on the λ-calculus side – normal-form bisimilarity, applicative bisimilarity, and contextual equivalence – that we internalize into abstract machines in order to prove full abstraction of the encodings. We also demonstrate that this technique scales to the λμ-calculus, i.e., a standard extension of the λ-calculus with control operators.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

03/31/2021

A categorical framework for congruence of applicative bisimilarity in higher-order languages

Applicative bisimilarity is a coinductive characterisation of observatio...
01/20/2020

Modular coinduction up-to for higher-order languages via first-order transition systems

The bisimulation proof method can be enhanced by employing `bisimulation...
04/27/2020

The Benefit of Being Non-Lazy in Probabilistic λ-calculus

We consider the probabilistic applicative bisimilarity (PAB), a coinduct...
07/16/2020

Probabilistic Programming Semantics for Name Generation

We make a formal analogy between random sampling and fresh name generati...
10/18/2017

An intensionally fully-abstract sheaf model for π (expanded version)

Following previous work on CCS, we propose a compositional model for the...
08/16/2021

Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines

The functional correspondence is a manual derivation technique transform...
07/13/2019

Crumbling Abstract Machines

Extending the lambda-calculus with a construct for sharing, such as let ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.