scientific article; zbMATH DE number 7804593
From MaRDI portal
Publication:6193834
zbMath1530.68154arXiv2211.01841MaRDI QIDQ6193834
Publication date: 13 February 2024
Full work available at URL: https://arxiv.org/abs/2211.01841
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Semantics in the theory of computing (68Q55) Categorical semantics of formal languages (18C50) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notions of computation and monads
- A game semantics for linear logic
- Structural induction and coinduction in a fibrational setting
- Non-angelic concurrent game semantics
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Recursive data types in algebraically \(\omega\)-complete categories
- Comparing approaches to free dcpo-algebra constructions
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Combining effects: sum and tensor
- Deep Specifications and Certified Abstraction Layers
- Formalizing the LLVM intermediate representation for verified program transformations
- From CSP to Game Semantics
- Understanding Game Semantics Through Coherence Spaces
- Asynchronous Games: Innocence Without Alternation
- Handlers of Algebraic Effects
- Games and full completeness for multiplicative linear logic
- Final Coalgebras are Ideal Completions of Initial Algebras
- Transition systems over games
- Nondeterminism in Game Semantics via Sheaves
- Algebras, Coalgebras, Monads and Comonads
- Refinement-Based Game Semantics for Certified Abstraction Layers
- Foundations of Software Science and Computation Structures
- A verified information-flow architecture
- CakeML
- Realization of Coinductive Types
- A linear category of polynomial diagrams
This page was built for publication:
