A theory of type qualifiers
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (5), 192-203
- https://doi.org/10.1145/301618.301665
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A core calculus of dependencyPublished by Association for Computing Machinery (ACM) ,1999
- The marriage of effects and monadsPublished by Association for Computing Machinery (ACM) ,1998
- Trust in the λ-calculusJournal of Functional Programming, 1997
- Static detection of dynamic memory errorsPublished by Association for Computing Machinery (ACM) ,1996
- Simple imperative polymorphismHigher-Order and Symbolic Computation, 1995
- A Syntactic Approach to Type SoundnessInformation and Computation, 1994
- Graph typesPublished by Association for Computing Machinery (ACM) ,1993
- Type inference with simple subtypesJournal of Functional Programming, 1991
- Efficient type inference for higher-order binding-time analysisLecture Notes in Computer Science, 1991
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978