Tag-free combinators for binding-time polymorphic program generation

DOI10.1007/978-3-642-12251-4_8zbMATH Open1284.68138OpenAlexW1482634424MaRDI QIDQ3558331FDOQ3558331

Martin Sulzmann, Peter J. Thiemann

Publication date: 4 May 2010

Published in: Functional and Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12251-4_8

Recommendations

• scientific article; zbMATH DE number 2084340
• Combinators for program generation
• Cogen in six lines
• Tools and Algorithms for the Construction and Analysis of Systems
• Fully Automatic Binding-Time Analysis for Prolog

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Cited In (4)

• Combinators for program generation
• Typed Tagless Final Interpreters
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• Haskell

This page was built for publication: Tag-free combinators for binding-time polymorphic program generation

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