Fully abstract models of typed λ-calculi

نویسندگان

چکیده

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

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

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

منابع مشابه

Model-Checking Games for Typed λ-Calculi

We consider the transfer of verification techniques to structures with binding.

متن کامل

Stochastic λ-calculi: An extended abstract

Article history: Received 20 February 2014 Accepted 25 March 2014 Available online xxxx

متن کامل

Categorical Models for Simply Typed Resource Calculi

We introduce the notion of differential λ-category as an extension of Blute-Cockett-Seely’s differential Cartesian categories. We prove that differential λ-categories can be used to model the simply typed versions of: (i) the differential λ-calculus, a λ-calculus extended with a syntactic derivative operator; (ii) the resource calculus, a non-lazy axiomatisation of Boudol’s λ-calculus with mult...

متن کامل

Typed lambda calculi and possible worlds models

Course overview (current plan; adjustable) i. Typed lambda calculi and possible worlds models ii. Alternative approaches to meaning iii. Grounded language understanding iv. Question answering: Grounding in databases v. Stochastic lambda calculus vi. Distributional approaches to word meanings vii. Composition in vector-space models 1: tensors viii. Composition in vector-space models 2: recursive...

متن کامل

Kripke resource models of a dependently - typed , bunched λ - calculus ( extended abstract )

The λΛ-calculus is a dependent type theory with both linear and intuitionistic dependent function spaces. It can be seen to arise in two ways. Firstly, in logical frameworks, where it is the language of the RLF logical framework and can uniformly represent linear and other relevant logics. Secondly, it is a presentation of the proof-objects of BI, the logic of bunched implications. BI is a logi...

متن کامل

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


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

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1977

ISSN: 0304-3975

DOI: 10.1016/0304-3975(77)90053-6