An algebraic semantics of higher-order types with subtypes

DOI10.1007/BF01209625zbMath0790.68079MaRDI QIDQ1323318

Zhenyu Qian

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

program transformationalgebraic specificationfunctional programmingoverloadinghigher-order functionsdata type specificationorder-sorted algebrasequational deductionsubtype polymorphism

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Related Items (3)

Reduction and unification in lambda calculi with a general notion of subtype ⋮ Higher-order algebra with transfinite types ⋮ Verifying an infinite systolic algorithm using third-order equational methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics of order-sorted specifications
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• Universal algebra in higher types
• Computational aspects of an order-sorted logic with term declarations
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• The completeness theorem for typing lambda-terms
• A filter lambda model and the completeness of type assignment
• On specifications, theories, and models with higher types
• Higher order data types
• Data Types as Lattices
• What is a model of the lambda calculus?

This page was built for publication: An algebraic semantics of higher-order types with subtypes