10 search results - page 2 / 2 » Revised5 Report on the Algorithmic Language Scheme |
CL
1999
Springer
13 years 7 months ago
1999
Springer
It is well known that dynamic typing in languages like Lisp is costly in terms of performance. Besides the cost of tag checking, the other major source of ine ciency comes from th...
TNN
1998
13 years 7 months ago
1998
—Recurrent neural networks processing symbolic strings can be regarded as adaptive neural parsers. Given a set of positive and negative examples, picked up from a given language,...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
An interprocedural flow analysis can justify inlining in higher-order languages. In principle, more inlining can be performed as analysis accuracy improves. This paper compares fo...
LFP
1992
13 years 9 months ago
1992
Tag handling accounts for a substantial amount of execution cost in latently typed languages such as Common LISP and Scheme, especially on architectures that provide no special ha...