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

03/31/2021
by   Tom Hirschowitz, et al.
0

Applicative bisimilarity is a coinductive characterisation of observational equivalence in call-by-name lambda-calculus, introduced by Abramsky in 1990. Howe (1989) gave a direct proof that it is a congruence. We propose a categorical framework for specifying operational semantics, in which we prove that (an abstract analogue of) applicative bisimilarity is automatically a congruence. Example instances include standard applicative bisimilarity in call-by-name and call-by-value λ-calculus, as well as in a simple non-deterministic variant.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/31/2021

Superposition with Lambdas

We designed a superposition calculus for a clausal fragment of extension...
07/12/2021

Coherent differentiation

The categorical models of the differential lambda-calculus are additive ...
09/04/2017

Distributive Laws for Monotone Specifications

Turi and Plotkin introduced an elegant approach to structural operationa...
06/29/2018

Divergence and unique solution of equations

We study proof techniques for bisimilarity based on unique solution of e...
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...
06/13/2021

Linear representation of categorical values

We propose a binary representation of categorical values using a linear ...
01/16/2018

On the characterization of models of H* : The operational aspect

We give a characterization, with respect to a large class of models of u...
This week in AI

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