Lower bounds on type checking overloading
type: Item
instance of: scholarly article
title: Lower bounds on type checking overloading
zbMATH Open document ID: 0875.68541
DOI: 10.1016/0020-0190(95)00184-0
author: Dennis M. Volpano
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984137
zbMATH Keywords: Type theory
zbMATH Keywords: Overloading
zbMATH Keywords: Computational complexity
describes a project that uses: ML
MaRDI profile type: Publication
full work available at URL: 0020-0190(95)00184-0
OpenAlex ID: W2074241102
cites work: Tree acceptors and some of their applications
cites work: Q4179852
cites work: A theory of type polymorphism in programming
cites work: Q5624680
cites work: Haskell overloading is DEXPTIME-complete
cites work: Polymorphic type inference with overloading and subtyping
cites work: Principal type schemes for functional programs with overloading and subtyping
Recommended article: Type checking and problem of overloaded arguments
Recommended article: Q3216117
Recommended article: Basic polymorphic typechecking
Recommended article: A denotational approach for type-checking in object-oriented programming languages
Recommended article: Type checking with open type functions
Recommended article: Type-checking multi-parameter type classes
Recommended article: Q3702495
Recommended article: Mechanisms for improved covariant type-checking
description: scientific article; zbMATH DE number 984137