Results 251 to 260 of about 432,853 (282)

Cognitive abstraction increases prosociality when loyalty is valued lowly, but decreases prosociality when loyalty is valued highly. [PDF]

Sci Rep
van Houwelingen G, van Dijke M.
europepmc   +1 more source

Molecular computation at equilibrium via programmable entropy. [PDF]

Sci Adv
Wang B, Chalk C, Doty D, Soloveichik D.
europepmc   +1 more source

Stroke coordinators perceived roles, responsibilities, & resources: Florida Stroke Registry insights. [PDF]

Int J Nurs Stud Adv
Sessa J, Bishop L, Gutierrez CM, Gardener H, Krigman J, Ampie C, Butler V, Bolling A, Fakoori F, Hylton T, Sobczak E, Asdaghi N, Rundek T, Romano JG, Gordon Perue G, Florida Stroke Registry.   +15 more
europepmc   +1 more source

Machine Learning Model to Predict Postmastectomy Breast Reconstruction Complications.

JAMA Netw Open
Shaheen MS, McManus BT, Cullen CM, Chen JS, Momeni A, Kuo CF, Tsai PH, Chung KC.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Full Abstraction for Signal Flow Graphs

ACM SIGPLAN Notices, 2015
Network theory uses the string diagrammatic language of monoidal categories to study graphical structures formally, eschewing specialised translations into intermediate formalisms. Recently, there has been a concerted research focus on developing a network theoretic approach to signal flow graphs, which are classical structures in control theory ...
Filippo Bonchi, Paweł Sobociński, Fabio Zanasi   +2 more
exaly   +5 more sources

The Full Abstraction Problem

2006
exaly   +2 more sources

Full abstraction for GAMMA

Proceedings of the Fifth Mexican International Conference in Computer Science, 2004. ENC 2004., 2004
Gamma is a simple, but powerful, parallel programming language. Its only data structure is the multiset or bag. Banatre and Metayer proposed the language as a means to derive systematically programs in the spirit of Dijkstra's discipline of programming.
openaire   +1 more source

Observable sequentiality and full abstraction

Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92, 1992
One of the major challenges in denotational semantics is the construction of fully abstract models for sequential programming languages. For the past fifteen years, research on this problem has focused on developing models for PCF, an idealized functional programming language based on the typed lambda calculus.
Robert Cartwright, Matthias Felleisen
openaire   +1 more source

The Full Abstraction Problem

1993
After having studied CDS0 in the previous chapter, we return to a more classical programming language, where basic and functional data are different in behaviour: there are programs computing basic values, and procedures that cannot be evaluated by themselves, but only as part of a program. We focus on the language PCF, which is a typed λ-calculus with
openaire   +1 more source