Bisimilarity as a theory of functional programming
From MaRDI portal
Publication:1575889
DOI10.1016/S0304-3975(98)00353-3zbMATH Open0968.68028OpenAlexW1979328536MaRDI QIDQ1575889FDOQ1575889
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
Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (16)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
- On the observational theory of the CPS-calculus
- Asymptotic Speedups, Bisimulation and Distillation (Work in Progress)
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus
- Amb Breaks Well-Pointedness, Ground Amb Doesn't
- \(p\)-adic physics, non-well-founded reality and unconventional computing
- Observational program calculi and the correctness of translations
- Title not available (Why is that?)
- Logical predicates in higher-order mathematical operational semantics
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State
- Operational domain theory and topology of sequential programming languages
- Reasoning about multi-stage programs
- A categorical framework for congruence of applicative bisimilarity in higher-order languages
- On generic context lemmas for higher-order calculi with sharing
- Title not available (Why is that?)
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)
