Dependently-Typed Formalisation of Typed Term Graphs

Details Dependently-Typed Formalisation of Typed Term Graphs Dependently-Typed Formalisation of Typed Term Graphs

2011-02-14

arxiv.org/abs/1102.2653v1

EPTCS 48, 2011, pp. 38-53

Computer Science

Logic in Computer Science

In Proceedings TERMGRAPH 2011, arXiv:1102.2268

Scientific paper

10.4204/EPTCS.48.6

We employ the dependently-typed programming language Agda2 to explore
formalisation of untyped and typed term graphs directly as set-based graph
structures, via the gs-monoidal categories of Corradini and Gadducci, and as
nested let-expressions using Pouillard and Pottier's NotSoFresh library of
variable-binding abstractions.

Affiliated with

Also associated with

No associations

Rating

Dependently-Typed Formalisation of Typed Term Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dependently-Typed Formalisation of Typed Term Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependently-Typed Formalisation of Typed Term Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-213638