Results 251 to 260 of about 283,550 (300)
Three New Null HLA Alleles Were Identified of the Unrelated Bone Marrow Donors. [PDF]
HLALoginova M +3 more
europepmc +1 more source
Characterisation of a Novel HLA-DQA1 Allele by Next Generation Sequencing: HLA-DQA1*01:03:13. [PDF]
HLAShivarov V, Micheva I, Ivanova M.
europepmc +1 more source
A Nationwide Study on Pretransfusion Testing for 10 Years in Korea Using Health Insurance Review and Assessment Claims Data. [PDF]
J Korean Med SciPark JH, Chung Y, Ko DH, Kim H.
europepmc +1 more source
Ribotyping for Accurate Identification of Infectious Bacteria in Animal-Derived Foods and Laboratory Samples: Implications for Human Health. [PDF]
J Trop MedSeyedi ZP +4 more
europepmc +1 more source
An Optically Silent Epoxysilane Chemistry for Paper-Based ABO Blood Typing. [PDF]
Biosensors (Basel)Pipatpanukul C +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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
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
Soft typing with conditional types
Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94, 1994We 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