Results 251 to 260 of about 230,472 (297)
Case - Renal amyloidosis: Adding to the differential of recurrent gross hematuria. [PDF]
Can Urol Assoc JWhitten T, Andrews M, Tompkins K.
europepmc +1 more source
A Case Study and Review of the Literature on IgA Nephropathy in Crohn's Disease. [PDF]
Clin Case RepVazzana GF +6 more
europepmc +1 more source
Probable Renal-Limited Sarcoidosis Presenting With Tubulointerstitial Nephritis Without Granulomas on Renal Biopsy: <i>A diagnostic challenge</i>. [PDF]
Sultan Qaboos Univ Med JAlNoumani JH +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A Calculus of Lambda Calculus Contexts
Journal of Automated Reasoning, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mirna Bognar, Roel C. de Vrijer
openaire +1 more source
The differential lambda-calculus
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ehrhard, Thomas, Regnier, Laurent
exaly +5 more sources
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincent van Oostrom +2 more
exaly +5 more sources
2013
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).
Barendregt, H.P. +2 more
openaire +3 more sources
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).
Barendregt, H.P. +2 more
openaire +3 more sources
ACM SIGPLAN Notices, 1972
A lambda calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and function symbols and thus is an abstraction of programming languages such as LISP which permit functions to be passed to or returned from other functions.
openaire +2 more sources
A lambda calculus schema is an expression of the lambda calculus augmented by uninterpreted constant and function symbols and thus is an abstraction of programming languages such as LISP which permit functions to be passed to or returned from other functions.
openaire +2 more sources
An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus.
Inf. Process. Lett., 2002We show that any \(\lambda\)-model gives rise to a \(\lambda \mu\)-model, in the sense that if we have \(M=_{\lambda \mu}N\) in the equational theory of type free \(\lambda \mu\)-calculus then \([[M]]=_{D}[[N]]\) holds true for some structure \(\langle [[-]],D\rangle\) induced from a \(\lambda\)-model.
openaire +1 more source
Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2003
In this short and elegant article, the \(\lambda Y\) calculus, which extends the simply typed \(\lambda\)-calculus by the fixed-point combinator \(Y\) of type \((A \to A) \to A\) for any type \(A\), is investigated. The following theorems are shown: (1) Higher-type fixed-point combinators are not definable from lower-type fixed-point combinators.
openaire +3 more sources
In this short and elegant article, the \(\lambda Y\) calculus, which extends the simply typed \(\lambda\)-calculus by the fixed-point combinator \(Y\) of type \((A \to A) \to A\) for any type \(A\), is investigated. The following theorems are shown: (1) Higher-type fixed-point combinators are not definable from lower-type fixed-point combinators.
openaire +3 more sources