Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
Designing debugging tools for lazy functional programming languages is a complex task which is often solved by expensive tracing of lazy computations. We present a new approach in...
In spoken language processing, considerable research has been accomplished on language identi cation. Singing language identi cation is an important yet challenging area that has ...
1 This study evaluates the robustness of established computational indices used to assess text relatedness in userlanguage. The original User-Language Paraphrase Corpus (ULPC) was ...
Adam M. Renner, Philip M. McCarthy, Danielle S. Mc...
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...