Results 1  10
of
30
Lambda Calculus with Explicit Recursion
 Information and Computation
, 1996
"... This paper is concerned with the study of calculus with explicit recursion, namely of cyclic graphs. The starting point is to treat a graph as a system of recursion equations involving terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible fo ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
Classification (1991): D.1.1, D.3.1, F.1.1, F.4.1, F.4.2 Keywords & Phrases: lambda cal...
Multiple Units of Transcription in Phage Lambda
"... Phage lambda offers a special advantage for the study of transcription because of the unequal distribution of bases in its DNA. Differences in base composition have permitted the s paration of left and right molecular halves. Using homology tests, one can detect ranscription from either half and stu ..."
Abstract
 Add to MetaCart
Phage lambda offers a special advantage for the study of transcription because of the unequal distribution of bases in its DNA. Differences in base composition have permitted the s paration of left and right molecular halves. Using homology tests, one can detect ranscription from either half
The CallbyNeed Lambda Calculus (Unabridged)
, 1994
"... We present a calculus that captures the operational semantics of callbyneed. We demonstrate that the calculus is confluent and standardizable and entails the same observational equivalences as callbyname lambda calculus. 1 Introduction Procedure calls come in three styles: callbyvalue, callb ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present a calculus that captures the operational semantics of callbyneed. We demonstrate that the calculus is confluent and standardizable and entails the same observational equivalences as callbyname lambda calculus. 1 Introduction Procedure calls come in three styles: callbyvalue, call
Towards the Exploration of FlipFlop Gates
"... Certifiable communication and extreme programming have garnered great interest from both theorists and cyberneticists in the last several years. In our research, we show the study of spreadsheets, which embodies the essential principles of programming languages. Such a claim at first glance seems ..."
Abstract
 Add to MetaCart
unexpected but has ample historical precedence. In order to accomplish this objective, we argue that despite the fact that gigabit switches can be made ambimorphic, flexible, and encrypted, linklevel acknowledgements and lambda calculus can interact to solve this quandary. 1
Origin 2000 Design Enhancements for Communication Intensive Applications \Lambda
"... 1. Each node contains only two processors, thus the shared datais often spread over a large number of nodes. 2. The processor does not snoop the requests of the other local processor, thus remote traffic is generated even when one ..."
Abstract
 Add to MetaCart
1. Each node contains only two processors, thus the shared datais often spread over a large number of nodes. 2. The processor does not snoop the requests of the other local processor, thus remote traffic is generated even when one
Measurements of the Cosmological Parameters \Omega and \Lambda from the First 7 Supernovae at ...
, 1997
"... We have developed a technique to systematically discover and study highredshift supernovae that can be used to measure the cosmological parameters. We report here results based on the initial seven of ?28 supernovae discovered to date in the highredshift supernova search of the Supernova Cosmology ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Cosmology Project. We find an observational dispersion in peak magnitudes of oe MB = 0:27; this dispersion narrows to oe MB ;corr = 0:19 after "correcting" the magnitudes using the lightcurve "widthluminosity" relation found for nearby (z 0:1) type Ia supernovae from the Cal
unknown title
, 2001
"... Item Notation/Lambda Cal
ulus a la de Bruijn For those used to
lassi
al notation, I translates to item notation: I(x) = x; I(x:B) = [x℄I(B); I(AB) = (I(B))I(A) For example, I((x:(y:xy))z) = (z)[x℄[y℄(y)x. The items are (z), [x℄, [y℄ and (y). The appli
ator wagon (z) and abstra
tor wagon [x ℄ ..."
Abstract
 Add to MetaCart
Item Notation/Lambda Cal
ulus a la de Bruijn For those used to
lassi
al notation, I translates to item notation: I(x) = x; I(x:B) = [x℄I(B); I(AB) = (I(B))I(A) For example, I((x:(y:xy))z) = (z)[x℄[y℄(y)x. The items are (z), [x℄, [y℄ and (y). The appli
ator wagon (z) and abstra
tor wagon [x
:zd) )a (a) ( )[y℄[z℄(d)z
, 2001
"... Item Notation/Lambda Cal
ulus a la de Bruijn I translates to item notation: I(x) = x; I(x:B) = [x℄I(B); I(AB) = (I(B))I(A) (x:y:xy)z translates to (z)[x℄[y℄(y)x. The items are (z), [x℄, [y ℄ and (y). The last x is the heart of the term. The appli
ator wagon (z) and abstra
tor wagon [x ℄ o
ur ..."
Abstract
 Add to MetaCart
Item Notation/Lambda Cal
ulus a la de Bruijn I translates to item notation: I(x) = x; I(x:B) = [x℄I(B); I(AB) = (I(B))I(A) (x:y:xy)z translates to (z)[x℄[y℄(y)x. The items are (z), [x℄, [y ℄ and (y). The last x is the heart of the term. The appli
ator wagon (z) and abstra
tor wagon [x ℄ o
Impact and Regulation of Lambda Interferon Response in Human Metapneumovirus Infection
"... Humanmetapneumovirus (hMPV) is a respiratory paramyxovirus that is distributed worldwide and induces significant airway morbidity. Despite the relevance of hMPV as a pathogen, many aspects of the immune response to this virus are still largely unknown. In this report, we focus on the antiviral immu ..."
Abstract
 Add to MetaCart
immune response, which is critical for viral clearance and disease resolution. Using in vitro and in vivo systems, we show that hMPV is able to induce expression of lambda interferon 1 (IFN1), IFN2, IFN3, and IFN4. The induction of IFN expression by hMPVwas dependent on interferon regulatory factor
2013): The Sequential Semantics of Producer Effect Systems
 In: POPL
"... Effects are fundamental to programming languages. Even the lambda calculus has effects, and consequently the two famous evaluation strategies produce different semantics. As such, much research has been done to improve our understanding of effects. Since Moggi introduced monads for his computational ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
computational lambda calculus, further generalizations have been designed to formalize increasingly complex computational effects, such as indexed monads followed by layered monads followed by parameterized monads. This succession prompted us to determine the most general formalization possible. In searching
Results 1  10
of
30