Fibrational Induction Rules for Initial Algebras

DOI10.1007/978-3-642-15205-4_27zbMath1287.68113OpenAlexW2151828545MaRDI QIDQ3586050

Patricia Johann, Clément Fumex, Neil Ghani

Publication date: 3 September 2010

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15205-4_27

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Eilenberg-Moore and Kleisli constructions for monads (18C20)

Related Items (5)

Deriving logical relations from interpretations of predicate logic ⋮ Bisimulation as a logical relation ⋮ From realizability to induction via dependent intersection ⋮ Deep induction: induction rules for (truly) nested types ⋮ The calculus of dependent lambda eliminations

This page was built for publication: Fibrational Induction Rules for Initial Algebras