1209 search results - page 44 / 242 » Universal Algebra and Computer Science |
ITP
2010
13 years 10 months ago
2010
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These i...
TLDI
2009
ACM
14 years 5 months ago
2009
ACM
Syntax Arthur Baars Doaitse Swierstra Technical Report UU-CS-2008-021 July 2008 Department of Information and Computing Sciences Utrecht University, Utrecht, The Netherlands www.cs...
ESA
2006
Springer
14 years 11 days ago
2006
Springer
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
TCS
2011
13 years 3 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...