Disentangling Denotational Semantics Definitions

نویسندگان

  • Fabio Tirelo
  • Roberto da Silva Bigonha
  • João Saraiva
چکیده

Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equations in a definition may have to be aware of unrelated constructs semantics. Current approaches for modularity in this formalism do not address this problem, providing, for this reason, tangled semantic definitions. This paper proposes an incremental approach for denotational semantic specifications, in which each step can either add new features or adapt existing equations, by means of a formal language based on function transformation and aspect weaving.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interpreter prototypes from formal language definitions

Denotational semantics is now used widely for the formal definition of programming languages but there is a lack of appropriate tools to support language development. General purpose language implementation systems are oriented to syntax with poor support for semantics. Specialised denotational semantics based systems correspond closely to the formalism but are rendered inflexible for language ...

متن کامل

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

The rewriting logic semantics project

Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding their respective limitations and allowing succinct semantic definitions. The fact that a rewrite logic theory’s axioms include both equations and rewrite rules provides a useful “abstraction dial” to find the right balan...

متن کامل

Computational Adequacy via "Mixed" Inductive Definitions

For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance proofs of correspondence between operational and denotational semantics or be tween two di erent denotational semantics often depend upon the exis tence of relations speci ed as the xed point of non monotonic operators This paper describes a new approach to constructing such relations...

متن کامل

From Mathematical Functions to Syntax

@article{gdp:lcf-as-pl, author={Plotkin, G. D.}, title={LCF Considered as a Programming Language}, journal={Theoretical Computer Science}, pages={223--255}, year=1977 } Summary: Plotkin investigates the relation between the denotational and the operational semantics of a programming language. As a working example, he picks PCF a language based on Scott’s Logic of Computable Functions. He demons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2008