Mathematical models of computational and combinatorial structures

DOI10.1007/978-3-540-31982-5_2MaRDI QIDQ5705887zbMATH OpenOpenAlexFDO

Authors Marcelo P. Fiore

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106850

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Free-algebra models for the \(\pi \)-calculus
• The cartesian closed bicategory of generalised species of structures
• Computable Models
• Calculi for interaction
• Presheaf models for the -calculus

Cited in

(16)

• Relative pseudomonads, Kleisli bicategories, and substitution monoidal structures
• Analytic functors between presheaf categories over groupoids
• Exhaustive generation of atomic combinatorial differential operators
• Monoidal indeterminates and categories of possible worlds
• Data types with symmetries and polynomial functors over groupoids
• scientific article; zbMATH DE number 3847211 (Why is no real title available?)
• Monoidal indeterminates and categories of possible worlds
• The linear-non-linear substitution 2-monad
• Quantitative foundations for resource theories
• On operads, bimodules and analytic functors
• Mathematical model of stored logic based computation
• Monoidal Kleisli bicategories and the arithmetic product of coloured symmetric sequences
• Stabilized profunctors and stable species of structures
• Automata and coalgebras in categories of species
• An axiomatics and a combinatorial model of creation/annihilation operators
• A finite algebraic presentation of Lawvere theories in the object-classifier topos

This page was built for publication: Mathematical models of computational and combinatorial structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705887)