Tracing monadic computations and representing effects by Pirog, M, Gibbons, J

“…In functional programming, monads are supposed to encapsulate computations, effectfully producing the final result, but keeping the means of acquiring it to themselves. …”

HOMES: A Higher−Order Mapping Evaluation System by Vu, H, Benedikt, M

“…Our demonstration shows the utility of the system, explains the implementation architecture on top of a relational DBMS, and explains optimizations that combine subquery caching techniques from relational databases with sharing detection schemes from functional programming.…”

On the semantics of nested datatypes by Martin, C, Gibbons, J

“…There is a unique morphism from each initial functional algebra to any other functional algebra. folds are standard operators in functional programming and satisfy fusion laws that are useful for program transformation. …”

Pointwise Relational Programming by de Moor, O, Gibbons, J

“…The combination of variables and relational combinators such as converse and choice yields a kind of nondeterministic functional programming language. We give a semantics for such a language, and illustrate with an example application.…”

More on Merging and Selection by Gibbons, J

“…In his paper <i>On Merging and Selection</i> (<i>Journal of Functional Programming</i> 7(3), 1997), Bird considers the problem of computing the nth element of the list resulting from merging the two sorted lists x and y. …”

Higher-order decision theory by Hedges, J, Oliva, P, Shprits, E, Winschel, V, Zahn, P

“…It is directly implementable in functional programming languages. Lastly, modeling an agent with selection functions and quantifiers is modular and thereby allows to seamlessly combine agents bridging decision theory and game theory.…”

Scientific middleware for abstracted parallelisation by Goodman, D

“…This abstraction is achieved through the combination of Martlet, a work-flow language that uses constructs from functional programming to abstract the parallelisation in computations away from the user, and the construction of supporting middleware. …”

Stream fusion: practical shortcut fusion for coinductive sequence types by Coutts, D

“…<p>In functional programming it is common practice to build modular programs by composing functions where the intermediate values are data structures such as lists or arrays. …”

Convexity and Order in Probabilistic Call-by-Name FPC by Mathys Rennela

“…Consequently, Kegelspitzen form a denotational model of pPCF, an abstract functional programming language for probabilistic computing. …”
Get full text

Classical Combinatory Logic by Karim Nour

“…It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system "à la Hilbert''. …”
Get full text

Typing weak MSOL properties by Sylvain Salvati, Igor Walukiewicz

“…We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of calls to built-in operations. …”
Get full text

Learn Physics by Programming in Haskell by Scott N. Walck

“…We describe a method for deepening a student's understanding of basic physics by asking the student to express physical ideas in a functional programming language. The method is implemented in a second-year course in computational physics at Lebanon Valley College. …”
Get full text

Concurrent Programming Using Actors: Exploiting Large-Scale Parallelism by Agha, Gul, Hewitt, Carl

“…Act3 advances the state of the art in programming languages by combining the advantages of object-oriented programming with those of functional programming. We also discuss considerations relevant to large-scale parallelism in the context of open systems, and define an abstract model which establishes the equivalence of systems defined by actor programs.…”
Get full text

Investigating Haskell for parallel processing by Pahlevi Fikri Auliya

“…The raising interest of parallel programming on functional programming language, F# and Scala, takes us to a perspective that the future of parallel programming will be on functional language. …”
Get full text

A Functional Derivation of the Warren Abstract Machine by Pirog, M, Gibbons, J

“…We show that other well-known functional programming techniques (namely, explicit laziness and semi-persistent data structures) can help to develop abstract machines without detailed examination of the semantics realised by the interpreter.…”

Unifying Theories of Programming with Monads by Gibbons, J

“…We present a simple functional programming approach to this challenge, based on algebraic theories of computational effects. …”

Separating Sessions Smoothly by Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris

“…This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation. …”
Get full text

On the Relation of Interaction Semantics to Continuations and Defunctionalization by Ulrich Schöpp

“…This paper relates such semantically motivated non-standard compilation methods to more standard techniques in the compilation of functional programming languages, namely continuation passing and defunctionalization. …”
Get full text

Step-Indexed Relational Reasoning for Countable Nondeterminism by Lars Birkedal, Aleš Bizjak, Jan Schwinghammer

“…We present a step-indexed logical relations model of a higher-order functional programming language with countable nondeterminism and demonstrate how it can be used to reason about contextually defined may- and must-equivalence. …”
Get full text

Investigating STM in Haskell as an Alternative to Programming Systems with Shared Memory by Ernâni Teixeira Liberali, Juliana Kaiser Vizzotto

“…Then we describe the STM approach for parallel programming, as well its application in the context of functional programming languages, in special Haskell. As a case study to illustrate the advantages of using STM, we show the implementation in Haskell of the classic problem of synchronization, the dining philosophers problem. …”
Get full text