Ensuring Termination in ESFP

@article{Telford2000EnsuringTI,
  title={Ensuring Termination in ESFP},
  author={Alastair J. Telford and David Turner},
  journal={J. UCS},
  year={2000},
  volume={6},
  pages={474-488}
}
In previous papers we have proposed an elementary discipline of strong functional programming (ESFP), in which all computations terminate. A key feature of the discipline is that we introduce a type distinction between data which is known to be nite, and codata which is (potentially) in nite. To ensure termination, recursion over data must be well-founded, and corecursion (the de nition schema for codata) must be productive, and both of these restrictions must be enforced automatically by the… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 28 references

A Hierarchy of Languages with Strong Termination Properties

  • A. J. Telford, D. A. Turner
  • Technical Report TR 2-00,
  • 2000
Highly Influential
6 Excerpts

Theory of type polymorphism in programming

  • A.J.R.G. Milner
  • Journal of Computer and System Sciences, 17(3…
  • 1978
Highly Influential
4 Excerpts

Haskell 98: A non-strict, purely functional language

  • S. L. Peyton Jones, R.J.M. Hughes
  • WWW page,
  • 1999
1 Excerpt

Foetus - termination checker for simple functional programs

  • A. Abel
  • World Wide Web page
  • 1998
1 Excerpt

TFL: An environment for terminating functional programs

  • K. Slind
  • WWW page
  • 1998
1 Excerpt

Ensuring the productivity of in nite structures

  • A. J. Telford, D. A. Turner
  • Technical Report 14-97, University of Kent at…
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…