𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Are applicative languages inefficient?

✍ Scribed by Ponder, Carl G.; McGeer, Patrick; Ng, Anthony P-C.


Book ID
118248837
Publisher
Association for Computing Machinery
Year
1988
Weight
357 KB
Volume
23
Category
Article
ISSN
0362-1340

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Are languages digital codes?
✍ Nigel Love πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 708 KB
Shuffle languages are in P
✍ Joanna JΘ©drzejowicz; Andrzej Szepietowski πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 226 KB

In this paper we show that shu e languages are contained in one-way-NSPACE(log n) thus in P. We consider the class of shu e languages which emerges from the class of ΓΏnite languages through regular operations (union, concatenation, Kleene star) and shu e operations (shu e and shu e closure). For eve

Truth in Applicative Theories
✍ Reinhard Kahle πŸ“‚ Article πŸ“… 2001 πŸ› Springer Netherlands 🌐 English βš– 258 KB