LEDA : a blending of imperative and relational programming

This paper describes features of a new strongly typed, compiled programming language, called LEDA. LEDA attempts to combine aspects of both imperative (value-oriented) and logical (relation-oriented) styles of programming. Logical behavior is introduced by means of a new programming structure, called a relation. Relations have similarities to functions and procedures, but are distinct from both. Several examples are presented illustrating how the combination of features from the two paradigms are mutually beneficial. Finally a short overview of the implementation is given

PySBQL – Python-like query language constructed using stack base approach

PySBQL (Python-like Stack Based Query Language) is a full scale programming and querylanguage. Its syntax is based upon the Python’s syntax, which makes PySBQL highly readable andeasy to use. Contrary to the classical approach in query languages, semantics is defined using acommon structure for programming languages – the Environment Stack (ENVS). As a querylanguage it is similar to SBQL proposed by Subieta [1,2]. The PySBQL language is implementedin Monad – Object Oriented Database Management System

Hybrid forms of entertainment in the media

The media environment is an extremely variable universe where every now and again we can observe the emergence of new phenomena. Many of those form through blending of often rather different and distant areas. As a result, there emerge hybrid forms, which are not entirely established or completely defined. This article is focussed on those kinds of mixed types based on media entertainment, e.g. infotainment, edutainment, politainment, politicotainment, docutainment etc., which can be observed in the means of mass communication. The goal of the study was to define their essence, their distinctive features, and to indicate the place of those hybrid forms within the media discourses being carried on today

Computer Aided Verification of Relational Models

Binary relational algebra provides semantic foundations for major areas of computing, such as database design, state-based modeling and functional programming. Remarkably, static checking support in these areas fails to exploit the full semantic content of relations. In particular, properties such as the simplicity or injectivity of relations are not statically enforced in operations such as database queries, state transitions, or composition of functional components. When data models, their constraints and operations are represented by point-free binary relational expressions, proof obligations can be expressed as inclusions between relational expressions.We developed a type-directed, strategic term rewriting system that can be used to simplify relational proof obligations and ultimately reduce them to tautologies. Such reductions can be used to provide extended static checking for design contraints commonly found in software modeling and development.XIII Workshop Ingeniería de Software (WIS).Red de Universidades con Carreras en Informática (RedUNCI

Lazy Stream Manipulation in Prolog via Backtracking: The Case of 2P-Kt

The ability to lazily manipulate long or infinite streams of data is an essential feature in the era of data-driven artificial intelligence. Yet, logic programming technologies currently fall short when it comes to handling long or infinite streams of data. In this paper, we discuss how Prolog can be reinterpreted as a stream processing tool, and re-designed around an abstract state-machine capable of lazily manipulating streams of data via backtracking

Implementing logic in Leda

Leda is a newly evolving, strongly typed, compiled multi-paradigm programming language. This paper describes the integration of one of its supported paradigms, the logical (or relational) paradigm, into the language and the current implementation. It also describes implementational aspects of enumerated types and gives a variety of example programs that demonstrate the usefulness of the achieved blending between the logical and other existing programming paradigms in Leda

Vertical Social Cohesion: Linking Concept to Practice

This article addresses gaps in linking the conceptualization and practice of vertical social cohesion. Through a review of literature, examination of field-based case studies and focused discussions with academics, the article crystalizes the understanding of vertical social cohesion—often restricted to state-society relations—and offers four mutually reinforcing strands of the vertical dimension that are cognizant of the hybridity of state, non-state, formal and informal institutions that exist in most societies. Through a deeper reflection on practice, the article discusses two considerations for strengthening the practice of vertical social cohesion that should start with intentional consideration of the vertical dimension of social cohesion during the intervention design: leveraging governance programming based on its complementarities with social cohesion; and careful blending of interventions that promote horizontal and vertical social cohesion. It argues that, while the focus of community-level social cohesion interventions is often biased towards strengthening horizontal social relations, both the vertical and horizontal dimensions are important in shaping the nature and strength of a society’s cohesiveness. The article contends that social cohesiveness is determined by how vertical and horizontal social cohesion interact and proposes a tool—Social Cohesion’s Four-Quadrants Model—to harmonize and weigh programming choices in order to influence broader, sustainable societal change

General-purpose multiparadigm programming languages : an enabling technology for constructing complex systems

Multiparadigm programming languages have been envisioned as a vehicle for constructing large and complex heterogeneous systems, such as a stock market exchange or a telecommunications network. General-purpose multiparadigm languages, as opposed to hybrid multiparadigm languages, embody several prevalent programming paradigms without being motivated by a single problem. One such language is Leda, which embodies the foundational paradigms of imperative, functional, logic, and object-oriented programming. We explore aspects of solving complex problems using Leda, in order to illustrate the benefits of using a multiparadigm language in expressing solutions to complex systems. We claim that general-purpose multiparadigm programming languages like Leda greatly expedite solutions to a variety of complex problems