Results 241 to 250 of about 54,741 (293)
Some of the next articles are maybe not open access.

Related searches:

Mls DETERMINANTS AND ANTI‐Mls RECEPTORS

International Journal of Immunogenetics, 1988
SUMMARYWe review evidence from this laboratory that T cell recognition of Mlsa determinants is not controlled solely by the α‐β T cell receptor (TcR) molecule. We propose a model in which Mlsa recognition reflects a receptor‐ligand interaction between two sets of complementary accessory molecules, one molecule (Mlsa) being expressed on B cells and the ...
S R, Webb, A, Okamoto, J, Sprent
openaire   +2 more sources

Functorial ML

Journal of Functional Programming, 1996
We present an extension of the Hindley–Milner type system that supports a generous class of type constructors called functors, and provide a parametrically polymorphic algorithm for their mapping, i.e. for applying a function to each datum appearing in a value of constructed type.
Gianna Bellè   +2 more
openaire   +6 more sources

ML and beyond

ACM SIGPLAN Notices, 1996
ML is a successful programming language that reconciles theoretical principles with pragmatic requirements. However, there are many shortcomings of the current language and implementations. This short note outlines some promising directions for future work.
Robert Harper 0001, John C. Mitchell
openaire   +2 more sources

Parsers in ML

Proceedings of the 1992 ACM conference on LISP and functional programming, 1992
We present the operational semantics of streams and stream matching as discussed in. Streams are data structures such as lists, but with different primitive operations. Streams not only provide an interface to usual imput/output channels, but may used as a data structure per se , holding any kind of element.
Daniel de Rauglaudre, Michel Mauny
openaire   +1 more source

The essence of ML

Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88, 1988
Standard ML is a useful programming language with polymorphic expressions and a flexible module facility. One notable feature of the expression language is an algorithm which allows type information to be omitted. We study the implicitly-typed expression language by giving a “syntactically isomorphic” explicitly-typed, polymorphic function calculus ...
John C. Mitchell, Robert Harper 0001
openaire   +1 more source

A Tutorial Workshop on ML for Systems and Systems for ML

2023
This is a proposal for the Learned Systems workshop planned for March 7th, 2023 inconjunction with the BTW2023 conference in Dresden. This tutorial-like workshop will bring togetherrenowned researchers and practitioners at the intersection of machine learning and (database) systems.There will be invited/nominated talks on two topics of concern: (1) how
Manisha Luthra   +2 more
openaire   +1 more source

From ML to ML F

ACM SIGPLAN Notices, 2008
ML F is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type inference in both ML or ML F .
Didier Rémy, Boris Yakobowski
openaire   +1 more source

Home - About - Disclaimer - Privacy