A computationally adequate model for overloading via domain-valued functors

DOI10.1017/S0960129598002539zbMath0917.68139MaRDI QIDQ4236214

Hideki Tsuiki

Publication date: 22 March 1999

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

zbMATH Keywords

denotational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (2)

A domain-theoretic semantics of lax generic functions. ⋮ Explicit mathematics: power types and overloading

This page was built for publication: A computationally adequate model for overloading via domain-valued functors