Joachim Niehren, Andreas Podelski, and Ralf Treinen. Equational and Membership Constraints for Infinite Trees. In Claude Kirchner, editor, Proceedings of the RTA '93, pp. 106--120, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Weak Subsumption Constraints for Type Diagnosis: An Incremental .. - Müller, al. (1995) (Correct)
....(see [MN95] This allows to do type diagnosis for records [ST92] and objects. An entirely set based semantics allows to naturally extend the algorithm to a full fledged type diagnosis system, covering among other aspects sorts, disjunctive types, and recursive data type declarations [NPT93]. Type Diagnosis. As an illustrating example for the form of type diagnosis we have in mind, consider the following fl program: 9x9y9z9p p:u v=v=cons(x u) p y y x=f(y z) This program declares four variables x; y; z, and p. It defines a relational abstraction p, which states that its two ....
....of v which depends through v=cons(x u) on x, and at the same time that x should be exactly f(y z) Type diagnosis along this line is discussed in depth in [MN95] Related Work. Apart from the already mentioned work, related work includes investigations about membership constraints (e.g. [NPT93]) type analysis for untyped languages (Soft Typing) AW93, CF91, WC93] constraint based program analysis [KPS94] and the 1 Note that p:u v=v=cons(x u) is different from a named abstraction p = u:cons(x u) because it is relational rather than functional, and also different to the Prolog ....
Joachim Niehren, Andreas Podelski, and Ralf Treinen. Equational and Membership Constraints for Infinite Trees. In Claude Kirchner, editor, Proceedings of the RTA '93, pages 106--120, 1993.
A Type is a Type is a Type - Müller, Niehren (1995) (2 citations) Self-citation (Niehren) (Correct)
....algorithm can be extended to a full fledged type diagnosis system [MN95a] covering record types, sorts, disjunctive (i.e. union) types, recursive data type declarations, and others. Record types are modelled by feature constraints [ST94] and type declarations by membership constraints following [NPT93]. For these extensions, the set based semantics is most flexible and carries furthest. For efficieny reasons, the treatment of hard disjunctive constraints is restricted by an incomplete solver: We shall consider disjunctive constraints as propagators which only emit as many simple constraints ....
Joachim Niehren, Andreas Podelski, and Ralf Treinen. Equational and Membership Constraints for Infinite Trees. In Claude Kirchner, editor, Proceedings of the RTA '93, pp. 106--120, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC