By Topic

Computer Languages, 1990., International Conference on

Date 12-15 March 1990

Filter Results

Displaying Results 1 - 25 of 33
  • 1990 International Conference on Computer Languages (Cat. No.90CH2854-8)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (28 KB)
    Freely Available from IEEE
  • Implementation and evaluation of dynamic predicates on the sequential inference machine CHI

    Publication Year: 1990, Page(s):236 - 244
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (468 KB)

    The dynamic clause compilation technique which is used to implement Prolog's dynamic predicates is described. The effectiveness of the technique when applied to a practical application program executed on the sequential inference machine CHI is reported. Dynamic predicates are indispensable in writing practical Prolog application programs. According to the authors' application program analysis, ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GVL: a graphical, functional language for the specification of output in programming languages

    Publication Year: 1990, Page(s):11 - 22
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    The conceptual view model of output is based on the complete separation of the output specification of a program from the program itself, and the use of implicit synchronization to allow the data state of the program to be continuously mapped to a display view. An output specification language called GVL is used to specify the mapping from the program's data state to the display. GVL is a function... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable distributed computing with Avalon/Common Lisp

    Publication Year: 1990, Page(s):169 - 179
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    An overview of these novel aspects of Avalon/Common Lisp is presented: (1) support for remote evaluation through a new evaluator data type; (2) a generalization of the traditional client/server model of computation, allowing clients to extend server interfaces and server writers to hide aspects of distribution, such as caching, from clients; (3) support for failure atomicity through automatic comm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object model for shared data

    Publication Year: 1990, Page(s):136 - 144
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The classical object model supports private data within objects and clean interfaces among objects, and, by definition, does not permit sharing of data among arbitrary objects. This is a problem for certain real-world applications, where the same data logically belongs to multiple objects and may be distributed over multiple nodes on the network. Rather than give up the advantages of encapsulated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KSL/Logic: integration of logic with objects

    Publication Year: 1990, Page(s):228 - 235
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (572 KB)

    KSL/Logic is an integration of logic and object-oriented programming that adds the declarative framework and deductive reasoning of logic programming to the powerful modeling capabilities of the object-oriented paradigm. Predicates, logic expressions, and the generalized search protocol of KSL/Logic are implemented as an integral part of KSL, a reflective, object-oriented programming language. KSL... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EZ processes

    Publication Year: 1990, Page(s):90 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    EZ is a system that integrates the facilities provided separately by traditional programming languages and operating systems. This integration is accomplished by casting services provided by traditional operating services as EZ language features. EZ is a high-level string processing language with a persistent memory. Traditional file and directory services are provided by EZ's strings and associat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compiling SIMD programs for MIMD architectures

    Publication Year: 1990, Page(s):291 - 296
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    A summary of the advantages of data parallel languages a subclass of SIMD (single-instruction-stream, multiple-data-stream languages) is presented, and it is shown how programs written in a data parallel language can be compiled into loosely-synchronous MIMD (multiple-instruction-stream, multiple-data-stream) programs suitable for efficient execution on multicomputers. It is shown that the compile... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A practical animation language for software development

    Publication Year: 1990, Page(s):1 - 10
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    A practical language for creating real-time, two-dimensional, smooth, color animations is described. Animation can be a valuable component in a variety of domains, such as user interface design, on-line help information, and computer-aided instruction. The animation language produces aesthetically pleasing, smooth imagery, and is easy to learn and use. The language is based on four abstract data t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coordination languages for open system design

    Publication Year: 1990, Page(s):252 - 260
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (668 KB)

    Three coordination languages, Linda, Flat Concurrent Prolog, and DeltaProlog, are discussed with respect to their features for open system design. It is interesting to compare the Linda coordination model with the model of logic languages, because both involve forms of communication based on pattern matching. Although they seem to be equivalent with respect to their expressive power, current imple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel graph-reduction with a shared memory multiprocessor system

    Publication Year: 1990, Page(s):33 - 38
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A tightly coupled multiprocessor system where each processor has direct access to a shared memory is studied. The system used for the experiments has only eight processors, but it supports the concurrent fetch and add operation, which is used extensively in the graph-reducer. A parallel graph-reduction technique is developed for such a system, and the measurement of its performance is made via som... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict propagation

    Publication Year: 1990, Page(s):155 - 168
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    A study is made of the requirements for abstraction constructs encapsulating multiparty interactions. Several alternatives are explored for the meaning of an abstraction invocation when used in the position of a guard. It is concluded that in order to support a stepwise-refinement design methodology, conflicts must be propagated across invocations to achieve a proper coordination at the abstractio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GARTL: a real-time programming language based on multi-version computation

    Publication Year: 1990, Page(s):107 - 115
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The increasing importance of real-time computing systems is widely known and such systems are presently the subject of much research. A particularly attractive approach to the programming of hard real-time systems is the identification of multiple versions of the task to be carried out. If this is done, then the system scheduler used by a real-time system can select the version that gives the most... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-dimensional organization and browsing of object-oriented systems

    Publication Year: 1990, Page(s):128 - 135
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    A two-dimensional organization for object-oriented systems and a browser supporting that organization are described. The organization provides sites for documenting both generic functions and object types, allows convenient browsing and information hiding according to both function and type, and supports the notion of abstract types. Also described is the extension of the organization and browser ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lazy evaluation in logic programming

    Publication Year: 1990, Page(s):218 - 227
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    A method for bringing the concept of lazy evaluation to logic programming in a rigorous yet efficient manner is presented. Its main advantage over previous methods is its considerable efficiency, from both the theoretical and implementation points of view. It is based on making the SLD-resolution rule of inference directly simulate the behavior of a lazy rewriting interpreter satisfying strong com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience with distributed programming in Orca

    Publication Year: 1990, Page(s):79 - 89
    Cited by:  Papers (12)  |  Patents (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    Orca is a language for programming parallel applications on distributed computing systems. Although processors in such systems communicate only through message passing and not through shared memory, Orca provides a communication model based on logically shared data. The language and its implementation are briefly described and a report is given on experiences in using Orca for three parallel appli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LEGEND: a language for generic component library description

    Publication Year: 1990, Page(s):198 - 207
    Cited by:  Papers (2)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (664 KB)

    LEGEND is a novel generator-generator language for the definition, generation, and maintenance of generic component libraries used in high-level hardware synthesis. Each LEGEND description generates a library generator GENUS, which is organized as a hierarchy of generic component generators, templates, and instances. High-level synthesis systems typically transform the abstract behavior of a desig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental global optimization for faster recompilations

    Publication Year: 1990, Page(s):281 - 290
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    Although modular programming with separate compilation aids in eliminating unnecessary recompilation and reoptimization, recent studies have discovered that more efficient code can be generated by collapsing a modular program through procedure inlining. To avoid having to reoptimize the resultant large procedures, techniques for incrementally incorporating changes into globally optimized code are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A language for distributed applications

    Publication Year: 1990, Page(s):59 - 68
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Durra is a language designed to support the development of distributed applications consisting of multiple, concurrent, large-grained tasks executing in a heterogeneous network. An application-level program is written in Durra as a set of task descriptions that prescribes a way to manage the resources of a heterogeneous machine network. The application describes the tasks to be instantiated and ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Tahiti programming language: events as first-class objects

    Publication Year: 1990, Page(s):245 - 251
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    No programming language embodies a fully abstract and consistent facility for representing and managing computational events. Tahiti is an experimental CSP-based language that augments the standard primitive data types with the type Event, which enables data objects to be bound to occurrences in the execution of the program itself. A description is presented of Tahiti's constructs for representing... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhancing documents with embedded programs: how Ness extends insets in the Andrew ToolKit

    Publication Year: 1990, Page(s):23 - 32
    Cited by:  Papers (1)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    The problems of embedding programs in documents are sketched and the solutions adopted in the Ness component of the Andrew ToolKit are reviewed. A key question is the connection from user actions to program functions. Other questions include the appropriate level of programming language, its string-processing capabilities, and security View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using languages for capture, analysis and display of performance information for parallel and distributed applications

    Publication Year: 1990, Page(s):180 - 189
    Cited by:  Papers (7)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    A graphical performance display tool can offer insights into the nature of a program's performance that would be difficult, and sometimes impossible, to achieve with a traditional textual view of performance activity. Two languages with which programmers can specify the collection and display of performance information about parallel and distributed application programs are discussed. It is demons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and automatic prototype implementation of polymorphic objects in Turing using the TXL dialect processor

    Publication Year: 1990, Page(s):145 - 154
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    Object-oriented dialects of existing programming languages are often implemented using a preprocessor that translates from the dialect to an equivalent program in the original programming language. Unfortunately, the nature of the preprocessing done by these implementations is hidden in the ad hoc algorithms of the preprocessors themselves, except as demonstrated by examples. An attempt to catalog... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-oriented exception handling in Ada

    Publication Year: 1990, Page(s):98 - 106
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A set of language features that can be added to Ada that associate exceptions with the operations of a data type and exception handlers with data objects are presented. The notation is called data-oriented exception exception handling to distinguish it from more conventional, control-oriented mechanisms. The implementation of a preprocessor from the notation to Ada is described. Empirical studies ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computation of interprocedural definition and use dependencies

    Publication Year: 1990, Page(s):297 - 306
    Cited by:  Papers (11)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    The detection of various dependencies that exist among the definitions and uses of variables in a program is necessary in many language-processing tools. The computation of definition-use dependencies that reach across procedure boundaries is considered. In particular, efficient techniques for computing interprocedural definition-use and use-definition chains and for incrementally updating the cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.