The following pages link to (Q4348453):
Displaying 28 items.
- A relational realizability model for higher-order stateful ADTs (Q444500) (← links)
- Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language (Q652158) (← links)
- Stone coalgebras (Q703523) (← links)
- Process algebra and constraint programming for modeling interactions in MAS (Q814899) (← links)
- Fully abstract models and refinements as tools to compare agents in timed coordination languages (Q1004066) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Fundamentals of control flow in workflows (Q1424346) (← links)
- ConGolog, a concurrent programming language based on the situation calculus (Q1583234) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- A note on distances between probabilistic and quantum distributions (Q2130591) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Widening for Control-Flow (Q2938087) (← links)
- Continuation Passing Semantics for Membrane Systems (Q2975910) (← links)
- Equational presentations of functors and monads (Q3005991) (← links)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics (Q3008383) (← links)
- Supporting control definition in programming languages (Q3345765) (← links)
- Process of petri nets extension (Q3415259) (← links)
- A quasi-metric computational model from modular functions on monoids (Q3643150) (← links)
- (Q4499206) (← links)
- Bisimulation for probabilistic transition systems: A coalgebraic approach (Q4571977) (← links)
- Extending set functors to generalised metric spaces (Q4625693) (← links)
- (Q5009421) (← links)
- (Q5109515) (← links)
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata (Q5418964) (← links)
- Denotational semantics for programming languages, balanced quasi-metrics and fixed points (Q5459745) (← links)
- On the structure of the space of complexity partial functions (Q5459746) (← links)
- Variants of spiking neural P systems and their operational semantics in Haskell (Q6048240) (← links)
- Spiking neural P systems and their semantics in Haskell (Q6177187) (← links)
