the proceedings contain 34 papers. the topics discussed include: ReCaml: execution state as the cornerstone of reconfigurations;polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect op...
ISBN:
(纸本)9781605587943
the proceedings contain 34 papers. the topics discussed include: ReCaml: execution state as the cornerstone of reconfigurations;polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators;using functionalprogramming within an industrial product group: perspectives and perceptions;lazy tree splitting;semantic subtyping with an SMT solver;logical types for untyped languages;higher-order representation of substructural logics;the impact of higher-order state and control effects on local relational reasoning;distance makes the types grow stronger: a calculus for differential privacy;security-typed programming within dependently typed programming;combining syntactic and semantic bidirectionalization;matching lenses: alignment and view update;bidirectionalizing graph transformations;a fresh look at programming with names and binders;experience report: growing programming languages for beginning students;and fortifying macros.
Temporal logics and their intuitionistic counterparts are of growing importance in Computer Science. these intuitionistic counterparts, called intuitionistic (or constructive) temporal logics, are known to be useful f...
详细信息
ISBN:
(纸本)9783642238628
Temporal logics and their intuitionistic counterparts are of growing importance in Computer Science. these intuitionistic counterparts, called intuitionistic (or constructive) temporal logics, are known to be useful for formalizing functionalprogramming. To show a clear relationship between temporal logics and their intuitionistic counterparts has thus been required. In this paper, a theorem for embedding first-order linear-time temporal logic into its intuitionistic counterpart is proved using Baratella-Masini's temporal extension of the Godel-Gentzen negative translation of classical logic into intuitionistic logic.
this paper presents Master and Margarita, an interactive audiovisual project for web and performance adapting Mikhail Bulgakov's novel of the same name. It aims to address two main research questions. First: how t...
详细信息
Divide-and-conquer is an important technique in parallel programming. However, algebraic data structures do not fit divide-and-conquer parallelism. For example, the usual pointer-based implementation of lists cannot e...
详细信息
ISBN:
(纸本)9781450308656
Divide-and-conquer is an important technique in parallel programming. However, algebraic data structures do not fit divide-and-conquer parallelism. For example, the usual pointer-based implementation of lists cannot efficiently be divided at their middle, which prevents us from developing list-iterating divide-and-conquer parallel programs. Tree-iterating programs possibly face a similar problem, because trees might be ill-balanced and list-like shapes. this paper examines parallel programming based on balanced trees: we consider balanced-tree structures and develop recursive functions on them. By virtue of their balancing nature, either bottom-up or top-down recursive functions exploit divide-and-conquer parallelism. Our main contribution is to demonstrate the promise of this approach. We propose a way of systematically developing balanced trees from parallel algorithms, and then, we show that efficient parallel programs on them can be developed by equational reasoning powered by Reynolds' relational parametricity. We consider functions that operate either lists or binary trees, and show that our methods can uniformly deal with both cases. the developed parallel programs are purely functional, correct by construction, and sometimes even simpler than known algorithms.
the ecology of Earth's first large organisms is an unsolved problem in palaeontology. this experience report discusses the determination of which ecosystems could have been feasible, by considering the biological ...
详细信息
ISBN:
(纸本)9781450308656
the ecology of Earth's first large organisms is an unsolved problem in palaeontology. this experience report discusses the determination of which ecosystems could have been feasible, by considering the biological feedbacks within them. Haskell was used to model the ecosystems for these first large organisms - the Ediacara biota. For verification of the results, the statistical language R was used. Neither Haskell nor R would have been sufficient for this work - Haskell's libraries for statistics are weak, while R lacks the structure for expressing algorithms in a maintainable manner. this work is the first to quantify all feedback loops in an ecosystem, and has generated considerable interest from boththe ecological and palaeontological communities.
A general assumption in all existing algorithms for mining functional dependencies is that the database is static. However, real life databases are frequently updated. To the best of our knowledge, the discovery of fu...
详细信息
ISBN:
(纸本)9783642238505;9783642238512
A general assumption in all existing algorithms for mining functional dependencies is that the database is static. However, real life databases are frequently updated. To the best of our knowledge, the discovery of functional dependencies in dynamic databases has never been studied. A naive solution consists in re-applying one of the existing algorithms to discover functional dependencies holding on the updated database. Nevertheless, in many domains, where response time is crucial, re-executing algorithms from the scratch would be inacceptable. To address this problem, we propose to harness the multi-core systems for an incremental technique for discovering the new set of functional dependencies satisfied by the updated database. through a detailed experimental study, we show that our parallel algorithm scales very well withthe number of cores available.
the Adept Task Learning system is an end-user programming environment that combines programming by demonstration and direct manipulation to support customization by nonprogrammers. Previously, Adept enforced a rigid p...
详细信息
We contribute to the difficult problem of programming via natural language instruction. We introduce a formal framework that allows for the use of program demonstrations to resolve several types of ambiguities and omi...
详细信息
Modern software systems should be designed to dynamically adapt to changing user requirements or resource constraints. Deltaoriented programming (DOP) is a compositional approach to flexibly implement software product...
详细信息
the proceedings contain 50 papers. the topics discussed include: towards formal modeling of functional features and feature interactions in software intensive systems;a study of non-Boolean constraints in variability ...
ISBN:
(纸本)9781450307895
the proceedings contain 50 papers. the topics discussed include: towards formal modeling of functional features and feature interactions in software intensive systems;a study of non-Boolean constraints in variability models of an embedded operating system;extraction of feature models from formal contexts;the road to feature modularity?;improving efficiency when deriving numerous products from software product lines simultaneously;supporting program variant generation and feature files in rbFeatures;a preliminary mapping study of approaches bridging software product lines and service-oriented architectures;feature modeling for business document models;pairwise feature-interaction testing for SPLs: potentials and limitations;an approach for implementing core assets in service-oriented product lines;small inexpensive core asset construction for large gainful product line development;and variability quality evaluation on component-based software product lines.
暂无评论