Corrado Moiso

Kernel-LEAF: a logic plus functional language

Abstract Kernel-LEAF is a logic plus functional language based on the flattening technique. It differs from other similar languages because it is able to cope with partial (undefined or non-terminating) functions. This is achieved by introducing the distinction between data structures and (functional) term structures, and by using two kinds of equality. The language has a clean model-theoretic semantics, where the domains of the interpretations are the algebraic CPOs. In these domains the difference between the two equalities corresponds to a different behaviour with respect to continuity. The operational semantics (based on SLD-resolution) is proved sound and complete with respect to the model-theoretic one. Finally, an outermost strategy, more efficient than unrestricted SLD-resolution, but still complete, is presented.

Notes on the elimination of conditions

In these notes we have described a method for eliminating equality tests from conditions in ctrs. Two applications have been shown: the first is the transformation of a conditional trs into an equivalent unconditional one; the second is the extension of the user syntax of K-LEAF, a logic+functional programming language.

ACE: an environment for specifying, developing and generating TINA services

The objective of the paper is to present an innovative environment (Application Construction Environment — ACE) for the specification, development and generation of Telecommunication services according to emerging standards such as TINA and CORBA. We will briefly describe the service specifications and development lifecycle requirements for distributed object applications in the telecom domain and how ACE functionalities address them.

A TINA-like computational model and its implementation within an object-oriented distributed transactional platform

The paper describes ODIN (Object Distributed INterfaces), a prototype implementation of MODA (a Model for an Object Distributed Architecture), which is the CSELT model aligned with ISO/ODP Reference Model. The work presents a prototype implementation based on OSF/DCE and extends the results of a previous activity by implementing an extended transaction model.<<ETX>>

Comments on “logic programming with equations”

Abstract This note discusses the results of the compilational approach of equational logic programming developed by Van Emden and Yukawa, and compares them with similar results obtained by Bosco et al. and by Fribourg. We show that Van Emden and Yukawas completeness result contains an inaccuracy, and we suggest how to correct it.

TINA ACE: an environment for specifying, developing and generating TINA services

The objective of the paper is to present an innovative environment (Application Construction Environment ACE) for the specification, development and generation of Telecommunication services according to emerging standards such as TINA and CORBA. We will briefly describe the service specifications and development lifecycle requirements for distributed object applications in the telecom domain and how ACE functionalities address them.

Integration of rules and linear program models in network traffic management

The problem discussed is that of traffic management in a telephone network, when serious congestion states occur caused by external factors. In these situations, the network, planned for normal busy-period loads, is unable to carry offered traffic due to either abnormal traffic patterns or network element failure, and the service performance degrades. The authors describe an approach based on the integration of symbolic rules and linear program models, based on the constraint logic programming (CLP) paradigm, to overcome the problems. By using this approach, they have developed an experimental decision support system to assist the network supervisors in the selection of a temporary alternative routing to improve the network performance during serious congestion states. The support system has a user interface to interact with the supervisor. The supervisors can require different solutions computed according to different sets of parameters, compare them, and then select the one that they prefer.<<ETX>>

Implementation of a Parallel Logic + Functional Language

This chapter presents the main features of the integrated logic plus functional languages IDEAL and K-LEAF along with their implementation on sequential and parallel architectures.