Technology Category
Constraint Satisfaction and Optimization: Satisfiability Modulo TheoriesKnowledge Representation and Reasoning: Automated Reasoning and Theorem ProvingReasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty
A Coq implementation of a Theory of Tagged Objects
🤖 AI Summary
This paper addresses the lack of formal foundations for the Theory of Tagged Objects by presenting its first complete formalization in Coq: we define an inductive encoding of tagged types, construct a semantic interpretation and type system, and mechanize the proof of the core soundness theorem. Methodologically, we leverage Coq’s inductive types and propositional logic, combining structural induction with semantic consistency verification to ensure strict correspondence between typing rules and dynamic behavior. Our main contributions are: (1) the first verifiable Coq implementation of the Theory of Tagged Objects; (2) a formally specified inductive encoding scheme for tagged types; and (3) an end-to-end soundness assurance mechanism—integrating syntax, semantics, and typing derivations. This work establishes a rigorous foundation for verified semantic modeling and the design of safety-critical programming languages.
Technology Category
Application Category
📝 Abstract
We present a first step towards the Coq implementation of the Theory of Tagged Objects formalism. The concept of tagged types is encoded, and the soundness proofs are discussed with some future work suggestions.
Problem
Research questions and friction points this paper is trying to address.
Coq implementation of Tagged Objects
Encoding concept of tagged types
Soundness proofs and future work
Innovation
Methods, ideas, or system contributions that make the work stand out.
Coq implementation
Theory of Tagged Objects
Tagged types encoding
🔎 Similar Papers
No similar papers found.
