A bisimulation for type abstraction and recursion

DOI10.1145/1040305.1040311zbMath1369.68117OpenAlexW2122220040MaRDI QIDQ5276135

Eijiro Sumii, Benjamin C. Pierce

Publication date: 14 July 2017

Published in: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cis_papers/151

zbMATH Keywords

bisimulationslambda-calculuslogical relationscontextual equivalencerecursive typesexistential types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Related Items (10)

A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ A bisimulation for dynamic sealing ⋮ Full abstraction for polymorphic \(\pi \)-calculus ⋮ From Applicative to Environmental Bisimulation ⋮ Bisimulation and coinduction enhancements: a historical perspective ⋮ (Bi)simulations up-to characterise process semantics ⋮ Observational program calculi and the correctness of translations ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Lightweight Static Capabilities

This page was built for publication: A bisimulation for type abstraction and recursion