The Sigma-Semantics: A Comprehensive Semantics for Functional Programs

Chitil, Olaf (1997) The Sigma-Semantics: A Comprehensive Semantics for Functional Programs. Fundamenta Informaticae, 31 . pp. 253-294. (Full text available)

PDF
Download (429kB)
[img]
Preview

Abstract

A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every function and parameterizing the semantics by this choice we abstract from the parameter-passing mechanism. Thus common and distinguishing features of all instances of the sigma-semantics, especially call-by-value and call-by-name semantics, are highlighted. Furthermore, a property can be validated for all instances of the sigma-semantics by a single proof. This is employed for proving the equivalence of the given denotational (fixed-point based) and two operational (reduction based) definitions of the sigma-semantics. We present and apply means for very simple proofs of equivalence with the denotational sigma-semantics for a large class of reduction-based sigma-semantics. Our basis are simple first-order constructor-based functional programs with patterns.

Item Type: Article
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Mark Wheadon
Date Deposited: 22 Jul 2009 18:11
Last Modified: 06 Sep 2011 03:53
Resource URI: http://kar.kent.ac.uk/id/eprint/21421 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year