Incremental Modelling and Verification of the PCI Express Transaction Layer by Böhm, P

“…By restricting the models to an executable subset of the specification language, we have been able to combine the advantages of specifying in a theorem prover with the advantages of executable models in a functional programming language.…”

Notions of Bidirectional Computation and Entangled State Monads by Abou-Saleh, F, Cheney, J, Gibbons, J, McKinna, J, Stevens, P

“…We build on the mature theory of monadic encapsulation of effects in functional programming, develop the equational theory and important combinators for effectful bx, and provide a prototype implementation in Haskell along with several illustrative examples.…”

Incremental and Verified Modelling of the PCI Express Protocol by Böhm, P

“…By restricting the models to an executable subset of the specification language, we have been able to combine the advantages of specifying in a theorem prover with the advantages of executable models in a functional programming language.…”

Evaluation strategies for monadic computations by Tomas Petricek

“…Monads have become a powerful tool for structuring effectful computations in functional programming, because they make the order of effects explicit. …”
Get full text

Quantifying and Explaining Immutability in Scala by Philipp Haller, Ludvig Axelsson

“…Functional programming typically emphasizes programming with first-class functions and immutable data. …”
Get full text

Cyclic Datatypes modulo Bisimulation based on Second-Order Algebraic Theories by Makoto Hamana

“…Cyclic data structures, such as cyclic lists, in functional programming are tricky to handle because of their cyclicity. …”
Get full text

Iteration Algebras for UnQL Graphs and Completeness for Bisimulation by Makoto Hamana

“…Recently, the functional programming community has shown renewed interest in UnCAL, because it provides an efficient graph transformation language which is useful for various applications, such as bidirectional computation. …”
Get full text

Automatic Modular Abstractions for Template Numerical Constraints by David Monniaux

“…The motivation of our work is data-flow synchronous programming languages, used for building control-command embedded systems, but it also applies to imperative and functional programming. Our algorithms are based on quantifier elimination and symbolic manipulation techniques over linear arithmetic formulas. …”
Get full text

Bistable Biorders: A Sequential Domain Theory by James Laird

“…We also construct a bistable model of SPCF, a higher-order functional programming language with non-local control. We use our universality result for the lambda-calculus to show that the semantics of SPCF is fully abstract. …”
Get full text

Analyzing the State Behavior of Programs by Bawden, Alan

“…I propose to construct a compiler that takes advantage of these insights to achieve some of the benefits normally associated with purely functional programming systems.…”
Get full text

Profunctor optics, a categorical update by Clarke, B, Elkins, D, Gibbons, J, Loregian, F, Milewski, B, Pillmore, E, Román, M

“…Profunctor optics have previously been studied only in an unenriched and non-mixed setting, in which both directions of access are modelled in the same category. However, functional programming languages are arguably better described by enriched categories; and we have found that some structures in the literature are actually mixed optics, with access directions modelled in different categories. …”

Selection equilibria of higher-order games by Hedges, J, Oliva, P, Sprits, E, Winschel, V, Zahn, P

“…Such games can be directly and naturally implemented in strongly typed functional programming languages such as Haskell [3]. In this paper we introduce a new solution concept for such higher-order games, which we call selection equilibrium. …”

Relational STE and theorem proving for formal verification of industrial circuit designs by O'Leary, J, Kaivola, R, Melham, T

“…Model checking by symbolic trajectory evaluation, orchestrated in a flexible functional-programming framework, is a well-established technology for correctness verification of industrial-scale circuit designs. …”

Polytypic Programming With Ease by Hinze, R

“…This article proposes a new framework for a polytypic extension of functional programming languages. A polytypic functional program is one that is parameterised by datatype. …”

TOWARDS GREEN COMPUTING IN ERLANG by Áron Attila MÉSZÁROS, Gergely NAGY, István BOZÓ, Melinda T´ÓTH

“…In our research we are focusing on the functional programming language Erlang. We have investigated the effect of different language constructs (such as higher order functions), parallelism, data structures and styles of programming on energy usage. …”
Get full text

Information flow analysis for a dynamically typed language with staged metaprogramming by Lester, M, Ong, L, Schäfer, M

“…</p> <br/> <p>To our knowledge, this is the first fully static information flow analysis for a language with staged metaprogramming, and the first formal soundness proof of a CFA-based information flow analysis for a functional programming language.</p></pweb>…”

Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis by José Meseguer, Musab AlTurki

“…Orc also has a fully fledged implementation in Java with functional programming features. However, as with descriptions of most distributed languages, there exists a fairly substantial gap between Orc's formal semantics and its implementation, in that: (i) programs in Orc are not easily deployable in a distributed implementation just by using Orc's formal semantics, and (ii) they are not readily formally analyzable at the level of a distributed Orc implementation. …”
Get full text

THE DISCOVERY OF TOP-K DNA FREQUENT PATTERNS WITH APPROXIMATE METHOD by Nittaya Kerdprasop, Kittisak Kerdprasop

“…Our designed algorithm had been implemented with the Erlang language, which is the functional programming paradigm with inherent support for pattern matching. …”

The discovery of Top-K DNA frequent patterns with approximate method / Nittaya Kerdprasop and Kittisak Kerdprasop by Kerdprasop, Nittaya, Kerdprasop, Kittisak

“…Our designed algorithm had been implemented with the Erlang language, which is the functional programming paradigm with inherent support for pattern matching. …”
Get full text

The pebbling comonad in finite model theory by Abramsky, S, Dawar, A, Wang, P

“…Monads and comonads are basic notions of category theory which are widely used in semantics of computation and in modern functional programming. We show that existential kpebble games have a natural comonadic formulation. …”