Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell

zbMATH Open1249.68035MaRDI QIDQ2893602FDOQ2893602

Authors: Dan Popa 

Publication date: 21 June 2012

Published in: Scientific Studies and Research. Series Mathematics and Informatics (Search for Journal in Brave)

Recommendations

• Adaptable software: how to build a modular monadic extensible compiler using the state monad and pseudoconstructors over monadic values
• Direct modular evaluation of expressions using the monads and type classes in Haskell
• Modular typechecking for hierarchically extensible datatypes and functions
• Implementation of Functional Languages
• Monads, partial evaluations, and rewriting
• Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code

zbMATH Keywords

modular monadic type checker in Haskellpseudoconstructors

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Cited In (1)

• Adaptable software: how to build a modular monadic extensible compiler using the state monad and pseudoconstructors over monadic values

Uses Software

• Haskell

This page was built for publication: Adaptable software -- modular extensible monadic entry-pointless type checker in Haskell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2893602)