The following pages link to Alexandra Silva (Q418133):
Displaying 47 items.
- CoCaml: Functional Programming with Regular Coinductive Types (Q4589614) (← links)
- (Q4600775) (← links)
- Position Automata for Kleene Algebra with Tests (Q4621165) (← links)
- (Q4637688) (← links)
- Generalizing determinization from automata to coalgebras (Q4913772) (← links)
- On Moessner’s Theorem (Q4921852) (← links)
- (Q5002798) (← links)
- (Q5089251) (← links)
- CONCUR Test-of-time award 2020 announcement (Q5089268) (← links)
- (Q5089285) (← links)
- (Q5091269) (← links)
- (Q5092360) (← links)
- (Q5111197) (← links)
- (Q5111636) (← links)
- (Q5111639) (← links)
- Toward a Uniform Theory of Effectful State Machines (Q5121274) (← links)
- Semantics of Probabilistic Programming: A Gentle Introduction (Q5150945) (← links)
- (Q5155671) (← links)
- (Q5155681) (← links)
- Proceedings Fifth Interaction and Concurrency Experience (Q5208626) (← links)
- (Q5277876) (← links)
- Language Constructs for Non-Well-Founded Computation (Q5326277) (← links)
- Enhanced coalgebraic bisimulation (Q5361143) (← links)
- Well-founded coalgebras, revisited (Q5361146) (← links)
- Practical coinduction (Q5361147) (← links)
- Cantor meets Scott: semantic foundations for probabilistic networks (Q5370889) (← links)
- Learning nominal automata (Q5370894) (← links)
- Algebra-coalgebra duality in brzozowski's minimization algorithm (Q5410330) (← links)
- Initial Algebras of Terms with Binding and Algebraic Structure (Q5414966) (← links)
- Automata Learning: A Categorical Perspective (Q5418974) (← links)
- Coalgebraic Logic and Synthesis of Mealy Machines (Q5458362) (← links)
- Calculating Invariants as Coreflexive Bisimulations (Q5505417) (← links)
- Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems (Q5739363) (← links)
- Tree automata as algebras: minimisation and determinisation (Q5875346) (← links)
- (Q5875403) (← links)
- (Q5875638) (← links)
- (Q6061682) (← links)
- Preservation of Equations by Monoidal Monads (Q6333059) (← links)
- A complete inference system for skip-free guarded Kleene algebra with tests (Q6535242) (← links)
- Symbolic semantics for probabilistic programs (Q6546469) (← links)
- Processes parametrised by an algebraic theory (Q6560935) (← links)
- Minimisation in logical form (Q6612779) (← links)
- Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity (Q6638146) (← links)
- Generators and bases for monadic closures (Q6643056) (← links)
- On star expressions and completeness theorems (Q6653760) (← links)
- Canonical automata via distributive law homomorphisms (Q6653763) (← links)
- A cyclic proof system for Guarded Kleene Algebra with Tests (full version) (Q6728452) (← links)
