Preprint
Dependently-Typed Formalisation of Typed Term Graphs
Abstract
We employ the dependently-typed programming language Agda2 to explore
formalisation of untyped and typed term graphs directly as set-based graph
Authors
Kahl W
Publication date
February 13, 2011
DOI
10.48550/arxiv.1102.2653
Preprint server
arXiv