110 search results - page 13 / 22 » Interpolation in Local Theory Extensions |
128
Voted
POPL
2010
ACM
16 years 1 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
144
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
155
click to vote
AC
2000
Springer
15 years 8 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
140
Voted
ICPR
2006
IEEE
16 years 4 months ago
2006
IEEE
1 A kernel determines the inductive bias of a learning algorithm on a specific data set, and it is beneficial to design specific kernel for a given data set. In this work, we propo...
150
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...