We describe in this paper our implementation of the Xenstored service which is part of the XEN architecture. Xenstored maintains a hierarchical and transactional database, used for storing and managing configuration v...
详细信息
We study a series of milestones leading to the emergence of lazy, higher order, polymorphically typed, purely functional programming languages. An invited lecture given at TFP12, St Andrews University, 12 June 2012. &...
详细信息
We introduce a direct encoding of the typed A-calculus into Java: for any Java types A, B we introduce the type A --> B together with function application and A-abstraction. The latter makes use of anonymous inner ...
详细信息
ISBN:
(纸本)354014031X
We introduce a direct encoding of the typed A-calculus into Java: for any Java types A, B we introduce the type A --> B together with function application and A-abstraction. The latter makes use of anonymous inner classes. We. show that A-terms are evaluated by call-by-value. We then look at how to model domain equations in Java and as an example consider the untyped lambda calculus. Then we investigate the use of function parameters in order to control overriding and in order to dynamically update methods, which can substitute certain applications of the state pattern. Further we introduce a foreach-loop in collection classes. Finally we introduce algebraic types. Elements of the resulting type are given by their elimination rules. Algebraic types with infinitely many arguments like Kleene's O and simultaneous algebraic types are already contained in that notion. Further we introduce an operation selfupdate, which allows to modify for instance a subtree of a tree, without making a copy of the original tree. All the above constructions are direct and can be done by hand.
We explore the design space of implementing suffix tree algorithms in the functional paradigm. We review the linear time and space algorithms of McCreight and Ukkonen. Based on a new terminology of nested suffixes and...
详细信息
This article describes the added support in FXSL 2.0 for writing higher-order functions in XSLT 2.0 based on new fundamental XPath 2.0/XSLT 2.0 features such as the sequence datatype, strong typing and writing functio...
详细信息
The article is devoted to the results of the analysis of modern trends in the field of functional programming, considered as a methodology for solving problems of organizing parallel computing. The paradigm analysis o...
详细信息
This article describes the relational programming paradigm. Because a function is a particular case of relation, we can consider the computation of points-to-set processes (relations) instead of points-to-point proces...
详细信息
This paper looks at the current state of how students learn the functional programming [FP] paradigm and how it can be improved by applying gamification. Multiple related works and research published by experts in the...
详细信息
functional programming is losing its place in undergraduate computer science curricula, in part because of the attention given to many new ideas in the field. Nevertheless, undergraduates benefit from an early experie...
详细信息
ISBN:
(纸本)9781450309424
functional programming is losing its place in undergraduate computer science curricula, in part because of the attention given to many new ideas in the field. Nevertheless, undergraduates benefit from an early experience in a second programming paradigm, especially functional programming. The solution, advocated here, is to weave functional programming into the discrete mathematics course. Not only does this give a convenient, early occasion to teach functional programming, but it also allows the functional programming topics and discrete mathematics topics to illuminate each other. Furthermore, it provides a service course to students in mathematics and other majors.
The use of monads to structure functional programs is described. Monads provide a convenient framework for simulating effects found in other languages, such as global state, exception handling, output, or nondetermini...
详细信息
暂无评论