Mechanizing Operads with Event-B
By: Christian Attiogbé
Rigorous modelling of natural and industrial systems still conveys various challenges related to abstractions, methods to proceed with and easy-to-use tools to build, compose and reason on models. Operads are mathematical structures that provide such abstractions to compose various objects and garanteeing well-formedness. Concrete implementations of operads will offer practical means to exploit operads and to use them for various technical applications. Going from the mathematical structures, we develop with Event-B a complete refinement chain that implements algebraic operads and their basic operations. The result of this work, can be used from the methodological point of view to handle similar implementations for symbolic computation questions, and also to reason on symbolic computation applications supported by operads structures.
Similar Papers
One rig to control them all
Logic in Computer Science
Makes computers follow instructions more easily.
A Foundational Theory of Quantitative Abstraction: Adjunctions, Duality, and Logic for Probabilistic Systems
Logic in Computer Science
Makes complex computer predictions more accurate.
Complex Bounded Operators in Isabelle/HOL
Logic in Computer Science
Makes math proofs about complex spaces easier.