Functional Programming

Meta-programming languages provide infrastructure to generate and execute object programs at run-time. In a typed setting, they contain a modal type constructor which classifies object code. These code types generally come in two flavors: closed and open. Closed code expressions can be invoked at run-time, but the computations over them are more rigid, and typically produce less efficient residual object programs. Open code provides better inlining and partial evaluation of object programs, but once constructed, expressions of this type cannot in general be evaluated.Recent work in this area has focused on combining the two notions into a sound system. We present a novel way to achieve this. It is based on adding the notion of names from the work on Nominal Logic and FreshML to the λ -calculus of proof terms for the necessity fragment of modal logic S4. The resulting language provides a more fine-grained control over free variables of object programs when compared to the existing la...

The motivation and the basic issues for designing the programming system - ELa, that allowed combination of different programming paradigms is presented in the part one of this paper. In the ELa system distinct styles of programming (functional, logic and object-oriented) are enabled. The system is currently under development at the Institute of Mathematics in Novi Sad. In this paper we describe the problem definition of a multiprogramming system, and the current state of realization of that programming system. In the part two we will illustrate the ELa system that permit the combination of the functional, the logical and the object oriented paradigm of programming.

Jerinić, Lj., A Perspective on Combining Different Programming Paradigms. Bulletins for Applied Mathematics, BAM 1066/95 (LXXV), (May 1995) Budapest, 35-46.

WASH makes server-side Web programming as easy as programming a stand-alone application with an XHTML-based GUI. Starting from an interaction graph model of the application where nodes model web pages and edges correspond to form submissions, each node is implemented by a WASH function and the edges correspond to function invocation. Nodes can be decomposed further into “pagelets”, which are XHTML fragments bundled with associated logic. We give an introduction to the concepts of WASH programming with this methodology and advocate the design of interactive web functionality in terms of such pagelets. The two components of a pagelet may be specified monolithically or in separation. Pagelets may also be composed up to an entire WASH page. The development of a web-based logging application serves as a running example.

Chris Okasaki showed how to implement red-black trees in a functional programming language. Ralf Hinze incorporated even the invariants of such data structures into their types, using higher-order nested datatypes. We show how one can achieve something very similar without the usual performance penalty of such types, by combining the features of nested datatypes, phantom types and existential type variables.

Software engineering courses offer one of many opportunities for providing students with a significant experience in declarative programming. This report discusses some results from taking advantage of this opportunity in a two-semester sequence of software engineering courses for students in their final year of baccalaureate studies in computer science. The sequence is based on functional programming using ACL2, a purely

* € (D) sind gebundene Ladenpreise in Deutschland und enthalten 7% MwSt; € (A) sind gebundene Ladenpreise in Österreich und enthalten 10% MwSt. CHF und die mit ** gekennzeichneten Preise für elektronische Produkte sind unverbindliche Preisempfehlungen und enthalten die landesübliche MwSt. Programm-und Preisänderungen (auch bei Irrtümern) vorbehalten. Es gelten unsere Allgemeinen Liefer-und Zahlungsbedingungen. Interaktiv in Common Lisp ▶ Behandelt theoretische und praktische Aspekte der Programmiersprache Common Lisp ▶ Motiviert den Leser zum Ausprobieren ▶ Bietet zahlreiche Übungsmöglichkeiten Dieses Buch vermittelt die einzigartige Idee hinter der Programmiersprache Lisp. Aus der Verbindung von interaktiver und funktionaler Programmierung entsteht eine Arbeitsstrategie in der Software-Entwicklung, mit der ein Programmierer schneller als mit konventionellen Verfahren einen korrekten, verständlichen und leicht anpassbaren Code entwickeln kann. Durch die Anwendung algebraischer Methoden auf die wandelbare Sprache Common Lisp lernt der Leser, bekannte Probleme der Anwendungsprogrammierung neu zu denken und dadurch zu präzisen und bündigen Lösungen zu kommen. Der Autor veranschaulicht an mehreren Beispielen aus der Praxis die Nutzung der Programmiersprache und motiviert den Leser, sich selbst mit Common Lisp zu befassen. Der Inhalt • Elementares Lisp • Common Lisp • Funktionale Programmierung < • Rekursionsstrukturen • Kategorientheorie • Programmieren mit Morphismen • Metaprogrammierung mit Lisp-Makros • Der metazirkuläre Interpreter Die Zielgruppe • Informatiker • Software-Entwickler • Praktiker und Mathematiker mit Interesse an funktionaler Programmierung Der Autor Patrick M. Krusenotto studierte Informatik an der Universität Bonn und ist Systemarchitekt beim Auslandsrundfunk Deutsche Welle.

Thanks to more powerful hardware and a new generation of learning algorithms, artificial intelligence is supporting the automation of a number of tasks and activities that are changing the job landscape as much as they have impacted on our everyday life. The first part of the chapter introduces artificial intelligence from its origins: its definition and its main research and application areas. The nature and the importance of machine learning for artificial intelligence applications are presented in the second part of the chapter. Existing approaches to machine learning are also classified and illustrated. The third part describes artificial intelligence tools and solutions by supported functionalities and automated tasks. Cases of applications in tourism are provided, from the best known and widely adopted, e.g., personal assistants, to the most challenging, i.e., semantic systems. Future trends and risks related to the applications of artificial intelligence are considered in the last part of the chapter.

Este libro evolucionó a partir del material preparado para las clases de la materia «Programación Funcional», impartida para la Carrera de Licenciatura en Ciencias de la Computación de la Universidad Centroamericana «José Simeón Cañas».

Después de un año de trabajo, este libro incluye un recorrido por las características básicas del lenguaje Racket, en su versión 5.

Racket 5 es la nueva versión de PLT Scheme , un sistema de programación de larga tradición en el aprendizaje de la programación de computadoras, a través del paradigma funcional, basándose en el lenguaje Scheme.

Realmente no existe, formalmente hablando, un lenguaje llamado Scheme, sino que se le llama así a una familia de lenguajes de programación funcionales (véase el capítulo 1).

En este libro, se discute específicamente el dialecto conocido como Racket (anteriormente PLT Scheme), uno de los más difundidos. Si se quiere un estudio más purista sobre Scheme, revise el estándar R5RS que también es soportado por el intérprete de Racket.

Los temas abordados en la Parte I incluyen una introducción a la programación funcional, una sencilla guía de instalación de Racket y una introducción a la interacción con Racket y DrRacket.

En la Parte II se introduce el lenguaje Racket en sí, a través de sus elementos básicos y los bloques lambda, característicos de la programación funcional.

La Parte III describe los demás elementos del lenguaje y contiene múltiples ejercicios para que el lector practique sus nuevos conocimientos.

Finalmente, la Parte IV muestra las capacidades de Racket para implementar programas con interfaces gráficas de usuario.

Y por último, la Parte V incluye un anexo describiendo las diferencias entre la versión 5 de Racket y la serie 4.x de PLT Scheme.

The aim of this study is to compare the two non-imperative languages: Logic Programming and Functional Programming, This paper contains information about each language including an overview of these program languages, and the use of them, after that the “Results and the discussion” section will have the difference and the similarity between Logic Programming and Functional Programming. Various sources were used to research about each programming language; these sources were analyzed and reviewed to arrive at the comparison between Logic and Functional Programming

Starting at a seminal paper published by J. Jaffar and J.L. Lassez in 1987 [JL87], Constraint Logic Programming (CLP) has developed as a powerful programming paradigm which supports a clean combination of logic (in the form of Horn clauses) and domain-specific methods for constraint satisfaction, simplification and optimization. The well established mathematical foundations of logic programming [Llo87, Apt90] have been succesfully extended to CLP [JMMS96]. Simultaneously, practical applications of CLP have arisen in many fields. Good introductions to the theory, implementation issues and programming applications of CLP languages can be found in [JM94, MS98]. On the other hand, the combination of logic programming with other declarative programming paradigms (especially functional programming) has been widely investigated during the last decade, leading to useful insights for the design of more expressive declarative languages. The first attempt to combine functional and logic languages was done by J.A. Robinson and E.E. Sibert when proposing the language LOGLISP [RS82]. Some other early proposals for the design of functional + logic languages are described in [De86]. A more recent survey of the operational principles and implementation techniques used for the integration of functions into logic programming can be found in [Han94b].

This book, the first in the subject, is a comprehensive account of optimal reduction by two of its leading exponents. Practical implementation aspects are fully covered as are its mathematical underpinnings. The relationship to the pioneering work of Lévy and to Girard&#x27;s more ...

in this article we deal with DSL (domain specific language) ,internal or external DSL. We present terminology and expression about DSL and after that we present differences between Internal and External DSL and make example with them show you why software engineers choose this method for development the project and show you instance projects that made by the Model Driven software development and show you some reason why industrial companies use this method how industrialized countries use this method for development of projects why collaborative development is important in these days.we describe methods of collaborative development.for example DSL for communicate between domain experts and development team .unified modeling language.Sysml for system engineering.commercial toolkits for model driven engineering and Architecture description languages(ADLs).

This report is written as a post-mortem of a project that has, perhaps, been the author’s most extensive personal project: creating a complete and comprehensive solution to one of the most famous programming problem sets in the modern computer science curriculum Structure and Interpretation of Computer Programs by Abelson, G. J. Sussman, and J. Sussman. It measures exactly: • How much effort SICP requires (729 hours 19 minutes (over eight months), 292 sessions). • How many computer languages it involves (6). • How many pieces of software are required (9). • How much communication with peers is needed. It suggests: • A practical software-supported task management procedure for solving coursework. • Several improvements, on the technical side, to any hard skills teaching process. • Several improvements, on the social side, to any kind of teaching process. The solution is published online (the source code and pdf file): • http://gitlab.com/Lockywolf/chibi-sicp (Nikishkin 2020) This report (and the data in the appendix) can be applied immediately as: • A single-point estimate of the SICP problem set difficulty. • A class handout aimed at increasing students’ mo- tivation to study. • A data source for a study of learning patterns among adult professionals aiming for continuing education. • An “almost ready” protocol for a convenient problem- set solution procedure, which produces artefacts that can be later used as a student portfolio. • An “almost ready”, and “almost convenient” pro- tocol for measuring time consumption of almost any problem set expressible in a digital form. Additionally, a time-tracking data analysis can be re- produced interactively in the org-mode version of this report. (See: Appendix: Emacs Lisp code for data ana- lysis)

Workflow languages are a form of high-level programming language designed for coordinating tasks implemented by different pieces of software, often executed across multiple computers using technologies such as web services. Advantages of workflow languages include automatic parallelisation, built-in support for accessing services, and simple programming models that abstract away many of the complexities associated with distributed and parallel programming. In this thesis, we focus on data-oriented workflow languages, in which all computation is free of side effects.

Despite their advantages, existing workflow languages sacrifice support for internal computation and data manipulation, in an attempt to provide programming models that are simple to understand and contain implicit parallelism. These limitations inconvenience users, who are forced to define additional components in separate scripting languages whenever they need to implement programming logic that cannot be expressed in the workflow language itself.

In this thesis, we propose the use of functional programming as a model for data-oriented workflow languages. Functional programming languages are both highly expressive and amenable to automatic parallelisation. Our approach combines the coordination facilities of workflow languages with the computation facilities of functional programming languages, allowing both aspects of a workflow to be expressed in the one language.

We have designed and implemented a small functional language called ELC, which extends lambda calculus with a minimal set of features necessary for practical implementation of workflows. ELC can either be used directly, or as a compilation target for other workflow languages. Using this approach, we developed a compiler for XQuery, extended with support for web services. XQuery's native support for XML processing makes it well-suited for manipulating the XML data produced and consumed by web services. Both languages make it easy to develop complex workflows involving arbitrary computation and data manipulation.

Our workflow engine, NReduce, uses parallel graph reduction to execute workflows. It supports both orchestration, where a central node coordinates all service invocation, and choreography, where coordination, scheduling, and data transfer are carried out in a decentralised manner across multiple nodes. The details of orchestration and choreography are abstracted away from the programmer by the workflow engine. In both cases, parallel invocation of services is managed in a completely automatic manner, without any explicit direction from the programmer.

Our study includes an in-depth analysis of performance issues of relevance to our approach. This includes a discussion of performance problems encountered during our implementation work, and an explanation of the solutions we have devised to these. Such issues are likely to be of relevance to others developing workflow engines based on a similar model. We also benchmark our system using a range of workflows, demonstrating high levels of performance and scalability.

The programming language LISPKIT LISP is the one dialect of the programming language LISP. In this paper was described the one implementation of the translator of LISPKIT Lisp-language to SECD-machine language. The implementation is completed in FORTRAN-language and is tested on the DELTA 11/340 computer system of the Institute of mathematics, University of Novi Sad. The translator is the part of LISPKIT Lisp-language interpreter. The authors don't know any similar implementation of LISPKIT Lisp-interpreter in Yugoslavia.

Informatica - An International Journal of Computing and Informatics
Print edition ISSN: 0350-5596
Web edition ISSN: 1854-3871
ISSN 0350-5596
http://www.informatica.si/PDF/Informatica_1984_1.pdf