Extending the Interaction Nets Calculus by Generic Rules

Jiresch, Eugen

doi:10.4204/eptcs.101.2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Variadic Rewriting Rules1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2020

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…compound node in [5]). Here, we present an extension to the port graph rewriting rule language, called variadic rewriting rules (VRRs), inspired by Variadic Interaction Nets [18]. A variadic rule represents a family of rules that differ only in the number of times a subgraph is repeated.…”

Section: Variadic Rewriting Rulesmentioning

confidence: 99%

A Port Graph Rewriting Approach to Relational Database Modelling

Fernández

Pinaud

Varga

2020

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

We present new algorithms to compute the Syntactic Closure and the Minimal Cover of a set of functional dependencies, using strategic port graph rewriting. We specify a Visual Domain Specific Language to model relational database schemata as port graphs, and provide an extension to port graph rewriting rules. Using these rules we implement strategies to compute a syntactic closure, analyse it and find minimal covers, essential for schema normalisation. The graph program provides a visual description of the computation steps coupled with analysis features not available in other approaches. We prove soundness and completeness of the computed closure. This methodology is implemented in PORGY.

show abstract

Section: Variadic Rewriting Rulesmentioning

confidence: 99%