Modern constructivist approaches to education dictate active experimentation with the study material and have been linked with improved learning outcomes in STEM fields. During classroom time we believe it is importan...
详细信息
ISBN:
(纸本)9781450350679
Modern constructivist approaches to education dictate active experimentation with the study material and have been linked with improved learning outcomes in STEM fields. During classroom time we believe it is important for students to experiment with the lecture material since active recall helps them to start the memory encoding process as well as to catch misconceptions early and to prevent them from taking root. In this paper, we report on our experiences using ASQ, a Web-based interactive presentation tool in a functional and logic programming course taught at the Faculty of Informatics and Information Technologies at the Slovak University of Technology in Bratislava. ASQ allowed us to collect immediate feedback from students and retain their attention by asking complex types of questions and aggregating student answers in real time. From our experience we identified several requirements and guidelines for successfully adopting ASQ. One of the most critical concerns was how to estimate the time when to stop collecting the students' answers and proceed to their evaluation and discussion with the class. We also report the students' feedback on the ASQ system that we collected in the form of the standard SUS questionnaire.
This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on lambda-abstractions, using an i...
详细信息
This paper presents a theoretical framework for the integration of the cooperative constraint solving of numeric constraint domains into higher-order functional and logic programming on lambda-abstractions, using an instance of a generic Constraint functionallogicprogramming (CFLP) scheme over a so-called higher-order coordination domain. We provide this framework as a powerful computational model for the higher-order cooperation of algebraic constraint domains over real numbers and integers, which has been useful in practical applications involving the hybrid combination of its components, so that more declarative and efficient solutions can be promoted. Our proposal of computational model has been proved sound and complete with respect to the declarative semantics provided by the CFLP scheme, and enriched with new mechanisms for modeling the intended cooperation among the numeric domains and a novel higher-order constraint domain equipped with a sound and complete constraint solver for solving higher-order equations. We argue the applicability of our approach describing a prototype implementation on top of the constraint functionallogic system TOY.
in the context of standard abstract interpretation theory, we define the inverse operation to the disjunctive completion of abstract domains, introducing the notion of least disjunctive basis of an abstract domain D. ...
详细信息
in the context of standard abstract interpretation theory, we define the inverse operation to the disjunctive completion of abstract domains, introducing the notion of least disjunctive basis of an abstract domain D. This is the most abstract domain inducing the same disjunctive completion as D. We show that the least disjunctive basis exists in most cases, and study its properties, also in relation with reduced product and complementation of abstract domains. The resulting framework is powerful enough to be applied to arbitrary abstract domains for analysis, providing advanced algebraic methodologies for domain manipulation and optimization. These notions are applied to abstract domains for static analysis of functional and logic programming languages. (C) 1998 Elsevier Science B.V. All rights reserved.
Reduced product of abstract domains is a rather well-known operation for domain composition in abstract interpretation. In this article, we study its inverse operation, introducing a notion of domain complementation i...
详细信息
Reduced product of abstract domains is a rather well-known operation for domain composition in abstract interpretation. In this article, we study its inverse operation, introducing a notion of domain complementation in abstract interpretation. Complementation provides a systematic way to design new abstract domains, and it allows to systematically decompose domains. Also, such an operation allows to simplify domain verification problems, and it yields space-saving representations for complex domains. We show that the complement exists in most cases, and we apply complementation to three well-known abstract domains, notably to Cousot and Cousot's interval domain for integer variable analysis, to Cousot and Cousot's domain for comportment analysis of functional languages, and to the domain Sharing for aliasing analysis of logic languages.
Data flow computing, a radical departure from von Neumann computing, supports multiprocessing on a massive scale and plays a major role in permitting intelligence computing machines to achieve ultrahigh speeds. Intell...
详细信息
Data flow computing, a radical departure from von Neumann computing, supports multiprocessing on a massive scale and plays a major role in permitting intelligence computing machines to achieve ultrahigh speeds. Intelligence computations consist of large complex numerical and nonnumerical computations. Efficient computing models are necessary to represent intelligence computations. An abstract computing model, a base language specification for the abstract model, high-level and low-level language design to map parallel algorithms to abstract computing model, parallel architecture design to support computing model and design of support software to map computing model to architecture are steps in constructing computing systems. This paper concentrates on dataflow computing for intelligence computations and presents a comparison of dataflow computing models, languages and dataflow computing machines for numerical and nonnumerical computations. The high level language-graph transformation that must be performed to achieve high performance for numerical and nonnumerical programs when executed in a dataflow computing environment are described using the DCBL transformations and applied to the Lisp language. Some general problems in dataflow computing machines are discussed. Performance evaluation measurements obtained by executing benchmark programs in the ETL's nonnumerical dataflow computing environment, the EM-3, are presented. [ABSTRACT FROM AUTHOR]
暂无评论