Bisimilarity as a theory of functional programming

DOI10.1016/S0304-3975(98)00353-3zbMath0968.68028OpenAlexW1979328536MaRDI QIDQ1575889

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

functional programmingbisimilarityco-induction

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)

Related Items (15)

Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus ⋮ A categorical framework for congruence of applicative bisimilarity in higher-order languages ⋮ Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) ⋮ A Complete, Co-inductive Syntactic Theory of Sequential Control and State ⋮ A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case ⋮ Reasoning about multi-stage programs ⋮ On generic context lemmas for higher-order calculi with sharing ⋮ Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi ⋮ \(p\)-adic physics, non-well-founded reality and unconventional computing ⋮ On the observational theory of the CPS-calculus ⋮ Operational domain theory and topology of sequential programming languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Observational program calculi and the correctness of translations ⋮ Amb Breaks Well-Pointedness, Ground Amb Doesn't

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