Combinators and type-driven transformers in Objective Caml

We describe an implementation of LDTA 2011 Tool Challenge tasks in Objective Caml language. Instead of using some dedicated domain-specific tools we utilize typical functional programming machinery such as polymorphic functions, monads and combinators; in addition we extensively use an idiom of type...

Full description

Saved in:
Bibliographic Details
Published in:Science of computer programming Vol. 114; pp. 57 - 73
Main Author: Boulytchev, Dmitry
Format: Journal Article
Language:English
Published: Elsevier B.V 15.12.2015
Subjects:
Combinators
Compilers
Datatype-generic programming
Functional programming
Modularization and code reuse
Modularization and code reuse
Functional programming
Datatype-generic programming
Combinators
Compilers
ISSN:0167-6423, 1872-7964
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe an implementation of LDTA 2011 Tool Challenge tasks in Objective Caml language. Instead of using some dedicated domain-specific tools we utilize typical functional programming machinery such as polymorphic functions, monads and combinators; in addition we extensively use an idiom of type-driven transformers, which can be considered as a form of datatype-generic programming. Our implementation provides a good example of utilization of Objective Caml specific features such as open and implicitly defined types. As a result we provide a highly modular implementation built up of separately compiled components combined in a type-safe manner.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2015.07.008