© University of Kent - Contact | Feedback | Legal | FOI | Cookies
The sigma-semantics: A comprehensive semantics for functional programs
Olaf Chitil
AIB 96-07, RWTH Aachen, May 1996 Pre-version of the Fundamenta Informaticae paper.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.
Download publication 448 kbytes (PDF)Bibtex Record
@techreport{1909, author = {Olaf Chitil}, title = {The Sigma-Semantics: A Comprehensive Semantics for Functional Programs}, month = {May}, year = {1996}, pages = {182-196}, keywords = {determinacy analysis, Craig interpolants}, note = {Pre-version of the Fundamenta Informaticae paper.}, doi = {}, url = {http://www.cs.kent.ac.uk/pubs/1996/1909}, publication_type = {techreport}, submission_id = {23977_1083682425}, other_year = {1996}, institution = {RWTH Aachen}, type = {AIB}, number = {96-07}, }