scientific article; zbMATH DE number 3856436
From MaRDI portal
Publication:3325069
Recommendations
Cited in
(21)- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Algebraic solutions to recursion schemes
- Interpretations of recursion under unbounded nondeterminacy
- Domain theory in logical form
- Continuations in possible-world semantics
- An extensional fixed-point semantics for nondeterministic data flow
- The expressive power of indeterminate dataflow primitives
- Nonexpressibility of fairness and signaling
- A fully abstract semantics for a higher-order functional language with nondeterministic computation
- Inferring probability comparisons
- Whither semantics?
- Infinite trace equivalence
- A domain equation for bisimulation
- The bicategory-theoretic solution of recursive domain equations
- scientific article; zbMATH DE number 3876562 (Why is no real title available?)
- Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes
- scientific article; zbMATH DE number 1231463 (Why is no real title available?)
- scientific article; zbMATH DE number 1472273 (Why is no real title available?)
- A category-theoretic semantics for unbounded indeterminacy
- A presheaf semantics of value-passing processes
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325069)
