18 papers · ranked by Valyu relevance
Stefan Höck, Rainer Riedl
Background Although programming in a type-safe and referentially transparent style offers several advantages over working with mutable data structures and side effects, this style of programming has not seen much use in chemistry-related software. Since functional programming languages were designed with referential…
Thomas Bagrel
La programmation par passage de destination introduit le concept de destination, qui représente l'adresse d'une cellule mémoire encore vierge sur laquelle on ne peut écrire qu'une fois. Ces destinations peuvent être passées en tant que paramètres de fonction, permettant à l'appelant de garder le contrôle de la gestion…
Fernando Alves, Delano Oliveira, Fernanda Madeiral, Fernando Castor
—Language constructs inspired by functional programming have made their way into most mainstream programming languages. Many researchers and developers consider that these constructs lead to programs that are more concise, reusable, and easier to understand. Notwithstanding, few studies investigate the prevalence of…
Francis Sergeraert
A paper [5] has recently been published. This paper is faulty: 1) The standard requirements about the definition of an algorithm are not respected, 2) The main point in the complexity study, namely the functional programming component, is absent. The Editorial Board of the SIAM JC had been warned a confirmed…
Authors not listed
Curried functions provide a systematic way of transforming multi-argument functions into nested singleargument functions. This transformation allows partial application and supports many central principles of functional programming. Their extension, called curried 𝑘-ary functions, naturally generalizes the familiar…
Stanisław Ambroszkiewicz
"The von Neumann vicious circle" means that non-von Neumann computer architectures cannot be developed because of the lack of widely available and effective non-von Neumann languages. New languages cannot be created because of lack of conceptual foundations for non-von Neumann architectures. The reason is that…
Thomas Bagrel, Arnaud Spiwack
Destination passing —aka. out parameters— is taking a parameter to fill rather than returning a result from a function. Due to its apparently imperative nature, destination passing has struggled to find its way to pure functional programming. In this paper, we present a pure functional calculus with destinations at its…
Attila Egri-Nagy
'Declarative' is a word we use often and it makes a good sense in everyday conversation in software development. For instance, ". . . we like to write our programs in such a way that the code looks like a description of the solution;" [11]. Declarative programming is often associated with functional and logic…
Jasmin Christian Blanchette, Mathias Fleury, Peter Lammich, Christoph Weidenbach
'Christoph Weidenbach'] We developed a formal framework for conflict-driven clause learning (CDCL) using the Isabelle/HOL proof assistant. Through a chain of refinements, an abstract CDCL calculus is connected first to a more concrete calculus, then to a SAT solver expressed in a functional programming language, and…
Duško Pavlović
| Preface | | v | | --- | --- | --- | | What? | | vii | | 1 Drawing types and functions | | 3 | | 2 | Monoidal computers: computability as a structure | 23 | | 3 | Fixpoints | 39 | | 4 | What can be computed | 53 | | 5 | What cannot be computed | 71 | | 6 | Computing programs | 79 | | 7 Stateful computing | | 97 | | 8…
Muhammad Shoaib Farooq, Sher Afzal Khan, Farooq Ahmad, Saeed Islam + 2 more
'Adnan Abid' 'Hussein Suleman'] Computer programming is the core of computer science curriculum. Several programming languages have been used to teach the first course in computer programming, and such languages are referred to as first programming language (FPL). The pool of programming languages has been evolving…
Zoltan A. Kocsis, Jerry Swan
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varvec{+}$$\end{document} + Proof Search \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym}…
Eric Schulz, Joshua B. Tenenbaum, David Duvenaud, Maarten Speekenbrink + 1 more
How do people recognize and learn about complex functional structure? Taking inspiration from other areas of cognitive science, we propose that this is achieved by harnessing compositionality: complex structure is decomposed into simpler building blocks. We formalize this idea within the framework of Bayesian…
Authors not listed
Self-driving laboratories (SDLs) promise accelerated scientific discovery and product development by closing the loop between robotic execution and AI/ML-driven decision making. In practice, however, SDL orchestration remains fragmented; workflows are typically encoded as laboratory-specific scripts or bespoke…
Authors not listed
Step-by-step thinking is essential in all domains of chemical sciences and engineering. While machine learning tools are broadly used, algorithms that automate reasoning are far less common. We elaborate on seven categories of human reasoning activities and connect each to applications in chemical science and…
Majd Abdallah, Valentin Iovene, Gaston Zanitti, Demian Wassermann
Inferring reliable brain-behavior associations requires synthesizing evidence from thousands of functional neuroimaging studies through meta-analysis. However, existing meta-analysis tools are limited to investigating simple neuroscience concepts and expressing a restricted range of questions. Here, we expand the scope…
Angela Jones, Eric Schulz, Björn Meder, Azzurra Ruggeri
How do people actively explore to learn about functional rules, that is, how continuous inputs map onto continuous outputs? We introduce a novel paradigm to investigate information search in continuous, multi-feature function learning scenarios. Participants either actively selected or passively observed information to…
Mohamed A. El-Zawawy
This paper introduces new approaches for the analysis of frequent statement and dereference elimination for imperative and object-oriented distributed programs running on parallel machines equipped with hierarchical memories. The paper uses languages whose address spaces are globally partitioned. Distributed programs…