Subtyping with union types, intersection types and recursive types (1994) [18 citations — 2 self]
by Flemming Damm, Projet Lande
Theoretical Aspects of Computer Software
ftp://ftp.irisa.fr/techreports/1994/PI-816.ps.gz
Add To MetaCart
Abstract:
Programme 2--- Calcul symbolique, programmation et g'enie logiciel
Citations
| 196 | Type inclusion constraints and type inference – Aiken, Wimmers - 1993 |
| 134 | Soft typing – Cartwright, Fagan - 1991 |
| 127 | Refinement types for ML – Freeman, Pfenning - 1991 |
| 116 | R.Sethi: An ideal model for recursive polymorphic types – MacQueen - 1984 |
| 44 | Implementing regular tree expressions – Aiken, Murphy - 1991 |
| 38 | Solving systems of set constraints with negated subset relationships – Gilleron, Tison, et al. - 1993 |
| 27 | Solving systems of set constraints (extended abstract – Aiken, Wimmers - 1992 |
| 11 | Types with intersection: An introduction – Hindley - 1991 |
| 4 | G'ecseg and Magnus Steinby. Tree Automata. Akad'emiai Kiad'o – Ferenc - 1984 |
| 2 | Type Inference with Union Types, Intersection Types and Recursive Types – Damm - 1994 |

