scientific article; zbMATH DE number 1231454

zbMath0910.68143MaRDI QIDQ4222755

No author found.

Publication date: 10 December 1998

Full work available at URL: http://www.elsevier.com/cas/tree/store/tcs/free/noncas/pc/volume1.htm#eifrig

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recursive types\(F\)-bounded polymorphic types

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (10)

Non-structural subtype entailment in automata theory ⋮ Type-specialized staged programming with process separation ⋮ Formalisation and implementation of an algorithm for bytecode verification of \(\@\)NonNull types ⋮ Type inference and strong static type checking for Promela ⋮ Types and trace effects for object orientation ⋮ Type Inference using Constraint Handling Rules ⋮ Semi-explicit first-class polymorphism for ML. ⋮ Simplifying subtyping constraints: a theory ⋮ Type inference for variant object types ⋮ Subtyping constrained types

This page was built for publication: