Ligating with lambda

نویسندگان

چکیده

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

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

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

منابع مشابه

Lambda Calculus with Types

This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author’s classic The Lambda Calculus (1984). The formalism has since been extended with types...

متن کامل

Lambda calculus with patterns

The -calculus is an extension of the -calculus with a pattern matching facility. The form of the argument of a function can be speci ed and hence -calculus is more convenient than ordinary -calculus. We explore the basic theory of -calculus, establishing results such as con uence. In doing so, we nd some requirements for patterns that guarantee con uence. Our work can be seen as giving some fou...

متن کامل

Living With Lambda

The possibility of a nonzero cosmological constant Λ has been entertained several times in the past for theoretical and observational reasons (early work includes e.g. Einstein 1917, Petrosian, Salpeter & Szekeres 1967, Gunn & Tinsley 1975, a popularized description of the history is found in Goldsmith 1997). Recent supernovae results (Perlmutter et al 1998, Riess et al 1998) have made a very s...

متن کامل

Lambda - Calculus with Input -

x Abstract. We introduce an untyped-calculus with input-output, based on Gordon's continuation-passing model of input-output. This calculus is intended to allow the classiication of possibly innnite input-output behaviors, such as those required for servers or distributed systems. We deene two terms to be operationally approximate ii they have similar behaviors in any context. We then deene a n...

متن کامل

An extended type system with lambda-typed lambda-expressions

We present the system d, an extended type system with lambda-typed lambdaexpressions. It is related to type systems originating from the Automath project. d extends existing lambda-typed systems by an existential abstraction operator as well as propositional operators. β-reduction is extended to also normalize negated expressions using a subset of the laws of classical negation, hence d is norm...

متن کامل

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


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

ژورنال

عنوان ژورنال: Nature Chemical Biology

سال: 2016

ISSN: 1552-4450,1552-4469

DOI: 10.1038/nchembio.2033