Filters








464 Hits in 4.3 sec

A comparative study of language support for generic programming

Ronald Garcia, Jaakko Jarvi, Andrew Lumsdaine, Jeremy Siek, Jeremiah Willcock
2003 SIGPLAN notices  
This paper reports on a comprehensive comparison of generics in six programming languages: C ++ , Standard ML, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#.  ...  As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for  ...  Acknowledgments This work was supported by NSF grants EIA-0131354 and ACI-0219884, and by a grant from the Lilly Endowment.  ... 
doi:10.1145/949343.949317 fatcat:obtgheemvfdxtkfp7j4v56sasu

A comparative study of language support for generic programming

Ronald Garcia, Jaakko Jarvi, Andrew Lumsdaine, Jeremy Siek, Jeremiah Willcock
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
This paper reports on a comprehensive comparison of generics in six programming languages: C ++ , Standard ML, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#.  ...  As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for  ...  Acknowledgments This work was supported by NSF grants EIA-0131354 and ACI-0219884, and by a grant from the Lilly Endowment.  ... 
doi:10.1145/949305.949317 dblp:conf/oopsla/GarciaJLSW03 fatcat:lzkpsqluy5fjpdydnzzny2nlum

A comparative study of language support for generic programming

Ronald Garcia, Jaakko Jarvi, Andrew Lumsdaine, Jeremy Siek, Jeremiah Willcock
2003 Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications - OOPSLA '03  
This paper reports on a comprehensive comparison of generics in six programming languages: C ++ , Standard ML, Haskell, Eiffel, Java (with its proposed generics extension), and Generic C#.  ...  As languages increasingly support generics, it is important that language designers understand the features necessary to provide powerful generics and that their absence causes serious difficulties for  ...  Acknowledgments This work was supported by NSF grants EIA-0131354 and ACI-0219884, and by a grant from the Lilly Endowment.  ... 
doi:10.1145/949315.949317 fatcat:v7r77lcfi5gn7mno2y5ointlxe

Programming Unikernels in the Large via Functor Driven Development [article]

Gabriel Radanne, Thomas Gazagnaire, Anil Madhavapeddy, Jeremy Yallop, Richard Mortier, Hannes Mehnert, Mindy Preston, David Scott
2019 arXiv   pre-print
Dependency on a monolithic operating system is replaced with linkage against libraries that provide specific services.  ...  Leveraging modules allows us to build many components independently, with only loose coupling through a set of standardised signatures.  ...  Examination of our use of these features in a large library such as our TCP/IP stack vs a more traditional ML implementation in the FoxNet [Biagioni et al. 2001 ] project is something we plan to examine  ... 
arXiv:1905.02529v1 fatcat:a6vmsxnmazgj7m3mjhll34qjey

ML Module Mania: A Type-Safe, Separately Compiled, Extensible Interpreter

Norman Ramsey
2006 Electronical Notes in Theoretical Computer Science  
Anonymous referees suggested a number of clarifications. This work is part of the C--project and was supported by NSF grant CCR-0096069, by a Sloan Research Fellowship, and by a gift from Microsoft.  ...  This design seems reasonable at first, particularly if one provides functors analogous to WithType, so that a library can be coerced to a more general signature.  ...  Alternative designs Lua-ML splits each library into zero or more type modules plus a code module. A design that seems simpler is to write every Lua library as a single ML module.  ... 
doi:10.1016/j.entcs.2005.11.045 fatcat:pkxzkzhn3zer7lcl4oxvhtlffm

Scene-Graph-As-Bus: Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications

Bob Zeleznik, Loring Holden, Michael Capps, Howard Abrams, Tim Miller
2000 Computer graphics forum (Print)  
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments.  ...  SGAB monitors and maps changes in the local scene graph of one application to a neutral scene graph representation (NSG), distributes the NSG changes over the network to remote peer applications, and then  ...  The ML attaches to an Open Inventor scene graph by using a runtime binding feature allowing a shared library to interpose on application function calls intended for a different shared library.  ... 
doi:10.1111/1467-8659.00401 fatcat:f5frplbhxbce7asroq33vmzc5a

Zero-cost meta-programmed stateful functors in F* [article]

Jonathan Protzenko, Son Ho
2021 arXiv   pre-print
Finally, we rely on elaborator reflection to automate the very process of authoring a functor, using a code-rewriting tactic.  ...  Next, we rely on partial evaluation to author a higher-order, stateful functor that transforms any unsafe block API into a safe counterpart.  ...  ★ ; the design of the functor-generating tactic; and all of the technical implementation work that materializes the claims made in the paper.  ... 
arXiv:2102.01644v2 fatcat:qszlnhnrabdtzdwf3mycfuae7i

Modular generics

Jeremy Siek
2004 Companion to the 19th annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications - OOPSLA '04  
Because the BGL uses the STL, we will also be able to evaluate the use of generic libraries in G.  ...  Standard ML, on the other hand, provides separate type checking and separate compilation for generic components implemented with Functors.  ... 
doi:10.1145/1028664.1028694 dblp:conf/oopsla/Siek04 fatcat:sgrmqbprh5a4fk4q67vktvx3x4

Modular implementation of dense matrix operations in a high-level BSP language

Sovanna Tan, Frederic Gava
2010 2010 International Conference on High Performance Computing & Simulation  
This paper is our first experiment to design a generic library of BSP implementation in ML of dense matrix operations for scientific computation.  ...  BSML is a high-level language for programming parallel algorithms.  ...  The first massive use of functors for a data structure library is OCamlGraph [2] . It provides a generic and modular implementation of graph in OCaml without poor performances.  ... 
doi:10.1109/hpcs.2010.5547060 dblp:conf/ieeehpcs/TanG10 fatcat:o5oryorvefeobl3ufljswaoynm

A standard ML compiler [chapter]

Andrew W. Appel, David B. MacQueen
1987 Lecture Notes in Computer Science  
The front end is useful for purposes other than compilation, and the back end is easily retargetable (we have code generators for the VAX and MC68020).  ...  Standard ML is a major revision of earlier dialects of the functional language ML. We describe the first compiler written for Standard ML in Standard ML.  ...  Data structures in the run-time system The representations of ML structures in the compiled code are designed to be simple and general.  ... 
doi:10.1007/3-540-18317-5_17 fatcat:ywkkpnt3zfh2zcferfwguabbla

Generic Programming and High-Performance Libraries

Douglas Gregor, Jaakko Järvi, Mayuresh Kulkarni, Andrew Lumsdaine, David Musser, Sibylle Schupp
2005 International journal of parallel programming  
Besides providing a powerful means of describing interfaces to maximize software reuse, concepts provide a uniform mechanism for more closely coupling libraries with compilers and for effecting domain-specific  ...  Generic programming is an especially attractive paradigm for developing libraries for high-performance computing because it simultaneously emphasizes generality and efficiency.  ...  ACKNOWLEDGMENTS This work was supported by NSF grant EIA-0131354 and by a grant from the Lilly Endowment. The authors also thank Ronald Garcia for his helpful comments.  ... 
doi:10.1007/s10766-005-3580-8 fatcat:6ioax32w3jhmtffcs5e3qxzupe

Linear Contexts, Sharing Functors: Techniques for Symbolic Computation [chapter]

Gérard Huet
2003 Applied Logic Series  
This may be considered a disciplined use of pointer reversal techniques.  ...  The second method is a uniform sharing functor, which is a variation on the traditional technique of hashing, but controling the indexing function on the client side rather than on the server side, which  ...  All that is needed is a memo function building the corresponding map without duplications. Let us show the generic algorithm, as an ML functor.  ... 
doi:10.1007/978-94-017-0253-9_4 fatcat:nhaqrstcpvctpenp6tkvjxnv7e

Functional Design Using Behavioural and Structural Components [chapter]

Richard Sharp
2002 Lecture Notes in Computer Science  
is used to generate acyclic combinatorial circuits; these combinatorial fragments are composed at the SAFL-level.  ...  In previous work we have demonstrated how the functional language SAFL can be used as a behavioural hardware description language.  ...  Acknowledgements This work was supported by (UK) EPSRC grant, reference GR/N64256: "A Resource-Aware Functional Language for Hardware Synthesis"; AT&T Research Laboratories Cambridge provided additional  ... 
doi:10.1007/3-540-36126-x_20 fatcat:aw7xc3gnzzbthbdmw6lp3mzt3u

Mixin modules

Dominic Duggan, Constantinos Sourelis
1996 Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96  
Several applications are described, including the resolution of cycles in module import dependency graphs, as well as functionality related to Haskell type classes and CLOS generic functions, though without  ...  Mixin modules require no changes to the core ML type system, and only a very minor change to its run-time semantics.  ...  Functor applications are only allowed to have the form p (pf) where p and p' are paths; this enables us to give a reduction semantics which preserves type identity, a crucial issue in the design of a module  ... 
doi:10.1145/232627.232654 dblp:conf/icfp/DugganS96 fatcat:wori4gcgvjg6vmxeqdvzzhqhgu

Foundations of rule-based design of modular systems

Francesco Parisi-Presicce
1991 Theoretical Computer Science  
of the library components to realize the goal is reduced to deriving the goal from the primitive specification using the given productions.  ...  Given a goal specification, a library of module specifications as reusable software components and a collection of "primitive" realized data type specifications, the designing of a system consisting only  ...  Ehrig for a long and lively discussion on the contents of this paper, to A. Tarlecki for useful suggestions on an earlier draft and to the anonymous referees for their pointed criticisms.  ... 
doi:10.1016/0304-3975(91)90042-z fatcat:ajljvclqlrbgjhrsgbnc5vqism
« Previous Showing results 1 — 15 out of 464 results