Initial Algebra Semantics Is Enough!

DOI10.1007/978-3-540-73228-0_16zbMath1215.68138OpenAlexW1527090010MaRDI QIDQ3612632

Patricia Johann, Neil Ghani

Publication date: 10 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73228-0_16

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Related Items (11)

A principled approach to programming with nested types in Haskell ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Structured handling of scoped effects ⋮ Characterizing functions mappable over GADTs ⋮ Towards an induction principle for nested data types ⋮ Unnamed Item ⋮ Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers ⋮ Algebraic Specialization of Generic Functions for Recursive Types ⋮ High-level signatures and initial semantics ⋮ Initial Algebra Semantics for Cyclic Sharing Structures

This page was built for publication: Initial Algebra Semantics Is Enough!