Computer Science – Logic in Computer Science
Scientific paper
2007-04-22
Computer Science
Logic in Computer Science
12 pages
Scientific paper
We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as requested by Ghani and Uustalu (2003): in our setting, merging two extensions of syntax corresponds to building an amalgamated sum. Finally we define a natural notion of equation concerning a signature and prove the existence of an initial semantics for a so-called representable signature equipped with a set of equations.
Hirschowitz André
Maggesi Marco
No associations
LandOfFree
Higher-order theories 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 Higher-order theories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Higher-order theories will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-466762