Deconstraining DSLs

DOI10.1145/2364527.2364571zbMATH Open1291.68104OpenAlexW2296638255MaRDI QIDQ5168909FDOQ5168909

Authors Will Jones, Tony Field, Tristan Allwood

Publication date 21 July 2014

Published in Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2364527.2364571

zbMATH Keywords

constraintsdomain-specific languagesstatic typing

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• The constrained-monad problem
• Haskell type constraints unleashed
• Folding domain-specific languages: deep and shallow embeddings (functional pearl)
• scientific article; zbMATH DE number 2080282
• Compiling embedded languages

Cited in

(3)

• Haskell type constraints unleashed
• The constrained-monad problem
• Deep embedding with class

This page was built for publication: Deconstraining DSLs

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