Bisimilarity as a theory of functional programming

DOI10.1016/S0304-3975(98)00353-3MaRDI QIDQ1575889zbMATH OpenOpenAlexFDO

Authors Andrew D. Gordon

Publication date 23 August 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00353-3

zbMATH Keywords

bisimilarityco-inductionfunctional programming

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Review text

The objektive of this paper is to use CCS-style labbelled transitions and bisimilarity to offer a new perspective on the behavior of functional programs. Morris-style contextual equivalence is characterized in terms of reduction behavior and production of values.

Recommendations

• scientific article; zbMATH DE number 1231459
• Proving congruence of bisimulation in functional programming languages
• Logical Bisimulations and Functional Languages
• scientific article; zbMATH DE number 860036

Cited in

(22)

• Operational domain theory and topology of sequential programming languages
• p-adic physics, non-well-founded reality and unconventional computing
• Proving congruence of bisimulation in functional programming languages
• Observational program calculi and the correctness of translations
• Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State
• Asymptotic speedups, bisimulation and distillation (work in progress)
• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
• scientific article; zbMATH DE number 1231459 (Why is no real title available?)
• scientific article; zbMATH DE number 1231604 (Why is no real title available?)
• scientific article; zbMATH DE number 860036 (Why is no real title available?)
• A categorical framework for congruence of applicative bisimilarity in higher-order languages
• scientific article; zbMATH DE number 7407781 (Why is no real title available?)
• Amb Breaks Well-Pointedness, Ground Amb Doesn't
• Reasoning about multi-stage programs
• Bisimulations for delimited-control operators
• From applicative to environmental bisimulation
• Logical predicates in higher-order mathematical operational semantics
• Bialgebraic reasoning on higher-order program equivalence
• On generic context lemmas for higher-order calculi with sharing
• Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
• On the observational theory of the CPS-calculus

This page was built for publication: Bisimilarity as a theory of functional programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575889)