Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Abstract : 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02966439
Contributor : Tom Hirschowitz <>
Submitted on : Tuesday, March 30, 2021 - 9:09:19 AM
Last modification on : Thursday, April 1, 2021 - 3:31:29 AM

Files

brouillon.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Tom Hirschowitz, Ambroise Lafont. A categorical framework for congruence of applicative bisimilarity in higher-order languages. 2021. ⟨hal-02966439v3⟩

Share

Metrics

Record views

13

Files downloads

13