Higher-order algebra with transfinite types

DOI10.1007/3-540-61254-8_29zbMath1407.68093OpenAlexW2138155064MaRDI QIDQ4645814

L. J. Steggles

Publication date: 11 January 2019

Published in: Higher-Order Algebra, Logic, and Term Rewriting (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61254-8_29

zbMATH Keywords

universal algebraequational theoryproduct typelimit typeunify algebra

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Cites Work

• Equational type logic
• An outline of set theory
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Universal algebra in higher types
• Fundamentals of contemporary set theory
• An algebraic semantics of higher-order types with subtypes
• A recursive second order initial algebra specification of primitive recursion
• A completeness theorem for the expressive power of higher-order algebraic specifications
• On the power of higher-order algebraic specification methods
• A transfinite type theory with type variables
• An Oxford survey of order sorted algebra
• Systems of transfinite types involving λ-conversion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher-order algebra with transfinite types