Tim Freeman
- AC90 Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. Research Report 62, Digital Systems Research Center, Palo Alto, California, August 1990.Google Scholar
- BCM+90 J. R. Butch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 428-439, Philadelphia, PA, June 1990. IEEE Computer Society Press.Google Scholar
- Bry86 Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677- 691, August 1986. Google ScholarDigital Library
- Car89 Luca Cardelli. Typeful programming. Research Report 45, Digital Equipment Corporation, Systems Research Center, Palo Alto, California, February 1989.Google Scholar
- CCHO89 Peter Canning, William Cook, Waiter Hill, and Waiter Olthoff. F-bounded polymorphism for object-oriented programming. In Functional Programming Languages and Computer Avchztectuve. ACM, 1989. Google ScholarDigital Library
- CDDK86 Dominique Clement, Jo{lle Despeyroux, Thierry Despeyroux, and Gilles Kahn. A simple applicative language: Mini-ML. In Proceedings of the 1986 Conference on LISP and Functional Programming. ACM Press, 1986. Google ScholarDigital Library
- CW85 Luca Cardelli and Peter Wether. On understanding types, data abstraction, and polymorphism. A CM Computing Surveys, 17:471-522, 1985. Google ScholarDigital Library
- GS84 Ferenc G~cseg and Magnus Steinby. Tree Automata. Akad~miai Kiad6, Budapest, 1984.Google Scholar
- HJ90 Nevin Heintze and Joxan Jaffar. A decision procedure for a class of set constraints. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, Ph,ladelphia. IEEE, June 1990.Google ScholarCross Ref
- KTU89 A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. Type-checking in the presence of polymorphic recursion. To appear in TOPLA$, October 1989. Google ScholarDigital Library
- Mis84 Prateek Mishra. Towards a theory of types in Prolog. In Irttevnational Symposium on Logic Programming, pages 289-298. IEEE, 1984.Google Scholar
- MTH90 Robin Milner, Mads Torte, and Robert Harper. The Defimiior~ of S~andard ML. MIT Press, Cambridge, Massachusetts, 1990. Google ScholarDigital Library
- Myc84 Alan Mycroft. Polymorphic Type Schemes and Recuvsive Definitions, pages 217-228. International Symposium on Programming. Springer-Verlag, New York, 1984. LNCS 167. Google ScholarDigital Library
- Pie89 Benjamin Pierce. A decision procedure for the subtype relation on intersection types with bounded variables. Technical Report CMU-CS-89-169, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, September 1989.Google Scholar
- Pie90 Benjamin C. Pierce. Preliminary investigation of a calculus with intersection and union types. Unpublished manuscript, June 1990.Google Scholar
- RDR88 Simone Ronchi Della Rocca. Principal type scheme and unification for intersection type discipline. Theoretical Computer Science, 59:181-209, 1988. Google ScholarDigital Library
- Rey88 John C. Reynolds. Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, Carnegie Mellon University, Pittsburgh, Pennsylvania, June 1988.Google Scholar
- YFS91 Eyal Yardeni, Thorn Fruehwirth, and Ehud Shapiro. Polymorphically typed logic programs. In Frank Pfenning, editor, Types in Logic Programming. MIT Press, Cambridge, Massachusetts, 1991. To appear.Google Scholar
Index Terms
- Refinement types for ML
Recommendations
Quality Meshing with Weighted Delaunay Refinement
Delaunay meshes with bounded circumradius to shortest edge length ratio have been proposed in the past for quality meshing. The only poor quality tetrahedra, called slivers, that can occur in such a mesh can be eliminated by the sliver exudation ...
Block-balanced meshes in iterative uniform refinement
In this paper we study and delimit a property of known four triangle subdivisions that is useful in tri to quad mesh conversion methods. We provide both theoretical results and empirical evidence showing that iterative application of the four triangles ...
Comments