fKenzo: A user interface for computations in Algebraic Topology
نویسندگان
چکیده
منابع مشابه
fKenzo: A user interface for computations in Algebraic Topology
fKenzo (= f riendly Kenzo) is a graphical user interface providing a user-friendly front-end for the Kenzo system, a Common Lisp program devoted to Algebraic Topology. The fKenzo system provides the user interface itself, an XML intermediary generator-translator and, finally the Kenzo kernel. We describe in this paper the main points of fKenzo, and we explain also the advantages and limitations...
متن کاملUser Interface Design in Mobile Educational Applications
Introduction: User interfaces are a crucial factor in ensuring the success of mobile applications. Mobile Educational Applications not only provide flexibility in learning, but also allow learners to learn at any time and any place. The purpose of this article is to investigate the effective factors affecting the design of the user interface in mobile educational applications. Methods: Quantita...
متن کاملA System for Computing and Reasoning in Algebraic Topology
In this paper we present the fKenzo system, an integral assistant for teaching and research in (a subset of) Algebraic Topology. The fKenzo system provides a friendly graphical user interface which allows the user to interact with both the Kenzo and GAP Computer Algebra systems and, also, with the ACL2 Theorem Prover by means of an intermediary layer based on XML technology.
متن کاملCategorically-algebraic topology and its applications
This paper introduces a new approach to topology, based on category theory and universal algebra, and called categorically-algebraic (catalg) topology. It incorporates the most important settings of lattice-valued topology, including poslat topology of S.~E.~Rodabaugh, $(L,M)$-fuzzy topology of T.~Kubiak and A.~v{S}ostak, and $M$-fuzzy topology on $L$-fuzzy sets of C.~Guido. Moreover, its respe...
متن کاملCanonical Bases for Algebraic Computations
We investigate, for quotients of the non-commutative polynomial ring, a property that implies finiteness of Gröbner bases computation, and examine its connection with Noetherianity. We propose a Gröbner bases theory for our factor algebras, of particular interest for one-sided ideals, and show a few applications, e.g. how to compute (one-sided) syzygy modules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2011
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2011.01.005