-homotopy and refinement of observation. II: Adding new -homotopy equivalences.
: a proposed framework for using topic maps to manage information in blood donation units.
Table of Contents
Taclets: a new paradigm for constructing interactive theorem provers.
Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules...
Tamaño medio de árboles simplificados.
Estudiamos la media y la varianza del tamaño de los árboles simplificados obtenidos a partir de árboles p-arios y generales. Se demuestra que ambos parámetros son lineales en el tamaño del input. Pero lo que creemos más interesante del artículo es la metodología seguida, que pensamos podría aplicarse al análisis de gran parte de algoritmos de simplificación sobre árboles. Tal técnica involucra un estudio de ciertas series de potencias formales, y la aplicación del teorema de Darboux-Polya para aproximaciones...
Taming the wild in impartial combinatorial games.
Techniques for the refinement of orthogonal graph drawings.
Telecope: An object-oriented architecture for visualization systems.
Tenseurs et machines
Tensor product of partially-additive monoids.
Teoretické problémy technickej kybernetiky
Teoretické základy informatiky
Teoria dei domini nell’interpretazione astratta: equazioni, completezza e logica
Termination checking with types
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe and strongly normalizing. The main novelty is a bidirectional type checking algorithm whose soundness is...
Termination checking with types
The paradigm of type-based termination is explored for functional programming with recursive data types. The article introduces , a lambda-calculus with recursion, inductive types, subtyping and bounded quantification. Decorated type variables representing approximations of inductive types are used to track the size of function arguments and return values. The system is shown to be type safe and strongly normalizing. The main novelty is a bidirectional type checking algorithm whose ...
Test lineární separability
Testing and Validation of an Expert System for Advising on Spares for Maintenance Purposes
Testing statistical hypotheses in fuzzy environment.
In traditional statistics all parameters of the mathematical model and possible observations should be well defined. Sometimes such assumption appears too rigid for the real-life problems, especially while dealing with linguistic data or imprecise requirements. To relax this rigidity fuzzy methods are incorporated into statistics. We review hitherto existing achievements in testing statistical hypotheses in fuzzy environment, point out their advantages or disadvantages and practical problems. We...
Testing the logarithmic comparison theorem for free divisors.
Tests de primalité d'après Adleman, Rumely, Pomerance et Lenstra