Algebraic Specialization of Generic Functions for Recursive Types

DOI10.1016/j.entcs.2011.02.016zbMath1291.68113OpenAlexW2163101388WikidataQ113318284 ScholiaQ113318284MaRDI QIDQ5166621

Alcino Cunha, Hugo Pacheco

Publication date: 27 June 2014

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2011.02.016

zbMATH Keywords

rewrite systemsspecializationgeneric programmingrecursion patternstype families

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Transformation of structure-shy programs with application to XPath queries and strategic functions

Uses Software

• Haskell
• XPath
• XPTO

Cites Work

• Paramorphisms
• Strongly Typed Rewriting For Coupled Software Transformation
• Scrap your boilerplate with class
• Associated type synonyms
• Initial Algebra Semantics Is Enough!
• A Framework for Point-Free Program Transformation
• Can programming be liberated from the von Neumann style?
• Type checking with open type functions
• Mathematics of Program Construction

This page was built for publication: Algebraic Specialization of Generic Functions for Recursive Types