List-based Monadic Computations for Dynamically Typed Languages

Vanderbauwhede, W. (2014) List-based Monadic Computations for Dynamically Typed Languages. In: Dyla'14: Workshop on Dynamic Languages and Applications, Edinburgh, Scotland, 9-11 Jun 2014, pp. 1-7. ISBN 9781450329163 (doi: 10.1145/2617548.2617551)

Full text not currently available from Enlighten.

Abstract

In this paper we propose a flexible and elegant design for list-based monadic ("karmic") computations in dynamically typed languages. Our approach is applicable to any dynamically typed language that supports lists, maps and higher-order functions. The design results in a clear, concise and largely language-independent syntax. We prove that our design adheres to the laws governing monads. We illustrate the use of the list-based monads with three examples: error handling in computations, stateful computations and parser combinators. We provide examples in the popular multi-paradigm language Perl, the object-oriented language Ruby and the functional dynamically typed language LiveScript.

Item Type:Conference Proceedings
Status:Published
Refereed:Yes
Glasgow Author(s) Enlighten ID:Vanderbauwhede, Professor Wim
Authors: Vanderbauwhede, W.
College/School:College of Science and Engineering > School of Computing Science
ISBN:9781450329163
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record