• Corpus ID: 60550056

Toward a mathematical semantics for computer languages

@inproceedings{Scott1971TowardAM,
  title={Toward a mathematical semantics for computer languages},
  author={Dana S. Scott and Christopher S. Strachey},
  year={1971}
}
Compilers for high-level languages aTe generally constructed to give the complete translation of the programs into machme language. As machines merely juggle bit patterns, the concepts of the original language may be lost or at least obscured during this passage. The purpose of a mathematical semantics is to give a correct and meaningful correspondence between programs and mathematical entities in a way that is entirely independent of an implementation. This plan is illustrated in a very… 

The Logic in Computer Science Column Forms of Semantic Speciication

The way to specify a programming language has been a topic of heated debate for some decades and at present there is no consensus on how this is best done; nevertheless, precision is often enough lacking that more formal approaches could beneet both programmers and language implementors.

A Mathematical Definition of Full Prolog

The denotational semantics of a pre-woven language

  • Amjad NusayrZiad Al-Sharif
  • Computer Science
    2016 7th International Conference on Information and Communication Systems (ICICS)
  • 2016
The semantics presented are intended to be a general baseline for the use of any advice in any random joinpoint, and illustrates the a formal description of the mechanism of where and how woven advice is inserted.

A Mathematical Deenition of Full Prolog

The paper provides a mathematical yet simple model for the full programming language Prolog, as apparently intended by the ISO draft standard proposal, and adds to this the ubiquitous box-model debugger.

The Varieties of Programming Language Semantics

  • P. Mosses
  • Computer Science
    Ershov Memorial Conference
  • 2000
This paper surveys the main frameworks available for describing the dynamic semantics of programming languages, and considers practical aspects, such as comprehensibility, modularity, and extensibility, which are especially significant when describing full-scale languages.

A Theory of Type Polymorphism in Programming

  • R. Milner
  • Computer Science
    J. Comput. Syst. Sci.
  • 1978

Semantics and Proof Theory of Pascal Procedures

An investigation of (recursive) procedures with the parameter mechanisms of call-by-value and callrby-variable as occurring in the language PASCAL using the method of denotational semantics and proposing proof rules in the style of HOARE.

Towards a sketch based model of self-interpreters

This thesis attempts the development of a technique to calculate a self-interpreter, an £ interpréter which is itself an C program, for an arbitrary language, as this represents a significant step towards the goal of the automatic dérivation of both partial evaluators and interpreters.

An experiment with denotational semantics

How to systematically design a programming language in 'reverse order', i.e. from denotations to syntax, is shown by a layer-by-layer development of a virtual language Lingua.
...

References

SHOWING 1-10 OF 13 REFERENCES

An Abstract Model for Storage, in preparation

  • An Abstract Model for Storage, in preparation

@BULLET examp~eB of Formal. Semantics

  • @BULLET examp~eB of Formal. Semantics

8J , Lattl-ce-tlleoretic Models for Various Type-free Calculi, in preparation

  • 8J , Lattl-ce-tlleoretic Models for Various Type-free Calculi, in preparation

Fixpoint Induction and Pl'oofs of Program Propel'ties. in Machine Intelligence

  • Fixpoint Induction and Pl'oofs of Program Propel'ties. in Machine Intelligence
  • 1969

Semantio~ of Context-FJ'ee Language8. Mathematical Systems Theory

  • Semantio~ of Context-FJ'ee Language8. Mathematical Systems Theory
  • 1968

Towards a Formal Semantics, in Formal Lan9uage Description Languages

  • Towards a Formal Semantics, in Formal Lan9uage Description Languages
  • 1966

Fixpoint Induction and Pl'oofs of Program Propel'ties

  • Machine Intelligence
  • 1969

@BULLET Data Types a8 Lattices, in preparation

  • @BULLET Data Types a8 Lattices, in preparation

Theo:roy of Computation

  • Proc. of the Fourth Annual Princeton Conference on Information 5cieflces and Systems
  • 1970

6J The Lattice of Fl.ow Diagrams, in [1]

  • 6J The Lattice of Fl.ow Diagrams, in [1]