Parametricity and unboxing with unpointed types

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1058, Issue , 1996, Pages 204-218

  Launchbury, John ^a   Paterson, Ross ^b  

^a OREGON HEALTH AND SCIENCE UNIVERSITY   (United States)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EVALUATION ORDER; HASKELL; KEEP TRACK OF; LAZY FUNCTIONAL LANGUAGES; PARAMETRICITY; UNBOXING;

ARTIFICIAL INTELLIGENCE;

EID: 84947938412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61055-3_38     Document Type: Conference Paper

References (17)

1. Andrew A. Appel. Compiling with Continuations. Cambridge University Press, 1992.
2. Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. MIT Press, 1992.
3. Fritz Henglein and J. Jørgensen. Formally optimal boxing. In 21st ACM Symp. on Principles of Programming Languages, pages 213-226, Portland, OR, January 1994.
4. Brian T. Howard. Inductive, projective, and pointed types. In ACM Int. Conf. on Functional Programming, Philadelphia, May 1996.
5. Paul Hudak, Simon Peyton Jones, Philip Wadler, et al. Report on the programming language Haskell, a non-strict purely functional language (Version 1. 2). SIG-PLAN Notices, 27(5), March 1992.
6. Stefan Kaes. Parametric overloading in polymorphic programming languages. In 2nd European Symp. on Programming, volume 300 of Lecture Notes in Computer Science, pages 131-144. Springer, 1988.
7. Xavier Leroy. Unboxed objects and polymorphic typing. In 19th ACM Symp. on Principles of Programming Languages, pages 177-188, Albuquerque, NM, January 1992.
8. Ross Paterson. Compiling laziness using projections, October 1995. Draft.
9. Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Conf. on Functional Programming Languages and Computer Architecture, pages 636-666, Cambridge, MA, 1991.
10. Andrew M. Pitts. Relational properties of domains. Information and Computation, to appear, 1996.
11. John C. Reynolds. Types, abstraction and parametric polymorphism. In Information Processing 83, pages 513-523. Elsevier, 1983.
12. David A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, 1986.
13. Mike B. Smyth and Gordon D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM Journal on Computing, 11(4):761-783, 1982.
14. Peter J. Thiemann. Unboxed values and polymorphic typing revisited. In Conf. on Functional Programming Languages and Computer Architecture'95, pages 24-35, June 1995.
15. Philip Wadler. Theorems for free! In 4th Conf. on Functional Programming Languages and Computer Architecture, pages 347-359. IFIP, 1989.
16. Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad-hoc. In 16th ACM Symp. on Principles of Programming Languages, pages 60-76, 1989.
17. Philip Wadler and John Hughes. Projections for strictness analysis. In Conf. on Functional Programming Languages and Computer Architecture, volume 274 of Lecture Notes in Computer Science, Portland, OR, 1987.