๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new implementation of the Icon language

โœ Scribed by Todd A. Proebsting; Gregg M. Townsend


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
273 KB
Volume
30
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

โœฆ Synopsis


Jcon is a new, full-featured, Java-based implementation of the Icon programming language. The compiler, written in Icon, generates an intermediate representation that is optimized and then used to produce classfiles of Java bytecode. A four-chunk control-flow model handles goal-directed evaluation and produces constructs not expressible as Java code. The runtime system, written in Java, finds object-oriented programming a great advantage in implementing a dynamically typed language, with method calls replacing many conditional tests. An all-encompassing descriptor class supports values, references, and suspended operations. The procedure call interface is simple and incurs overhead for generator support only when actually needed. Performance is somewhat disappointing, and some limitations are annoying, but in general Java provides a good implementation platform.


๐Ÿ“œ SIMILAR VOLUMES


A user-adapted iconic language for the m
โœ B. De Carolis; F. De Rosis; S. Errore ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 573 KB

Although icons are presented as a universal language, some claim that cultural background, education and environment might influence the users' interpretation of their meaning. If this is true, the iconic language should be adapted to the user's characteristics. This paper presents results of a stud

On the implementation of the Opus coordi
โœ Laure, Erwin; Haines, Matthew; Mehrotra, Piyush; Zima, Hans ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB ๐Ÿ‘ 1 views

Opus is a new programming language designed to assist in coordinating the execution of multiple, independent program modules. With the help of Opus, coarse grained task parallelism between data parallel modules can be expressed in a clean and structured way. In this paper we address the problems of

Towards a complete framework for paralle
โœ Succi, Giancarlo; Uhrik, Carl ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 784 KB

Although logic languages, due to their nnn-declarative nature, are widely proclaimed to be conducive in theory to parallel implementation, in fact there appears to be insufficient practical evidence to stimulate further developments in this field. The paper puts forward various complications which a

Design and Implementation of the L+C Mod
โœ Radoslaw Karwowski; Przemyslaw Prusinkiewicz ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 327 KB

L-systems are parallel grammars that provide a theoretical foundation for a class of programs used in the simulation of plant development and procedural image synthesis. In particular, the formalism of L-systems guides the construction of declarative languages for specifying input to these programs.