Unboxed values as first class citizens in a non-strict functional language

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

Volumn 523 LNCS, Issue , 1991, Pages 636-666

  Peyton Jones, Simon L ^a   Launchbury, John ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; MEMORY ARCHITECTURE; PROGRAM COMPILERS; SEMANTICS;

ALGEBRAIC DATA-TYPES; CODE GENERATORS; DYNAMIC SEMANTIC; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; NEW APPROACHES; PROGRAM TRANSFORMATIONS; STRICTNESS ANALYSIS;

FUNCTIONAL PROGRAMMING;

EID: 84974434216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540543961_30     Document Type: Conference Paper

References (21)

1. AW Appel, “Runtime tags aren’t necessary,” CS-TR-142-88, Department of Computer Science, Princeton University.
2. AW Appel & T Jim, “Continuation-passing, closure-passing, style,” in Proc ACM Conference on Principles of Programming Languages, ACM, 293–302.
3. TH Brus, MCJD van Eckelen, MO van Leer & MJ Plasmeijer, “Clean — a language for functional graph rewriting,” in Functional programming languages and computer architecture, Portland, G Kahn, ed., LNCS 274, Springer Verlag, 364–384.
4. LMM Damas & R Milner, “Principal type schemes for functional programs,” in POPL, 207–212.
5. P Fradet & D Le Metayer, “Compilation of functional languages by program transformation,” IRISA, Campus de Beaulieu, Rennes.
6. P Fradet & D Le Metayer, “Compilation of lambda-calculus into functional machine code,” INRIA.
7. , in Abstract Interpretation of Declarative Languages, C Hankin & S Abramsky, eds., Ellis Horwood, Chichester, 246–265.
8. P Hudak, PL Wadler, Arvind D, B Boutel, J Fairbairn, J Fasel, K Hammond, J Hughes, T Johnsson, R Kieburtz, RS Nikhil, SL Peyton Jones, M Reeve, D Wise & J Young, “Report on the functional programming language Haskell,” Department of Computing Science, Glasgow University.
9. R Kelsey, “Compilation by program transformation,” YALEU/DCS/RR-702, PhD thesis, Department of Computer Science, Yale University.
10. DA Kranz, “ORBIT — an optimising compiler for Scheme,” PhD thesis, Department of Computer Science, Yale University.
11. X Leroy, “Efficient data representations in polymorphic languages,” INRIA Research Report 1264, Rocquencourt.
12. E Moggi, “Computational lambda calculus and monads,” in Logic in Computer Science, California, IEEE.
13. J Peterson, “Untagged data in tagged environments: choosing optimal representations at compile time,” in Functional Programming Languages and Computer Architecture, London, Addison Wesley, 89–99.
14. SL Peyton Jones, The implementation of functional programming languages, Prentice Hall.
15. SL Peyton Jones, “The Spineless Tagless G-machine: a second attempt,” Department of Computing Science, University of Glasgow.
16. SL Peyton Jones & Jon Salkild, “The Spineless Tagless G-machine,” in Functional Programming Languages and Computer Architecture, D Mac-Queen, ed., Addison Wesley.
17. DA Schmidt, Denotational semantics: a methodology for language development, Allyn and Bacon.
18. MB Smyth & GD Plotkin, “The category-theoretic solution of recursive domain equations,” SIAM Journal of Computing 11, 761–783.
19. GL Steele, “Rabbit: a compiler for Scheme,” AI-TR-474, MIT Lab for Computer Science.
20. SR Thatte, “Coercive type equivalence,” Department of Maths and Computer Science, Clarkson University NY.
21. P Wadler, “Deforestation: transforming programs to eliminate trees,” Theoretical Computer Science 73, 231–248.