Results 231 to 240 of about 31,361 (278)

Predicting ESWL success for ureteral stones: a radiomics-based machine learning approach. [PDF]

BMC Med Imaging
Yang R, Zhao D, Ye C, Hu M, Qi X, Li Z.
europepmc   +1 more source

Anion exchange chromatographic fractionation of urinary proteins followed by tandem mass spectrometry identifies potential natural inhibitors of calcium oxalate stone. [PDF]

Comput Struct Biotechnol J
Rattananinsruang P, Peerapen P, Detsangiamsak S, Thongboonkerd V.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A Calculus of Lambda Calculus Contexts

Journal of Automated Reasoning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bognar, Mirna, de Vrijer, Roel
openaire   +1 more source

Lambda calculus schemata

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   +1 more source

Lambda Calculus with Types

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., Dekkers, W.J.M., Statman, R.   +2 more
openaire   +2 more sources

Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus

Fundamenta Informaticae, 1997
Lambda abstraction algebras are designed to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order logic; they are intended as an alternative to combinatory algebras in this regard. Like combinatory algebras they can be defined by true identities and thus form a variety in the sense of ...
D. PIGOZZI, SALIBRA, Antonino
openaire   +4 more sources

The Lambda Lambda-Bar calculus

Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2013
We present a calculus which combines a simple, CCS-like representation of finite behaviors, with two dual binders λ and λ¯. Infinite behaviors are obtained through a syntactical fixed-point operator, which is used to give a translation of λ-terms. The duality of the calculus makes the roles of a function and its environment symmetrical.
openaire   +1 more source

Lambda calculus

2018
The lambda calculus presents a delimited formal setting for expressing and studying properties of mathematical operations and computer programs. Its syntactical unit is the term. Application terms tu represent supplying argument u to routine t. Abstraction terms λx.
openaire   +1 more source

Infinite \(\lambda\)-calculus and types

1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ALESSANDRO BERARDUCCI, DEZANI, Mariangiola   +1 more
openaire   +3 more sources

Computational lambda-calculus and monads

[1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science, 2003
The lambda -calculus is considered a useful mathematical tool in the study of programming languages. However, if one uses beta eta -conversion to prove equivalence of programs, then a gross simplification is introduced. The author gives a calculus based on a categorical semantics for computations, which provides a correct basis for proving equivalence ...
openaire   +1 more source