Abstract We have built the first family of tagless interpretations for a higher-order typed object language in metalanguage (Haskell or ML) that require no dependent types, generalized algebraic data postprocessing to eliminate tags. The statically type-preserving include an evaluator, compiler (or staged evaluator), partial and call-by-name call-by-value continuation-passing style (CPS) transformers. Our principal technique is encode de Bruijn abstract syntax using combinator functions...

Rig groupoids provide a semantic model of Π, universal classical reversible programming language over finite types. We prove that extending rig with just two maps and three equations about them results in quantum computing is computationally equationally sound complete for variety gate sets. The first map corresponds to an 8th root the identity morphism on unit 1. second square symmetry 1+1. As roots are generally not unique can sometimes even be trivial, constrained satisfy nondegeneracy...

We propose a complete model for the oxidation of silicon germanium. Our includes participation both and germanium atoms in process replacement by mixed oxides. is capable predicting, as function time, oxide thickness, profile underlying alloy, oxide. The parameters vary with temperature, alloy composition, oxidizing ambient. shows excellent agreement published results, following trends consistent physical phenomena hypothesized. presence catalyzes rates, all reaction rates increase...

We give the first formal definition of concept simplification for general expressions in context Computer Algebra Systems. The main mathematical tool is an adaptation theory Minimum Description Length, which closely related to various theories complexity, such as Kolmogorov Complexity and Algorithmic Information Theory. In particular, we show how this can justify use "magic constants" deciding between some equivalent representations expression, found implementations routines.

We present an experiment comparing five ammunition display methods in first-person shooter (FPS) games. These included both diegetic (in-game) and heads-up (HUD) options. HUD displays a bar, icons, counter. Diegetic were displayed in-game beside the player's weapon. Two evaluated: number bullets. compared performance offered by each player preference towards each. Results indicate that "number-in-game" performed best terms of reload time shots taken between running out reloading....

This paper is an exposition of different methods for computing closed forms definite sums. The focus on recently-developed results sums hypergeometric terms. A design and implementation a software package which incorporates these into the computer algebra system Maple are described in detail.

Studying and developing systems that can recognize, express, "have" emotions is called <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">affective computing</i> . To create a Computational Model of Emotion (CME), one must first identify what kind system to build, then find emotion theories match its requirements. The relevant literature vast. This survey aims help design CMEs xmlns:xlink="http://www.w3.org/1999/xlink">generate emotions</i>...