Skip to content

Latest commit

 

History

History
19 lines (16 loc) · 535 Bytes

File metadata and controls

19 lines (16 loc) · 535 Bytes
layout post
title The use of Modular Reifiable Matching (MRM)
authors Li Huang
date 2016-07-14 15:00:00 +0800
venue CB 313
categories LiHuang 2016

Abstract

Modular Reifiable Matching (MRM) is an approach to enhance the extensibility in functional programs. It uses list-of-functors to represent datatypes and ‘Matches’ for first class reusable code pieces. In this talk I will introduce its basic framework, some interesting examples and show my attempts to write modular interpreter using it.