VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

EGHEP-ISFG collaborative exercise on mixture profiles of autosomal STRs (GHEP-MIX01, GHEP-MIX02 and GHEP-MIX03): Results and evaluation

One of the main objectives of the Spanish and Portuguese-Speaking Group of the International Society for Forensic Genetics (GHEP-ISFG) is to promote and contribute to the development and dissemination of scientific knowledge in the area of forensic genetics. Due to this fact, GHEP-ISFG holds different working commissions that are set up to develop activities in scientific aspects of general interest. One of them, the Mixture Commission of GHEP-ISFG, has organized annually, since 2009, a collaborative exercise on analysis and interpretation of autosomal short tandem repeat (STR) mixture profiles. Until now, three exercises have been organized (GHEP-MIX01, GHEP-MIX02 and GHEP-MIX03), with 32, 24 and 17 participant laboratories respectively. The exercise aims to give a general vision by addressing, through the proposal of mock cases, aspects related to the edition of mixture profiles and the statistical treatment. The main conclusions obtained from these exercises may be summarized as follows. Firstly, the data show an increased tendency of the laboratories toward validation of DNA mixture profiles analysis following international recommendations (ISO/IEC 17025: 2005). Secondly, the majority of discrepancies are mainly encountered in stutters positions (53.4%, 96.0% and 74.9%, respectively for the three editions). On the other hand, the results submitted reveal the importance of performing duplicate analysis by using different kits in order to reduce errors as much as possible. Regarding the statistical aspect (GHEP-MIX02 and 03), all participants employed the likelihood ratio (LR) parameter to evaluate the statistical compatibility and the formulas employed were quite similar. When the hypotheses to evaluate the LR value were locked by the coordinators (GHEP-MIX02) the results revealed a minor number of discrepancies that were mainly due to clerical reasons. However, the GHEP-MIX03 exercise allowed the participants to freely come up with their own hypotheses to calculate the LR value. In this situation the laboratories reported several options to explain the mock cases proposed and therefore significant differences between the final LR values were obtained. Complete information concerning the background of the criminal case is a critical aspect in order to select the adequate hypotheses to calculate the LR value. Although this should be a task for the judicial court to decide, it is important for the expert to account for the different possibilities and scenarios, and also offer this expertise to the judge. In addition, continuing education in the analysis and interpretation of mixture DNA profiles may also be a priority for the vast majority of forensic laboratories. (C) 2014 Elsevier Ireland Ltd. All rights reserved.

The effect of a Lucia jig for 30 minutes on neuromuscular re-programming, in normal subjects

The Lucia jig is a technique that promotes neuromuscular reprogramming of the masticatory system and allows the stabilization of the mandible without the interference of dental contacts, maintaining the mandible position in harmonic condition with the musculature in normal subjects or in patients with temporomandibular dysfunction (TMD). This study aimed to electromyographically analyze the activity (RMS) of the masseter and temporal muscles in normal subjects (control group) during the use of an anterior programming device, the Lucia jig, in place for 0, 5, 10, 20 and 30 minutes to demonstrate its effect on the stomatognathic system. Forty-two healthy dentate individuals (aged 21 to 40 years) with normal occlusion and without parafunctional habits or ternporomandibular dysfunction (RDC/TMD) were evaluated on the basis of the electromyographic activity of the masseter and temporal muscles before placement of a neuromuscular re-programming device, the Lucia jig, on the upper central incisors. There were no statistically significant differences (p < 0.05) in the electromyographic activity of the masticatory muscles in the different time periods. The Lucia jig changed the electromyographic activity by promoting a neuromuscular reprogramming. In most of the time periods, it decreased the activation of the masticatory muscles, showing that this device has wide applicability in dentistry. The use of a Lucia jig over 0, 5, 10, 15, 20 and 30 minutes did not promote any statistically significant increase in muscle activity despite differences in the data, thus showing that this intra-oral device can be used in dentistry.

A Virtual Programming Lab for Moodle with automatic assessment and anti-plagiarism features

[EN] This paper describes VPL, a Virtual Programming Lab module for Moodle, developed at the University of Las Palmas of Gran Canaria (ULPGC) and released for free uses under GNU/GPL license. For the students, it is a simple development environment with auto evaluation capabilities. For the instructors, it is a students' work management system, with features to facilitate the preparation of assignments, manage the submissions, check for plagiarism, and do assessments with the aid of powerful and flexible assessment tools based on program testing, all of that being independent of the programming language used for the assignments and taken into account critical security issues.

Hybrid constraint programming and metaheuristic methods for large scale optimization problems

This work presents hybrid Constraint Programming (CP) and metaheuristic methods for the solution of Large Scale Optimization Problems; it aims at integrating concepts and mechanisms from the metaheuristic methods to a CP-based tree search environment in order to exploit the advantages of both approaches. The modeling and solution of large scale combinatorial optimization problem is a topic which has arisen the interest of many researcherers in the Operations Research field; combinatorial optimization problems are widely spread in everyday life and the need of solving difficult problems is more and more urgent. Metaheuristic techniques have been developed in the last decades to effectively handle the approximate solution of combinatorial optimization problems; we will examine metaheuristics in detail, focusing on the common aspects of different techniques. Each metaheuristic approach possesses its own peculiarities in designing and guiding the solution process; our work aims at recognizing components which can be extracted from metaheuristic methods and re-used in different contexts. In particular we focus on the possibility of porting metaheuristic elements to constraint programming based environments, as constraint programming is able to deal with feasibility issues of optimization problems in a very effective manner. Moreover, CP offers a general paradigm which allows to easily model any type of problem and solve it with a problem-independent framework, differently from local search and metaheuristic methods which are highly problem specific. In this work we describe the implementation of the Local Branching framework, originally developed for Mixed Integer Programming, in a CP-based environment. Constraint programming specific features are used to ease the search process, still mantaining an absolute generality of the approach. We also propose a search strategy called Sliced Neighborhood Search, SNS, that iteratively explores slices of large neighborhoods of an incumbent solution by performing CP-based tree search and encloses concepts from metaheuristic techniques. SNS can be used as a stand alone search strategy, but it can alternatively be embedded in existing strategies as intensification and diversification mechanism. In particular we show its integration within the CP-based local branching. We provide an extensive experimental evaluation of the proposed approaches on instances of the Asymmetric Traveling Salesman Problem and of the Asymmetric Traveling Salesman Problem with Time Windows. The proposed approaches achieve good results on practical size problem, thus demonstrating the benefit of integrating metaheuristic concepts in CP-based frameworks.

Definition, realization and evaluation of a software reference architecture for use in space applications

A recent initiative of the European Space Agency (ESA) aims at the definition and adoption of a software reference architecture for use in on-board software of future space missions. Our PhD project placed in the context of that effort. At the outset of our work we gathered all the industrial needs relevant to ESA and all the main European space stakeholders and we were able to consolidate a set of technical high-level requirements for the fulfillment of them. The conclusion we reached from that phase confirmed that the adoption of a software reference architecture was indeed the best solution for the fulfillment of the high-level requirements. The software reference architecture we set on building rests on four constituents: (i) a component model, to design the software as a composition of individually verifiable and reusable software units; (ii) a computational model, to ensure that the architectural description of the software is statically analyzable; (iii) a programming model, to ensure that the implementation of the design entities conforms with the semantics, the assumptions and the constraints of the computational model; (iv) a conforming execution platform, to actively preserve at run time the properties asserted by static analysis. The nature, feasibility and fitness of constituents (ii), (iii) and (iv), were already proved by the author in an international project that preceded the commencement of the PhD work. The core of the PhD project was therefore centered on the design and prototype implementation of constituent (i), a component model. Our proposed component model is centered on: (i) rigorous separation of concerns, achieved with the support for design views and by careful allocation of concerns to the dedicated software entities; (ii) the support for specification and model-based analysis of extra-functional properties; (iii) the inclusion space-specific concerns.

Portfolio Approaches in Constraint Programming

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of —possibly on-average slower— algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance. In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively studied for Boolean Satisfiability (SAT) problems, in the more general CP field these techniques have been only marginally studied and used. We conducted this work through the investigation, the analysis and the construction of several portfolio approaches for solving both satisfaction and optimization problems. We focused in particular on sequential approaches, i.e., single-threaded portfolio solvers always running on the same core. We started from a first empirical evaluation on portfolio approaches for solving Constraint Satisfaction Problems (CSPs), and then we improved on it by introducing new data, solvers, features, algorithms, and tools. Afterwards, we addressed the more general Constraint Optimization Problems (COPs) by implementing and testing a number of models for dealing with COP portfolio solvers. Finally, we have come full circle by developing sunny-cp: a sequential CP portfolio solver that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.

Essays in policy evaluation

This dissertation consists of three empirical studies that aim at providing new evidence in the field of public policy evaluation. In particular, the first two chapters focus on the effects of the European cohesion policy, while the third chapter assesses the effectiveness of Italian labour market incentives in reducing long-term unemployment. The first study analyses the effect of EU funds on life satisfaction across European regions , under the assumption that projects financed by structural funds in the fields of employment, education, health and environment may affect the overall quality of life in recipient regions. Using regional data from the European Social Survey in 2002-2006, it resorts to a regression discontinuity design, where the discontinuity is provided by the institutional framework of the policy. The second study aims at estimating the impact of large transfers from a centralized authority to a local administration on the incidence of white collar crimes. It merges a unique dataset on crimes committed in Italian municipalities between 2007 and 2011 with information on the disbursement of EU structural funds in 2007-2013 programming period, employing an instrumental variable estimation strategy that exploits the variation in the electoral cycle at local level. The third study analyses the impact of an Italian labour market policy that allowed firms to cut their labour costs on open-ended job contracts when hiring long-term unemployed workers. It takes advantage of a unique dataset that draws information from the unemployment lists in Veneto region and it resorts to a regression discontinuity approach to estimate the effect of the policy on the job finding rate of long-term unemployed workers.

Sensor-based evaluation of Circadian motor behavior in people with Dementia. Development and validation of analysis strategies

[ITA]La demenza consiste nel deterioramento, spesso progressivo, dello stato cognitivo di un individuo. Chi è affetto da demenza, presenta alterazioni a livello cognitivo, comportamentale e motorio, ad esempio compiendo gesti ossessivi, ripetitivi, senza uno scopo preciso. La condizione dei pazienti affetti da demenza è valutata clinicamente tramite apposite scale e le informazioni relative al comportamento vengono raccolte intervistando chi se ne occupa, come familiari, il personale infermieristico o il medico curante. Spesso queste valutazioni si rivelano inaccurate, possono essere fortemente influenzate da considerazioni soggettive, e sono dispendiose in termini di tempo. Si ha quindi l'esigenza di disporre di metodiche oggettive per valutare il comportamento motorio dei pazienti e le sue alterazioni patologiche; i sensori inerziali indossabili potrebbero costituire una valida soluzione, per questo scopo. L'obiettivo principale della presente attività di tesi è stato definire e implementare un software per una valutazione oggettiva, basata su sensori, del pattern motorio circadiano, in pazienti affetti da demenza ricoverati in un'unità di terapia a lungo termine, che potrebbe evidenziare differenze nei sintomi della malattia che interessano il comportamento motorio, come descritto in ambito clinico. Lo scopo secondario è stato quello di verificare i cambiamenti motori pre- e post-intervento in un sottogruppo di pazienti, a seguito della somministrazione di un programma sperimentale di intervento basato su esercizi fisici. --------------- [ENG]Dementia involves deterioration, often progressive, of a person's cognitive status. Those who suffer from dementia, present alterations in cognitive and motor behavior, for example performing obsessive and repetitive gestures, without a purpose. The condition of patients suffering from dementia is clinically assessed by means of specific scales and information relating to the behavior are collected by interviewing caregivers, such as the family, nurses, or the doctor. Often it turns out that these are inaccurate assessments that may be heavily influenced by subjective evaluations and are costly in terms of time. Therefore, there is the need for objective methods to assess the patients' motor behavior and the pathological changes; wearable inertial sensors may represent a viable option, so this aim. The main objective of this thesis project was to define and implement a software for a sensor-based assessment of the circadian motor pattern in patients suffering from dementia, hospitalized in a long-term care unit, which could highlight differences in the disease symptoms affecting the motor behavior, as described in the clinical setting. The secondary objective was to verify pre- and post-intervention changes in the motor patterns of a subgroup of patients, following the administration of an experimental program of intervention based on physical exercises.

ProFormA: An XML-based exchange format for programming tasks

Unterstützungssysteme für die Programmierausbildung sind weit verbreitet, doch gängige Standards für den Austausch von allgemeinen (Lern-) Inhalten und Tests erfüllen nicht die speziellen Anforderungen von Programmieraufgaben wie z. B. den Umgang mit komplexen Einreichungen aus mehreren Dateien oder die Kombination verschiedener (automatischer) Bewertungsverfahren. Dadurch können Aufgaben nicht zwischen Systemen ausgetauscht werden, was aufgrund des hohen Aufwands für die Entwicklung guter Aufgaben jedoch wünschenswert wäre. In diesem Beitrag wird ein erweiterbares XML-basiertes Format zum Austausch von Programmieraufgaben vorgestellt, das bereits von mehreren Systemen prototypisch genutzt wird. Die Spezifikation des Austauschformats ist online verfügbar [PFMA].

Development and Evaluation of a New Tablet Computer Application for the Therapy of Brain-Injured Patients with Aphasia

Introduction Language is the most important mean of communication and plays a central role in our everyday life. Brain damage (e.g. stroke) can lead to acquired disorders of lan- guage affecting the four linguistic modalities (i.e. reading, writing, speech production and comprehension) in different combinations and levels of severity. Every year, more than 5000 people (Aphasie Suisse) are affected by aphasia in Switzerland alone. Since aphasia is highly individual, the level of difficulty and the content of tasks have to be adapted continuously by the speech therapists. Computer-based assignments allow patients to train independently at home and thus increasing the frequency of ther- apy. Recent developments in tablet computers have opened new opportunities to use these devices for rehabilitation purposes. Especially older people, who have no prior experience with computers, can benefit from the new technologies. Methods The aim of this project was to develop an application that enables patients to train language related tasks autonomously and, on the other hand, allows speech therapists to assign exercises to the patients and to track their results online. Seven categories with various types of assignments were implemented. The application has two parts which are separated by a user management system into a patient interface and a therapist interface. Both interfaces were evaluated using the SUS (Subject Usability Scale). The patient interface was tested by 15 healthy controls and 5 patients. For the patients, we also collected tracking data for further analysis. The therapist interface was evaluated by 5 speech therapists. Results The SUS score are xpatients = 98 and xhealthy = 92.7 (median = 95, SD = 7, 95% CI [88.8, 96.6]) in case of the patient interface and xtherapists = 68 in case of the therapist interface. Conclusion Both, the patients and the healthy subjects, attested high SUS scores to the patient interface. These scores are considered as "best imaginable". The therapist interface got a lower SUS score compared to the patient interface, but is still considered as "good" and "usable". The user tracking system and the interviews revealed that there is room for improvements and inspired new ideas for future versions.

Use of tabletop exercises for disaster preparedness training

Background. In public health preparedness, disaster preparedness refers to the strategic planning of responses to all types of disasters. Preparation and training for disaster response can be conducted using different teaching modalities, ranging from discussion-based programs such as seminars, drills and tabletop exercises to more complex operation-based programs such as functional exercises and full-scale exercises. Each method of instruction has its advantages and disadvantages. Tabletop exercises are facilitated discussions designed to evaluate programs, policies, and procedures; they are usually conducted in a classroom, often with tabletop props (e.g. models, maps or diagrams). ^ Objective. The overall goal of this project was to determine whether tabletop exercises are effective teaching modalities for disaster preparedness, with an emphasis on intentional chemical exposure. ^ Method. The target audience for the exercise was the Medical Reserve Brigade of the Texas State Guard, a group of volunteer healthcare providers and first responders who prepare for response to local disasters. A new tabletop exercise was designed to provide information on the complex, interrelated organizations within the national disaster preparedness program that this group would interact with in the event of a local disaster. This educational intervention consisted of a four hour multipart program that included a pretest of knowledge, lecture series, an interactive group discussion using a mock disaster scenario, a posttest of knowledge, and a course evaluation. ^ Results. Approximately 40 volunteers attended the intervention session; roughly half (n=21) had previously participated in a full scale drill. There was an 11% improvement in fund of knowledge between the pre- and post-test scores (p=0.002). Overall, the tabletop exercise was well received by those with and without prior training, with no significant differences found between these two groups in terms of relevance and appropriateness of content. However, the separate components of the tabletop exercise were variably effective, as gauged by written text comments on the questionnaire. ^ Conclusions. Tabletop exercises can be a useful training modality in disaster preparedness, as evidenced by improvement in knowledge and qualitative feedback on its value. Future offerings could incorporate recordings of participant responses during the drill, so that better feedback can be provided to them. Additional research should be conducted, using the same or similar design, in different populations that are stakeholders in disaster preparedness, so that the generalizability of these findings can be determined.^

Effects of a health advocacy program to promote physical activity and nutrition behaviors among adolescents: An evaluation of the Young Leaders for Healthy Change program

Background. This study was designed to evaluate the effects of the Young Leaders for Healthy Change program, an internet-delivered program in the school setting that emphasized health advocacy skills-development, on nutrition and physical activity behaviors among older adolescents (13–18 years). The program consisted of online curricular modules, training modules, social media, peer and parental support, and a community service project. Module content was developed based on Social Cognitive Theory and known determinants of behavior for older adolescents. ^ Methods. Of the 283 students who participated in the fall 2011 YL program, 38 students participated in at least ten of the 12 weeks and were eligible for this study. This study used a single group-only pretest/posttest evaluation design. Participants were 68% female, 58% white/Caucasian, 74% 10th or 11th graders, and 89% mostly A and/or B students. The primary behavioral outcomes for this analysis were participation in 60-minutes of physical activity per day, 20-minutes of vigorous- or moderate- intensity physical activity (MVPA) participation per day, television and computer time, fruit and vegetable (FV) intake, sugar-sweetened beverage intake, and consumption of breakfast, home-cooked meals, and fast food. Other outcomes included knowledge, beliefs, and attitudes related to healthy eating, physical activity, and advocacy skills. ^ Findings. Among the 38 participants, no significant changes in any variables were observed. However, among those who did not previously meet behavioral goals there was an 89% increase in students who participated in more than 20 minutes of MVPA per day and a 58% increase in students who ate home-cooked meals 5–7 days per week. The majority of participants met program goals related to knowledge, beliefs, and attitudes prior to the start of the program. Participants reported either maintaining or improving to the goal at posttest for all items except FV intake knowledge, taste and affordability of healthy foods, interest in teaching others about being healthy, and ease of finding ways to advocate in the community. ^ Conclusions. The results of this evaluation indicated that promoting healthy behaviors requires different strategies than maintaining healthy behaviors among high school students. In the school setting, programs need to target the promotion and maintenance of health behaviors to engage all students who participate in the program as part of a class or club activity. Tailoring the program using screening and modifying strategies to meet the needs of all students may increase the potential reach of the program. The Transtheoretical Model may provide information on how to develop a tailored program. Additional research on how to utilize the constructs of TTM effectively among high school students needs to be conducted. Further evaluation studies should employ a more expansive evaluation to assess the long-term effectiveness of health advocacy programming.^

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.

A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

Nondeterminism and partially instantiated data structures give logic programming expressive power beyond that of functional programming. However, functional programming often provides convenient syntactic features, such as having a designated implicit output argument, which allow function cali nesting and sometimes results in more compact code. Functional programming also sometimes allows a more direct encoding of lazy evaluation, with its ability to deal with infinite data structures. We present a syntactic functional extensión, used in the Ciao system, which can be implemented in ISO-standard Prolog systems and covers function application, predefined evaluable functors, functional definitions, quoting, and lazy evaluation. The extensión is also composable with higher-order features and can be combined with other extensions to ISO-Prolog such as constraints. We also highlight the features of the Ciao system which help implementation and present some data on the overhead of using lazy evaluation with respect to eager evaluation.