On the decidability of subtyping with bounded existential types and implementation constraints
type: Item
instance of: scholarly article
title: On the decidability of subtyping with bounded existential types and implementation constraints
zbMATH Open document ID: 1251.68075
author: Stefan Wehr
author: Peter J. Thiemann
published in: New Generation Computing
publication date: 2012-11-16T00:00:00Z
Mathematics Subject Classification ID: 68N19
Mathematics Subject Classification ID: 68N30
Mathematics Subject Classification ID: 03B70
zbMATH DE Number: 6107851
zbMATH Keywords: object-oriented programming
zbMATH Keywords: subtyping
zbMATH Keywords: bounded existential types
zbMATH Keywords: undecidability
describes a project that uses: Scala
MaRDI profile type: Publication
full work available at URL: s00354-010-0100-1
OpenAlex ID: W2041341597
cites work: Q4715213
cites work: Comparing object encodings.
cites work: Bounded existentials and minimal typing
cites work: Q4506483
cites work: Type classes with existential types
cites work: Bounded quantification is undecidable
cites work: Q5713333
cites work: A variant of a recursively unsolvable problem
cites work: A REMARK ON "THE PARAMETER DEPENDENCE OF THE COEFFICIENT IN A MODEL FOR CONSTANT PRESSURE STEAM INJECTION IN SOIL"
DOI: 10.1007/S00354-010-0100-1
description: scientific article; zbMATH DE number 6107851