Dependently-typed formalisation of typed term graphs

MaRDI QIDQ4964703zbMATH OpenFDO

Authors Wolfram Kahl

Publication date 3 March 2021

Full work available at URL https://arxiv.org/abs/1102.2653, http://eptcs.web.cse.unsw.edu.au/paper.cgi?TERMGRAPH2011.6

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A flexible categorial formalisation of term graphs as directed hypergraphs
• Dependently-typed formalisation of relation-algebraic abstractions
• scientific article; zbMATH DE number 1262795
• Dependently typed programming in Agda
• A Formalisation of a Dependently Typed Language as an Inductive-Recursive Family

Cited in

(7)

• A flexible categorial formalisation of term graphs as directed hypergraphs
• Dependently-typed formalisation of relation-algebraic abstractions
• Dependently Typed Grammars
• scientific article; zbMATH DE number 125890 (Why is no real title available?)
• Towards ``mouldable code via nested code graph transformation
• scientific article; zbMATH DE number 1262795 (Why is no real title available?)
• Semantics-preserving DPO-based term graph rewriting

This page was built for publication: Dependently-typed formalisation of typed term graphs

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