When is a functional program not a functional program?

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 1-7

  Longley, John ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPILER OPTIMIZATIONS; FUNCTIONAL LANGUAGES; FUNCTIONAL PROGRAMS; PURELY FUNCTIONAL; REAL NUMBER; SEARCH ALGORITHMS; STANDARD ML;

EID: 17144374100     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317775     Document Type: Article

References (14)

1. A. Bucciarelli and T. Ehrhard. Sequentially and strong stability. In Proc. 6th Annual Symposium on Logic in Computer Science, pages 138-145. IEEE, 1991.
2. T. Ehrhard. Projecting sequential algorithms on strongly stable functions. Annals of Pure and Applied Logic, 77:201-244, 1996.
3. S. Peyton Jones and J. Hughes (eds.). Report on the programming language Haskell 98. Available electronically from www.haskell.org, February 1999.
4. J.R. Longley. The sequentially realizable functionals. Technical Report ECS-LFCS-98-402, Department of Computer Science, University of Edinburgh, 1998. Submitted to Annals of Pure and Applied Logic.
5. J.R. Longley. The sequentially realizable functionals. Technical Report ECS-LFCS-98-402, Department of Computer Science, University of Edinburgh, 1998. Submitted to Annals of Pure and Applied Logic.
6. J.R. Longley. When is a functional program not a functional program?: a walkthrough introduction to the sequentially realizable functionals. ML source file, available from http://www.dcs.ed.ac.uk/hom/jrl/, 1998.
7. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML: revised 1997. MIT Press, 1997.
8. J. van Oosten. A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht, 1997. To appear in Proc. Logic Colloquium, Leeds.
9. J. van Oosten. A combinatory algebra for sequential functionals of finite type. Technical Report 996, University of Utrecht, 1997. To appear in Proc. Logic Colloquium, Leeds.
10. S. Peyton Jones and S. Marlow. Stretching the storage manager: weak pointers and stable names in Haskell. Draft paper, 1999.
11. G.D. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223-255, 1977.
12. D.S. Scott. A type-theoretical alternative to ISWIM, CUCH, OWHY. Theoretical Comp. Sci. , 121:411-440, 1993. First written in 1969 and widely circulated in unpublished form since then.
13. A.K. Simpson. Lazy functional algorithms for exact real functionals. In Mathematical Foundations of Computer Science, pages 456-464. Springer LNCS 1450, 1998.
14. A.K. Simpson. Lazy functional algorithms for exact real functionals. In Mathematical Foundations of Computer Science, pages 456-464. Springer LNCS 1450, 1998.