A domain-theoretic semantics of lax generic functions.

DOI10.1016/S0304-3975(01)00246-8zbMath1051.68046OpenAlexW2084754702MaRDI QIDQ1398469

Hideki Tsuiki

Publication date: 29 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00246-8

zbMATH Keywords

FibrationDomain theoryLax transformationObject orientedOverriding

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Uses Software

• CLOS

Cites Work

• The semantics of second-order lambda calculus
• Categorical logic and type theory
• A calculus for overloaded functions with subtyping
• Relational properties of domains
• The Category-Theoretic Solution of Recursive Domain Equations
• A computationally adequate model for overloading via domain-valued functors
• Categorical data types in parametric polymorphism
• Computational adequacy via ‘mixed’ inductive definitions
• Parallel reductions in \(\lambda\)-calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A domain-theoretic semantics of lax generic functions.