×

Guarded recursive datatype constructors. (English) Zbl 1321.68161

Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL ’03, New Orleans, LA, USA, January 15–17, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-628-5). 224-235 (2003).

MSC:

68N18 Functional programming and lambda calculus

Software:

TREX
Full Text: DOI

References:

[1] L. Augustsson. Implementing Haskell overloading. In Functional Programming Languages and Computer Architecture, 93.]] 10.1145/165180.165191
[2] K. B. Bruce. Foundations of Object-Oriented Languages. The MIT Press, Cambridge, MA, 2002.]]
[3] C. Chen and H. Xi. Implementing typed meta-programming. Available at http://www.cs.bu.edu/char126hwxi/academic/papers/TMP.ps, November 2002.]]
[4] A. Church. A formulation of the simple type theory of types. Journal of Symbolic Logic, 5:56-68, 1940.]] · JFM 66.1192.06
[5] K. Crary and S. Weirich. Flexible Type Analysis. In Proceedings of International Conference on Functional Programming (ICFP ’99), Paris, France, 1999.]] 10.1145/317636.317906 · Zbl 1345.68085
[6] K. Crary, S. Weirich, and G. Morrisett. Intensional polymorphism in type-erasure semantics. In Proceedings of the International Conference on Functional Programming (ICFP ’98), pages 301-312, Baltimore, MD, September 1998.]] 10.1145/289423.289459 · Zbl 1428.68097
[7] R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. Journal of ACM, 2002.]] 10.1145/382780.382785 · Zbl 1323.68107
[8] C. Dubois, F. Rouaix, and P. Weis. Generic Polymorphism. In Proceeding of the 22th ACM Symposium on Principles of Programming Languages (POPL ’95), pages 118-129, London, UK, January 1995.]] 10.1145/199448.199473
[9] A. Goldenberg and D. Robson. Smalltalk-80: The Language and Its Implementation. Addison Wesley, 1983.]] · Zbl 0518.68001
[10] R. W. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Conference Record of POPL ’95: 22nd ACM SIGPLAN Symposium on Principles of Programming Languages, pages 130-141, San Francisco, 1995.]] 10.1145/199448.199475
[11] K. Läufer and M. Odersky. Ploymorphic Type Inference and Abstract Data Types. ACM Transactions of Programming Languages and Systems (TOPLAS), 16(5):1411-1430, September 1994.]] 10.1145/186025.186031
[12] X. Leroy. Unboxed objects and polymorphic typing. In Conference Record of the Nineteenth Annual ACM SIGPLAN Symposium on Principles of Programming Languages, pages 177-188, Albuquerque, New Mexico, January 1992.]] 10.1145/143165.143205
[13] C. Liu. Smalltalk, Objects, and Design. Manning Publications Co., Greenwich, CT 06830, 1996.]]
[14] R. Milner, M. Tofte, R. W. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, Massachusetts, 1997.]]
[15] M. Neubauer, P. Thiemann, M. Gasbichler, and M. Sperber. A Functional Notation for Functional Dependencies. In Proceedings of 2001 Haskell Workshop, pages 101-120, Florence, Italy, September 2001.]]
[16] A. Ohori and K. Kato. Semantics for communication primitives in a polymorphic language. In Conference Record of the Twentieth Annual ACM SIGPLAN Symposium on Principles of Programming Languages, pages 99-112, Charleston, SC, January 1993.]] 10.1145/158511.158529
[17] S. Peyton Jones et al. Haskell 98 – A non-strict, purely functional language. Available at http://www.haskell.org/onlinereport/, Feb. 1999.]]
[18] F. Pfenning. Computation and Deduction. Cambridge University Press, 2002.]] · Zbl 1008.91001
[19] W. Taha and T. Sheard. MetaML and multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2):211-242, 2000.]] 10.1016/S0304-3975(00)00053-0 · Zbl 0949.68047
[20] A. Tolmach. Tag-free garbage collection using explicit type parameters. In Proceedings of ACM Conference on LISP and Functional Programming, pages 1-11, Orlando, FL, June 1994.]] 10.1145/182409.182411
[21] V. Trifonov, B. Saha, and Z. Shao. Fully Reflexive Intensional Type Analysis. In Proceedings of the International Conference on Functional Programming, September 1999.]] 10.1145/351240.351248 · Zbl 1321.68176
[22] S. Weirich. Encoding intensional type analysis. In D. Sands, editor, Programming Languages and Systems: 10th European Symposium on Programming, ESOP 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001 Genova, Italy, April 2-6, 2001, volume 2028 of Lecture Notes in Computer Science, pages 92-106. Springer, 2001.]] · Zbl 0987.68851
[23] H. Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998. pp. viii+189. Available at http://www.cs.cmu.edu/char126hwxi/DML/thesis.ps.]]
[24] H. Xi, C. Chen, and G. Chen. Guarded Recursive Datatype Constructors, 2002. Available at http://www.cs.bu.edu/char126hwxi/GRecTypecon/.]]
[25] H. Xi and F. Pfenning. Dependent types in practical programming. In Proceedings of ACM SIGPLAN Symposium on Principles of Programming Languages, pages 214-227, San Antonio, Texas, January 1999.]] 10.1145/292540.292560
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.