Bisimilarity as a theory of functional programming

DOI10.1016/S0304-3975(98)00353-3zbMath0968.68028MaRDI 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 programming; bisimilarity; co-induction

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Unnamed Item, A categorical framework for congruence of applicative bisimilarity in higher-order languages, Unnamed Item, Amb Breaks Well-Pointedness, Ground Amb Doesn't, Reasoning about multi-stage programs, Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus, 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, Operational domain theory and topology of sequential programming languages, \(p\)-adic physics, non-well-founded reality and unconventional computing, Observational program calculi and the correctness of translations, 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