this book constitutes the thoroughly refereed post-conference proceedings of the 11th International symposium on trends in functionalprogramming, TFP 2010, held in Norman, OK, USA, in May 2010. the 13 revised full pa...
详细信息
ISBN:
(数字)9783642229411
ISBN:
(纸本)9783642229404
this book constitutes the thoroughly refereed post-conference proceedings of the 11th International symposium on trends in functionalprogramming, TFP 2010, held in Norman, OK, USA, in May 2010. the 13 revised full papers presented were carefully reviewed and selected from 26 submissions during two rounds of reviewing and improvement. the papers cover new ideas for refactoring, managing source-code complexity, functional language implementation, graphical languages, applications of functionalprogramming in pure mathematics, type theory, multitasking and parallel processing, distributed systems, scientific modeling, domain specific languages, hardware design, education, and testing.
Characterising a problem in terms of a system of equations is common to many branches of science and engineering. Due to their size, such systems are often described in a modular fashion by composition of individual e...
详细信息
ISBN:
(纸本)9783642229404
Characterising a problem in terms of a system of equations is common to many branches of science and engineering. Due to their size, such systems are often described in a modular fashion by composition of individual equation system fragments. Checking the balance between the number of variables (unknowns) and equations is a common approach to early detection of mistakes that might render such a system unsolvable. However, current approaches to modular balance checking have a number of limitations. this paper investigates a more flexible approach that in particular makes it possible to treat equation system fragments as true first-class entities. the central idea is to record balance information in the type of an equation fragment. this information can then be used to determine if individual fragments are well formed, and if composing fragments preserves this property. the type system presented in this paper is developed in the context of functional Hybrid Modelling (FHM). However, the key ideas are in no way specific to FHM, but should be applicable to any language featuring a notion of modular systems of equations.
Worldwide, computer science departments have experienced a dramatic increase in the number of student enrolments. Moreover, the ongoing COVID-19 pandemic requires institutions to radically replace the traditional way ...
详细信息
Worldwide, computer science departments have experienced a dramatic increase in the number of student enrolments. Moreover, the ongoing COVID-19 pandemic requires institutions to radically replace the traditional way of on-site teaching, moving interaction from physical to virtual space. We report on our strategies and experience tackling these issues as part of a Haskell-based functionalprogramming and verification course, accommodating over 2000 students in the course of two semesters. Among other things, we fostered engagement with weekly programming competitions and creative homework projects, workshops with industry partners, and collaborative pair-programming tutorials. To offer such an extensive programme to hundreds of students, we automated feedback for programming as well as inductive proof exercises. We explain and share our tools and exercises so that they can be reused by other educators.
Teaching programming to novices is best done with tools with simpler user interfaces than professional IDEs that are tailored for experienced programmers. In a distance learning situation it is also important to have ...
详细信息
Teaching programming to novices is best done with tools with simpler user interfaces than professional IDEs that are tailored for experienced programmers. In a distance learning situation it is also important to have a development environment that is easy to explain and use, and that integrates well withthe variety of course material used (slides, homework, etc). In this paper we give an experience report on teaching programming with codeBoot, an online programming environment we designed specifically for novices.
A functional automatic test pattern generator (ATPG) that explores the design under test (DUT) state space by exploiting an easy-to-traverse extended finite state machine (FSM) model has been described. the ATPG engin...
详细信息
A functional automatic test pattern generator (ATPG) that explores the design under test (DUT) state space by exploiting an easy-to-traverse extended finite state machine (FSM) model has been described. the ATPG engine relies on learning, backjumping and constraint logic programming to deterministically generate test vectors for traversing all transitions of the extended FSM. Testing of hard-to-detect faults is thus improved. the generated test sequences are very effective in detecting both high-level faults and gate-level stuck-at faults. thus, the reuse of test sequences generated by the proposed ATPG allows also to improve the stuck-at fault coverage and to reduce the execution time of commercial gate-level ATPGs.
Software infrastructures that support metacomputing are from traditional monolithic platform-specific systems to component and service-based frameworks. In this paper we demonstrate that contrary to popular belief suc...
详细信息
ISBN:
(纸本)0769516866
Software infrastructures that support metacomputing are from traditional monolithic platform-specific systems to component and service-based frameworks. In this paper we demonstrate that contrary to popular belief such modular software systems are capable of delivering good to excellent performance, support legacy as well as new application programming paradigms, and deliver enhanced functionality. the Harness system, a software backplane enabling reconfigurable distributed concurrent computing is used to emulate the PVM programming environment. Numerical kernel benchmarks show that application performance results using the emulator and native versions are within a few percent of each other Coupled withthe ability to leverage pre-existing and specialized modules, our experiences suggest that service-oriented computational grids may be constructed rapidly and effectively via such component-based architectural frameworks that deliver full functionality without compromising efficiency.
As the Internet began its exponential growth into a global information, environment, software was often unreliable, slow and had difficulty in interoperating with other systems. Supercomputing node counts also continu...
详细信息
ISBN:
(纸本)0769516866
As the Internet began its exponential growth into a global information, environment, software was often unreliable, slow and had difficulty in interoperating with other systems. Supercomputing node counts also continue to follow high growthtrends. Supercomputer and grid resource management, software must mature into a reliable computational platform in much the same way that web services matured for the Internet. DOGMA the Next Generation (DOGMA-NG) improves on current resource management approaches by using tested off-the-shelf enterprise technologies to build a robust, scalable, and extensible resource management platform. Distributed web service technologies constitute the core of DOGMA-NGs design and provide fault-tolerance and scalability. DOGMA-NGs use of open standard web technologies and efficient management algorithms promises to reduce management time and accommodate. the growing size of future supercomputers. the use of web -technologies also provides the opportunity for a new parallel programming paradigm, enterprise web services parallel programming, that also gains benefit from the scalable, robust component architecture.
FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most ...
详细信息
ISBN:
(纸本)9781509025206
FPGA programmability remains a concern with respect to the broad adoption of the technology. One reason for this is simple: FPGA applications are frequently implementations of concurrent algorithms that could be most directly rendered in concurrent languages, but there is little or no first-class support for concurrent applications in conventional hardware description languages. It stands to reason that FPGA programmability would be enhanced in a hardware description language with first-class concurrency. the starting point for this paper is a functional hardware description language with built-in support for concurrency called ReWire. Because it is a concurrent functional language, ReWire supports the elegant expression of common concurrency paradigms;we illustrate this with several case studies.
We propose a higher-order logical framework for declarative programming as an extension to the setting of the simply typed lambda calculus of a first-order rewriting logic, where programs are now presented by conditio...
详细信息
ISBN:
(纸本)9781605585680
We propose a higher-order logical framework for declarative programming as an extension to the setting of the simply typed lambda calculus of a first-order rewriting logic, where programs are now presented by conditional pattern rewrite systems on lambda abstractions. We use this new logical framework to obtain a natural model-theoretic semantics from traditional theories in higher-order declarative (functional and logic) programming, and we provide a fixpoint semantics that matches the pattern model of a program as the least fixpoint of an operator defined over pattern algebras. We use this higher-order semantic framework as a basis for the verification of declarative programs and the development of efficient algorithmic debugging techniques. Our debugging approach proceeds by exploring an abridged computational tree built on a higher-order proof calculus with A-abstractions that provides a purely declarative view of the computation, in order to detect a function rule that is incorrect in the intended model of the program's semantics. For verification purposes, our higher-order logical framework can be mapped into higher-order logic programming, and we can use this translation as a starting point to explore how to prove properties valid in the least pattern model of a program by means of different existing interactive proof assistants, as the Isabelle theorem prover.
In our efforts to develop an object-oriented visual programming language, the dataflow model of computation is extended from its traditional functional model to an object-oriented model. It is argued that the concept ...
详细信息
In our efforts to develop an object-oriented visual programming language, the dataflow model of computation is extended from its traditional functional model to an object-oriented model. It is argued that the concept of subroutine in the object-oriented model requires two different types of calling (activation) mechanisms, the synchronous call and the asynchronous call. Asynchronous subroutine call offers a new abstraction mechanism for object-oriented programming, different from the traditional class-based abstraction and functional abstraction.
暂无评论