Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1988: Foundations of Software Technology and Theoretical Computer Science pp 250–269Cite as

A natural deduction treatment of operational semantics

  • Session 8 Invited Talk
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 338))

Abstract

We show how Natural Deduction extended with a replacement operator can provide a framework for defining programming languages, a framework which is more expressive than the usual Operational Semantics presentation in that it allows hypothetical premises. This allows us to do without an explicit environment and store. Instead we use the hypothetical premises to make assumptions about the values of variables. We define the extended Natural Deduction logic using the Edinburgh Logical Framework.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Avron, A., Honsell, F, Mason, I, (1987) Using Typed Lambda Calculus to Implement Formal Systems on a Machine, Report LFCS87-31, Comp. Sci Dept. Edinburgh Univ. UK

    Google Scholar 

  • Kahn, G. (1987) Natural Semantics, Rapport de Recherche N. 601, INRIA, France

    Google Scholar 

  • Harper, R., Honsell, F., Plotkin, G. (1987) A Framework for Defining Logics, Proceedings of the Second Annual Conference on Logic in Computer Science, Cornell, USA

    Google Scholar 

  • Landin, P.J. (1964) The Mechanical Evaluation of Expressions, Computer Journal, 6.

    Google Scholar 

  • Mason, I. (1987) Hoare's Logic in the LF, Report LFCS-87-32, Comp. Science Dept. Edinburgh University, UK

    Google Scholar 

  • Plotkin, G.(1981) A Structural Approach to Operational Semantics, DAIMI FN-19, Computer Science Department,Aarhus University, Denmark

    Google Scholar 

  • Prawitz, D. (1965) Natural Deduction: A Proof-Theoretic study, Almqvist & Wiksel, Stockholm

    Google Scholar 

  • Reynolds J.C. (1978) Syntactic Control of Interference, 5th Annual Symp. on Principles Of Prog. Langs., Tucson, ACM

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computer Science, Edinburgh University, JCMB, King'sBdgs., Mayfield Rd., EH9 3JZ, Edinburgh

    Rod Burstall

  2. Dipartimento di Informatica, Universita di Torino, Corso Svizzeria 185, Torino, Italy

    Furio Honsell

Authors
  1. Rod Burstall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Furio Honsell
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Kesav V. Nori Sanjeev Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burstall, R., Honsell, F. (1988). A natural deduction treatment of operational semantics. In: Nori, K.V., Kumar, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1988. Lecture Notes in Computer Science, vol 338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50517-2_85

Download citation

  • DOI: https://doi.org/10.1007/3-540-50517-2_85

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50517-4

  • Online ISBN: 978-3-540-46030-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation