Gramática livre de contexto para tipagem de grafos em linguagem de programação

Abstract

This work proposes the development of a context-free grammar for graph typing, aiming to formalize the characteristics of these structures in computational systems. The increasing complexity of graph-based systems, used in domains such as social networks, logistics systems, and data science, demands tools that ensure consistency and safety in handling these structures. The proposed grammar defines types for vertices and edges, as well as establishes composition rules and semantic validation. The project focuses on planning the grammar and modeling an interpreter capable of validating and inferring properties of graphs. It is expected that the future implementation of this proposal (in a subsequent thesis) will result in a formal and efficient approach to graph typing, contributing to the reliability of computational systems that rely on these structures.