Extending the type checker of Standard ML by polymorphic recursion
type: Item
instance of: scholarly article
title: Extending the type checker of Standard ML by polymorphic recursion
zbMATH Open document ID: 0913.68188
DOI: 10.1016/S0304-3975(98)00139-X
author: Martin Emms
author: Hans Leiß
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1238991
zbMATH Keywords: Functional programming
zbMATH Keywords: Type inference
zbMATH Keywords: Polymorphic recursion
describes a project that uses: ML
MaRDI profile type: Publication
cites work: Modified basic functionality in combinatory logic
cites work: Q5590039
cites work: The Principal Type-Scheme of an Object in Combinatory Logic
cites work: Q3819992
cites work: Q4027630
cites work: The undecidability of the semi-unification problem
cites work: Q4268483
cites work: Q4035254
cites work: A theory of type polymorphism in programming
cites work: Q3340118
cites work: Q3815293
cites work: A Machine-Oriented Logic Based on the Resolution Principle
description: scientific article; zbMATH DE number 1238991