A pattern for almost compositional functions

DOI10.1017/S0956796808006898zbMath1170.68007OpenAlexW2124274632MaRDI QIDQ3546044

Aarne Ranta, Björn Bringert

Publication date: 18 December 2008

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796808006898

zbMATH Keywords

Visitor design pattern

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Translating between Language and Logic: What Is Easy and What Is Difficult

Uses Software

• Boost

Cites Work

• Unnamed Item
• Deforestation: Transforming programs to eliminate trees
• Inductive families
• Practical type inference for arbitrary-rank types
• Modern Compiler Implementation in Java
• Grammatical Framework
• Generics for the masses
• Applicative programming with effects
• Two-level types and parameterized modules
• EDUCATIONAL PEARL: A Nanopass framework for compiler education

This page was built for publication: A pattern for almost compositional functions