Lazy Logical Semantics

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Lazy Logical Semantics

The lazy evaluation of the λ-calculus, both in call-by-name and in call-by-value setting, is studied. Starting from a logical descriptions of two topological models of such calculi, a pre-order relation on terms, stratified by types, is defined, which grasps exactly the two operational semantics we want to model. Such a relation can be used for building two fully abstract models.

متن کامل

Structures for lazy semantics

The paper explores different approaches for modeling the lazy -calculus, which is a paradigmatic language for studying the operational behaviour of programming languages, like Haskell, using a call-by-name and lazy evaluation mechanism. Two models for lazy -calculus in the coherence spaces setting are built. They give a new insight in the behaviour of the language since their local structures a...

متن کامل

Mixed Lazy/Strict Graph Semantics

Explicitly enforcing strictness is often used by functional programmers as an important tool for making applications fit time and space efficiency requirements. Few functional programmers however, are familiar with the consequences of explicitly enforcing strictness for formal reasoning about their programs. Some “folklore” knowledge has emerged but this is based on experience rather than on ri...

متن کامل

Generating Power of Lazy Semantics

We discuss the use of the lazy evaluation scheme as coding tool in some algebraic manipulations. We show | on several examples | how to process the innnite power series or other open-ended data structures with co-recurrent algorithms, which simplify enormously the coding of recurrence relations or solving equations in the power series domain. The important point is not the \innnite" length of t...

متن کامل

Proving Lazy Folklore with Mixed Lazy/strict Semantics

Abstract. Explicit enforcement of strictness is used by functional programmers for many different purposes. Few functional programmers, however, are aware that explicitly enforcing strictness has serious consequences for (formal) reasoning about their programs. Some vague “folklore” knowledge has emerged concerning the correspondence between lazy and strict evaluation but this is based on exper...

متن کامل

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


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

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2004

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2004.10.003