Foundations for structured programming with GADTs

DOI10.1145/1328438.1328475zbMath1295.68151OpenAlexW2076018351MaRDI QIDQ3189848

Patricia Johann, Neil Ghani

Publication date: 12 September 2014

Published in: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/33726/

zbMATH Keywords

program fusioninitial algebra semanticsGADTs

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (11)

A principled approach to programming with nested types in Haskell ⋮ Higher-order Algebras and Coalgebras from Parameterized Endofunctors ⋮ Shortcut fusion rules for the derivation of circular and higher-order programs ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Structured handling of scoped effects ⋮ Characterizing functions mappable over GADTs ⋮ Unnamed Item ⋮ Parametricity for primitive nested types ⋮ Parametricity, type equality, and higher-order polymorphism ⋮ Functional Semantics ⋮ Initial Algebra Semantics for Cyclic Sharing Structures

This page was built for publication: Foundations for structured programming with GADTs