10435 search results - page 41 / 2087 » Measuring system normality |
LOPSTR
1994
Springer
14 years 25 days ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
AIED
2005
Springer
14 years 2 months ago
2005
Springer
: Several studies have shown that explaining actions increases students’ knowledge. In this paper, we discuss how NORMIT supports self-explanation. NORMIT is a constraint-based t...
ICASSP
2011
IEEE
13 years 14 days ago
2011
IEEE
This paper describes a text normalization system for deletion-based abbreviations in informal text. We propose using statistical classifiers to learn the probability of deleting ...
CC
2003
Springer
14 years 2 months ago
2003
Springer
We present a translation from the call-by-value λ-calculus to monadic normal forms that includes short-cut boolean evaluation. The translation is higher-order, operates in one pas...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents simple, syntactic strong normalization proofs for the simply-typed -calculus and the polymorphic -calculus (system F) with the full set of logical connectives, ...