Special Issue on State-of-the-art applications of pure functional programming languages

1995 ◽  
Vol 5 (3) ◽  
pp. 279-281
Author(s):  
Pieter Hartel ◽  
Rinus Plasmeijer
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
State Of The Art ◽  
Special Issue ◽  
Functional Programming Languages

scholarly journals Special issue on Programming with Dependent Types Editorial

2017 ◽  
Vol 27 ◽  
Author(s):  
WOUTER SWIERSTRA ◽  
PETER DYBJER
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
Wide Spectrum ◽  
Research Area ◽  
Dependent Types ◽  
Proof Assistants ◽  
Special Issue ◽  
Functional Programming Languages ◽  
The Past

There has been sustained interest in functional programming languages with dependent types in recent years. The foundations of dependently typed programming can be traced back to Martin–Löf's work in the 1970s. In the past decades, this vision has given rise to the development of proof assistants and functional programming languages based on dependent types. The increased popularity of systems such as Agda, Coq, Idris, and many others, reflects the growing momentum in this research area. After sending out our first call for papers in October 2015, we are happy to accept six articles in this special issue covering a wide spectrum of topics.

scholarly journals Editorial for the Special Issue on Parallel and Concurrent Functional Programming

2018 ◽  
Vol 28 ◽  
Author(s):  
Gabriele Keller ◽  
Fritz Henglein
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
Programming Model ◽  
State Of The Art ◽  
Functional Languages ◽  
Functional Language ◽  
Special Issue ◽  
Practical Applications ◽  
Wide Range ◽  
Concurrent Computing

Functional languages are uniquely suited to providing programmers with a programming model for parallel and concurrent computing. This is reflected in the wide range of work that is currently underway, both on parallel and concurrent functional languages, as well as on bringing functional language features to other programming languages. This has resulted in a rapidly growing number of practical applications. The Journal of Functional Programming decided to dedicate a special issue to this field to showcase the state of the art in how functional languages and functional concepts currently assist programmers with the task of managing the challenges of creating parallel and concurrent systems.

scholarly journals Special issue on Algorithmic aspects of functional programming languages

2001 ◽  
Vol 11 (5) ◽  
pp. 439-440
Author(s):  
CHRIS OKASAKI
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Functional Programming ◽  
Special Issue ◽  
Functional Programming Languages ◽  
Functional Programming Language

Algorithms can be dramatically affected by the language in which they are implemented. An algorithm that is elegant and efficient in one language may be ugly and inefficient in another. If you have ever attempted to implement an assignment-intensive algorithm in a functional programming language, you are probably more familiar with this phenomenon than you ever wanted to be! But this sword does not cut in only one direction. Functional programming languages are wonderfully suited to expressing certain kinds of algorithms in a clean, modular way, and researchers over the last five to ten years have greatly expanded the range of algorithms for which this is true.

scholarly journals Dynamic game semantics

2020 ◽  
pp. 1-60
Author(s):  
Norihiro Yamada ◽  
Samson Abramsky
Keyword(s):  
Programming Languages ◽  
Functional Programming ◽  
Operational Semantics ◽  
Dynamic Game ◽  
Standard Interpretation ◽  
Functional Programming Languages ◽  
Game Semantics ◽  
Wide Range ◽  
Cartesian Closed Categories ◽  
Cartesian Closed

Abstract The present work achieves a mathematical, in particular syntax-independent, formulation of dynamics and intensionality of computation in terms of games and strategies. Specifically, we give game semantics of a higher-order programming language that distinguishes programmes with the same value yet different algorithms (or intensionality) and the hiding operation on strategies that precisely corresponds to the (small-step) operational semantics (or dynamics) of the language. Categorically, our games and strategies give rise to a cartesian closed bicategory, and our game semantics forms an instance of a bicategorical generalisation of the standard interpretation of functional programming languages in cartesian closed categories. This work is intended to be a step towards a mathematical foundation of intensional and dynamic aspects of logic and computation; it should be applicable to a wide range of logics and computations.

ПРИМЕНЕНИЕ МОДЕЛИ СИНТАКСИЧЕСКИ УПРАВЛЯЕМОГО ПЕРЕВОДА АРИФМЕТИЧЕСКИХ ВЫРАЖЕНИЙ В ПРОЦЕССЕ ОБУЧЕНИЯ СТУДЕНТОВ

2020 ◽  
Author(s):  
Igor Oblomov ◽  
Vyacheslav Rzhavin ◽  
Natalia Pervova ◽  
Alina Gerasimova
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Learning Process ◽  
Functional Programming ◽  
Syntactic Analysis ◽  
Simple Arithmetic ◽  
Functional Programming Languages ◽  
Source Data ◽  
Prolog Programming ◽  
Arithmetic Expressions

В статье рассматривается модель синтаксически управляемого перевода простых арифметических выражений и ее использование в процессе обучения. Атрибутно-транслируемая грамматика предполагает перевод последовательности актов в последовательность действий, которые, в свою очередь, будут являться исходными данными для следующих этапов трансляции. Раскрываются основные моменты обучения студентов декларативному языку программирования Пролог, делается упор на обработку множества символов действия. Дальнейшие исследования предполагают разработку моделей синтаксического анализа с помощью средств императивных и функциональных языков программирования с целью получения и анализа объективных оценок эффективности полученных моделей в процессе обучения будущих специалистов.This article discusses the model of syntactically controlled translation of simple arithmetic expressions and its use in the learning process. The attribute-translated grammar involves the translation of a sequence of acts into a sequence of actions, which will be the source data for the next stages of translation. The article reveals the main points of teaching students the Prolog programming language, focuses on the processing of many action symbols. Further research involves the development of models of syntactic analysis by means of imperative and functional programming languages in order to obtain and analyze the objective estimates of the effectiveness of the obtained models in the training of future specialists.

Sign in / Sign up

Export Citation Format

Share Document