Constructing language processors with algebra combinators

DOI10.1016/j.scico.2009.12.007zbMath1211.68049OpenAlexW1976227603WikidataQ114850292 ScholiaQ114850292MaRDI QIDQ608238

Nicolas Frisby, Perry Alexander, Philip Weaver, Garrin Kimmell

Publication date: 25 November 2010

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2009.12.007

zbMATH Keywords

generic programmingmodular semantics

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (1)

Constructing language processors with algebra combinators

Uses Software

• Stratego
• Haskell
• Polyp

Cites Work

• Constructing language processors with algebra combinators
• Data structures and program transformation
• Notions of computation and monads
• A category-theoretic characterization of functional completeness
• Paramorphisms
• Comprehending monads
• The Zipper
• Scrap more boilerplate
• Associated types with class
• Fold and unfold for program semantics
• Applicative programming with effects
• Two-level types and parameterized modules
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing language processors with algebra combinators