Ensuring streams flow

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

Volumn 1349, Issue , 1997, Pages 509-523

  Telford, Alastair ^a   Turner, David ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; SOFTWARE ENGINEERING; SYNTACTICS;

ABSTRACT INTERPRETATIONS; CALCULUS OF CONSTRUCTION; COINDUCTIVE TYPES; FUNCTIONAL LANGUAGES; SYNTACTIC ANALYSIS; TYPE THEORY;

FUNCTIONAL PROGRAMMING;

EID: 84947928572     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0000493     Document Type: Conference Paper

References (25)

1. The Coq project. World Wide Web page by INRIA and CNRS, France, 1996. URL: http://pauillac.inria.fr/~coq/coq-eng.html.
2. T. Coquand. Infinite objects in type theory. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programs (TYPES ’93), volume 806 of Lecture Notes in Computer Science, pages 62-78. Springer-Verlag, 1993.
3. P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages, pages 83-94. ACM press, 1992.
4. E.W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976.
5. E. Giménez. Codifying guarded definitions with recursive schemes. In P. Dybjer, B. Nordström, and J. Smith, editors, Types for Proofs and Programs (TYPES ’94), volume 996 of Lecture Notes in Computer Science, pages 39-59. Springer-Verlag, 1995. International workshop, TYPES ’94 held in June 1994.
6. J.R. Hindley. The principal type scheme of an object in combinatory logic. Transactions of the American Mathematical Society, 146:29-60, 1969.
7. R.J.M. Hughes. Backwards analysis of functional programs. In D. Bjørner, A.P. Ershov, and N.D. Jones, editors, Partial Evaluation and Mixed Computation, pages 187-208. Elsevier Science Publishers B.V. (North-Holland), 1988.
8. R.J.M. Hughes. Compile-time analysis of functional programs. In Turner [23], pages 117-155.
9. R.J.M. Hughes. Why functional programming matters. In Turner [23], pages 17-42.
10. S. Kamin. Head-strictness is not a monotonic abstract property. Information Processing Letters, 41(4):195-198, 1992.
11. P. Martin-Löf. An intuitionistic theory of types: predicative part. In H.E. Rose and J.C. Shepherdson, editors, Proceedings of the Logic Colloquium, Bristol, July 1973. North Holland, 1975.
12. D. McAllester and K. Arkoudas. Walther recursion. In M.A. Robbie and J.K, Slaney, editors, 13th Conference on Automated Deduction (CADE 13), volume 1104 of Lecture Notes in Computer Science, pages 643-657. Springer-Verlag, 1996.
13. P.F. Mendler, P. Panangaden, and R.L. Constable. Infinite objects in type theory. Technical Report TR 86-743, Department of Computer Science, Cornell University, Ithaca, NY 14853, 1987.
14. A.J.R.G. Milner. Theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348-375, 1978.
15. A.J.R.G. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
16. L.C. Paulson. ML for the Working Programmer. Cambridge University Press, second edition, July 1996.
17. J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, Netherlands, CWI, PO Box 94079, 1090 GB Amsterdam, The Netherlands, 1996.
18. B.A. Sijtsma. On the productivity of recursive list definitions. ACM Transactions on Programming Languages and Systems, 11(4):633-649, October 1989.
19. A.J. Telford and D.A. Turner. Ensuring the productivity of infinite structures. Technical report, University of Kent at Canterbury, 1997.
20. S.J. Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991.
21. S.J. Thompson. Haskell: The Craft of Functional Programming. Addison-Wesley, 1996.
22. D.A. Turner. Miranda: A non-strict functional language with polymorphic types. In J.P. Jouannaud, editor, Proceedings IFIP International Conference on Functional Programming Languages and Computer Architecture, volume 201 of Lecture Notes in Computer Science. Springer-Verlag, September 1985.
23. D.A. Turner, editor. Research Topics in Functional Programming, University of Texas at Austin Year of Programming Series. Addison-Wesley, 1990.
24. D.A. Turner. Codata. Unpublished technical note (longer article in preparation), February 1995.
25. D.A. Turner. Elementary strong functional programming. In P. Hartel and R. Plasmeijer, editors, FPLE 95, volume 1022 of Lecture Notes in Computer Science. Springer-Verlag, 1995. 1st International Symposium on Functional Programming Languages in Education. Nijmegen, Netherlands, December 4-6, 1995.