Results 221 to 230 of about 4,940,107 (249)

YBX1 Expression Marks Proliferative Tumour States with Context-Dependent Genomic Instability: A Pan-Cancer Analysis. [PDF]

open access: yesInt J Mol Sci
Wang S   +8 more
europepmc   +1 more source
Some of the next articles are maybe not open access.

Related searches:

"Type" is not a type

Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86, 1986
A function has a dependent type when the type of its result depends upon the value of its argument. Dependent types originated in the type theory of intuitionistic mathematics and have reappeared independently in programming languages such as CLU, Pebble, and Russell.
Albert R. Meyer, Mark B. Reinhold
openaire   +1 more source

Type checking type classes

Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93, 1993
We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement.
Tobias Nipkow, Christian Prehofer
openaire   +1 more source

Types of neutralization and types of delinquency

Journal of Youth and Adolescence, 1983
Neutralization theory was tested with questionnaires administered to a random sample of public school students (N=298) and institutionalized male delinquents (N=53). Nye-Short delinquency items were factor analyzed to yield three dimensions of delinquency (Predatory, Minor, and Aggressive), and each of the five techniques of neutralization was scored ...
J, Mitchell, R A, Dodder
openaire   +2 more sources

Soft typing with conditional types

Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94, 1994
We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and ...
Alexander Aiken   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy