Skip to main content
    • Aa
    • Aa

Note on Algol and conservatively extending functional programming

  • Peter W. O'Hearn (a1)

A simple Idealized Algol is considered, based on Reynolds's ‘essence of Algol’. It is shown that observational equivalence in this language conservatively extends observational equivalence in its assignment-free functional sublanguage.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

R. Milner 1977. Fully abstract models of typed λ-calculi. Theoretical Computer Science, 4, 122.

M. Odersky , D. Rabin and P. Hudak 1993. Call-by-name, assignment, and the λ-calculus. In: Conf. Record 20th ACM Symp. on Principles of Programming Languages. Charleston, South Carolina: ACM, New York.

G. D. Plotkin 1977. LCF considered as a programming language. Theoretical Computer Science, 5, 223255.

R. D. Tennent 1989. Elementary data structures in Algol-like languages. Science of Computer Programming, 13, 73110.

R. D. Tennent 1990. Semantical analysis of specification logic. Information and Computation, 85 (2), 135162.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 0
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 32 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th May 2017. This data will be updated every 24 hours.