A representation theorem for second-order functionals

DOI10.1017/S0956796815000088zbMath1420.68041arXiv1402.1699OpenAlexW2963683507MaRDI QIDQ5371942

Mauro Jaskelioff, Russell O'Connor

Publication date: 23 October 2017

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

Full work available at URL: https://arxiv.org/abs/1402.1699

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items

Build systems à la carte: Theory and practice ⋮ Unnamed Item

Uses Software

• Haskell
• lens

Cites Work

• Functorial polymorphism
• On functors expressible in the polymorphic typed lambda calculus
• Algebraic operations and generic effects
• Algebras for Parameterised Monads
• Data types à la carte
• Testing Polymorphic Properties
• Handlers of Algebraic Effects
• Parameterised notions of computation
• The essence of the <scp>Iterator</scp> pattern
• On Monadic Parametricity of Second-Order Functionals
• Free Applicative Functors
• Combinators for bi-directional tree transformations
• Fast and loose reasoning is morally correct
• Applicative programming with effects
• Category Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item