d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
Gian Luca Foresti, Vittorio Murino, Carlo S. Regaz...
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Abstract--This paper presents a technique to transform high-effort voices into breathy voices using adaptive pre-emphasis linear prediction (APLP). The primary benefit of this tech...
K. I. Nordstrom, George Tzanetakis, Peter F. Dries...