Sciweavers

1209 search results - page 6 / 242
» Universal Algebra and Computer Science
Sort
View
AMAST
2006
Springer
14 years 10 days ago
Fork Algebras as a Sufficiently Rich Universal Institution
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
Carlos López Pombo, Marcelo F. Frias
SIGCSE
2010
ACM
132views Education» more  SIGCSE 2010»
14 years 3 months ago
Undergraduate computer science education in China
This paper examines the current status of professional computing education for undergraduate majors and fundamental computer education for non-majors in China. We describe the evo...
Ming Zhang, Virginia Mary Lo
SOFSEM
2000
Springer
14 years 4 days ago
Computing the Dimension of Linear Subspaces
Abstract. Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gau
Martin Ziegler, Vasco Brattka