Sciweavers

2853 search results - page 334 / 571
» On Coherence in Computer Algebra
Sort
View
LICS
2003
IEEE
15 years 9 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard
ITS
2010
Springer
178views Multimedia» more  ITS 2010»
15 years 9 months ago
Learning by Teaching SimStudent
The purpose of the current study was to test whether we could create a system where students can learn by teaching a live machine-learning agent. SimStudent is a computer agent tha...
Noboru Matsuda, Victoria Keiser, Rohan Raizada, Ga...
FM
2001
Springer
130views Formal Methods» more  FM 2001»
15 years 9 months ago
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
Mícheál Mac an Airchinnigh
ICCAD
1999
IEEE
119views Hardware» more  ICCAD 1999»
15 years 8 months ago
Factoring logic functions using graph partitioning
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
Martin Charles Golumbic, Aviad Mintz
ARTS
1997
Springer
15 years 8 months ago
Regular Processes and Timed Automata
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
Pedro R. D'Argenio