Pages that link to "Item:Q1575889"
From MaRDI portal
The following pages link to Bisimilarity as a theory of functional programming (Q1575889):
Displayed 15 items.
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus (Q283739) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi (Q964003) (← links)
- On the observational theory of the CPS-calculus (Q968276) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- \(p\)-adic physics, non-well-founded reality and unconventional computing (Q1760203) (← links)
- Observational program calculi and the correctness of translations (Q2339472) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) (Q3455068) (← links)
- A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- (Q5155670) (← links)
- Amb Breaks Well-Pointedness, Ground Amb Doesn't (Q5262940) (← links)
- Reasoning about multi-stage programs (Q5371979) (← links)
- (Q5377471) (← links)