Nature 395, 269-272 (17 September 1998) | doi:10.1038/26212; Received 30 March 1998; Accepted 25 June 1998
Dynamic topography, plate driving forces and the African superswell
Carolina Lithgow-Bertelloni1,2 and Paul G. Silver1
Spatial metaphors inherent in network models of blogging will be contrasted with the surface/depth model of student learning. [...] blogs should not be seen merely as a technological tool for teaching + learning but as a situated practice
This document formally specifies the semantics of local modules and packages - dynamically typed modules that are first-class values - as an extension to the functional programming language Standard ML. The language thus defined is a substantial subset of a larger extension of Standard ML, a language known as Alice ML. Packages are the central feature of Alice ML that enables support for typed open programming.
Tom Schrijvers, Peter Stuckey and Philip Wadler Abstract: A constraint programming system combines two essential components: a constraint solver and a search engine. The constraint solver reasons about satisfiability of conjunctions of constraints, and the search engine controls the search for solutions by iteratively exploring a disjunctive search tree defined by the constraint program. In this paper we give a monadic definition of constraint programming where the solver is defined as a monad threaded through the monadic search tree. We are then able to define search and search strategies as first class objects that can themselves be built or extended by composable search transformers. Search transformers give a powerful and unifying approach to viewing search in constraint programming, and the resulting constraint programming system is first class and extremely flexible. Let's briefly look at the n queens example from the paper. First, there is the nqueens model:
Tim Sheard, Zine-el-abidine Benaissa, and Emir Pasalic * Introduction * Staging in MetaML * Monads in Langauge Design * Monads in METAML * Illustrating our compiler development method o The while-language o The structure of the solution o Step 1: monadic interpreter o Step 2: staged interpreter + Interpreter for Commands. + An example. * Step 3: Back-end translation and intermediate code optimization o Intensional analysis of code fragments
The need for flexible forms of serialisation arises under many circumstances, e.g. for doing high-level inter-process communication or to achieve persistence. Many languages, including variants of ML, thus offer pickling as a system service, but usually in a both unsafe and inexpressive manner, so that its use is discouraged. In contrast, safe generic pickling plays a central role in the design and implementation of Alice ML: components are defined as pickles, and modules can be exchanged between processes using pickling. For that purpose, pickling has to be higher-order and typed (HOT), i.e. embrace code mobility and involve runtime type checks for safety. We show how HOT pickling can be realised with a modular architecture consisting of multiple abstraction layers for separating concerns, and how both language and implementation benefit from a design consistently based on pickling.
A. Greubel, J. Wenkmann, H. Siller, und M. Hennecke. Proceedings of the 20th International Conference on Cognition and Exploratory Learning in Digital Age (CELDA2023), (2023)
L. Ehrlinger, J. Schrott, und W. Wöß. Database and Expert Systems Applications - DEXA 2023 Workshops, Seite 3--10. Cham, Springer Nature Switzerland, (2023)
K. Kobs, T. Koopmann, A. Zehe, D. Fernes, P. Krop, und A. Hotho. Findings of the Association for Computational Linguistics: EMNLP 2020, Seite 878--883. Online, Association for Computational Linguistics, (November 2020)
V. Ehrenstein, H. Kharrazi, H. Lehmann, und C. Taylor. Tools and Technologies for Registry Interoperability, Registries for Evaluating Patient Outcomes: A User’s Guide, 3rd Edition, Addendum 2 Internet, Agency for Healthcare Research and Quality (US), (2019)