Results 221 to 230 of about 4,649,595 (248)
Some of the next articles are maybe not open access.
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
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
ACM SIGPLAN Lisp Pointers, 1992
We propose a projective lambda calculus as the basis for operations on records. Projections operate on elevations, that is, records with defaults. This calculus extends lambda calculus while keeping its essential properties. We build projective ML from this calculus by adding the ML Let typing rule to the simply typed projective calculus.
openaire +1 more source
We propose a projective lambda calculus as the basis for operations on records. Projections operate on elevations, that is, records with defaults. This calculus extends lambda calculus while keeping its essential properties. We build projective ML from this calculus by adding the ML Let typing rule to the simply typed projective calculus.
openaire +1 more source
A Framework for MLS Interoperability
Proceedings. IEEE High-Assurance Systems Engineering Workshop (Cat. No.96TB100076), 1996Distributed object oriented computing (DOC) is a new computing paradigm that promotes component based development, location independence, scalability, software reuse, etc. Users of multilevel security (MLS) technology want to take advantage of these new technologies However, the process of incorporating new technologies into MLS products is slower than
Myong H. Kang +2 more
openaire +1 more source
ACM SIGPLAN Notices, 1996
We believe that the most pressing problem in programming-language design is to control the interference that arises when functional and imperative programming are combined, and to give the user more control of storage allocation, without sacrificing the virtues of higher-order procedures, rigorous typing, and modularity that characterize ML.
openaire +1 more source
We believe that the most pressing problem in programming-language design is to control the interference that arises when functional and imperative programming are combined, and to give the user more control of storage allocation, without sacrificing the virtues of higher-order procedures, rigorous typing, and modularity that characterize ML.
openaire +1 more source
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '97, 1997
Objective ML is a small practical extension of ML with objects and toplevel classes. It is fully compatible with ML; its type system is based on ML polymorphism, record types with polymorphic access, and a better treatment of type abbreviations. Objective ML allows for most features of object-oriented languages including multiple inheritance, methods ...
Didier Rémy, Jerome Vouillon
openaire +1 more source
Objective ML is a small practical extension of ML with objects and toplevel classes. It is fully compatible with ML; its type system is based on ML polymorphism, record types with polymorphic access, and a better treatment of type abbreviations. Objective ML allows for most features of object-oriented languages including multiple inheritance, methods ...
Didier Rémy, Jerome Vouillon
openaire +1 more source
ML for ML: Learning Cost Semantics by Experiment
2017It is an open problem in static resource bound analysis to connect high-level resource bounds with the actual execution time and memory usage of compiled machine code. This paper proposes to use machine learning to derive a cost model for a high-level source language that approximates the execution cost of compiled programs on a specific hardware ...
Ankush Das, Jan Hoffmann 0002
openaire +1 more source
Efficient parallel programming in Poly/ML and Isabelle/ML
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming, 2010The ML family of languages and LCF-style interactive theorem proving have been closely related from their beginnings about 30 years ago. Here we report on a recent project to adapt both the Poly/ML compiler and the Isabelle theorem prover to current multicore hardware. Checking theories and proofs in typical Isabelle application takes minutes or hours,
David C. J. Matthews, Makarius Wenzel
openaire +1 more source
MLS and trust issues at the user interface in MLS AISs
[1990] Proceedings of the Sixth Annual Computer Security Applications Conference, 2002A critical element in the widespread application of trusted systems is the availability of user interfaces that support efficient access by users to MLS data. The authors look at functional requirements for an MLS user interface, not in terms of what is typically implemented but in terms of user/system interaction. A model of user/system interaction is
William Wilson +3 more
openaire +1 more source
ACM SIGPLAN Notices, 2010
My talk will celebrate Robin Milner's contribution to functional programming via a combination of reminiscences about the early days of ML and speculations about its future.
openaire +1 more source
My talk will celebrate Robin Milner's contribution to functional programming via a combination of reminiscences about the early days of ML and speculations about its future.
openaire +1 more source
2008 IEEE International Symposium on Information Theory, 2008
The ML redundancy of a code is defined as the smallest number of rows in its parity-check matrix such that a message-passing decoder working in the corresponding Tanner graph achieves maximum-likelihood (ML) performance on an erasure channel. General upper bounds on ML redundancy are obtained.
Junsheng Han, Paul H. Siegel
openaire +1 more source
The ML redundancy of a code is defined as the smallest number of rows in its parity-check matrix such that a message-passing decoder working in the corresponding Tanner graph achieves maximum-likelihood (ML) performance on an erasure channel. General upper bounds on ML redundancy are obtained.
Junsheng Han, Paul H. Siegel
openaire +1 more source