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

by   Jean-Marie Madiot, et al.

The bisimulation proof method can be enhanced by employing `bisimulations up-to' techniques. A comprehensive theory of such enhancements has been developed for first-order (i.e., CCS-like) labelled transition systems (LTSs) and bisimilarity, based on abstract fixed-point theory and compatible functions. We transport this theory onto languages whose bisimilarity and LTS go beyond those of first-order models. The approach consists in exhibiting fully abstract translations of the more sophisticated LTSs and bisimilarities onto the first-order ones. This allows us to reuse directly the large corpus of up-to techniques that are available on first-order LTSs. The only ingredient that has to be manually supplied is the compatibility of basic up-to techniques that are specific to the new languages. We investigate the method on the pi-calculus, the lambda-calculus, and a (call-by-value) lambda-calculus with references.



There are no comments yet.


page 1

page 2

page 3

page 4


On Up-to Context Techniques in the π-calculus

We present a variant of the theory of compatible functions on relations,...

Abstract categorial grammars with island constraints and effective decidability

A well-known approach to treating syntactic island constraints in the se...

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

Applicative bisimilarity is a coinductive characterisation of observatio...

Modules over monads and operational semantics

This paper is a contribution to the search for efficient and high-level ...

Recursion and Sequentiality in Categories of Sheaves

We present a fully abstract model of a call-by-value language with highe...

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

We give a characterization, with respect to a large class of models of u...

A Calculus for Modular Loop Acceleration

Loop acceleration can be used to prove safety, reachability, runtime bou...
This week in AI

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