Generic Programming with Combinators and Objects

06/02/2021
by   Dmitrii Kosarev, et al.
0

We present a generic programming framework for OCAML which makes it possible to implement extensible transformations for a large scale of type definitions. Our framework makes use of objectoriented features of OCAML, utilising late binding to override the default behaviour of generated transformations. The support for polymorphic variant types complements the ability to describe composable data types with the ability to implement composable transformations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/06/2018

Code Reuse With Transformation Objects

We present an approach for a lightweight datatype-generic programming in...
research
12/31/2018

Generic Programming in OCaml

We present a library for generic programming in OCaml, adapting some tec...
research
06/05/2014

Towards building a Crowd-Sourced Sky Map

We describe a system that builds a high dynamic-range and wide-angle ima...
research
02/16/2010

Using ATL to define advanced and flexible constraint model transformations

Transforming constraint models is an important task in re- cent constrai...
research
12/15/2021

Simulating Large Eliminations in Cedille

Large eliminations provide an expressive mechanism for arity- and type-g...
research
02/20/2014

Le Cam meets LeCun: Deficiency and Generic Feature Learning

"Deep Learning" methods attempt to learn generic features in an unsuperv...
research
04/17/2019

Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework

Sesqui-pushout (SqPO) rewriting provides a variant of transformations of...

Please sign up or login with your details

Forgot password? Click here to reset