scholarly journals Expression Compatibility Problem

10.29007/xlbn ◽  
2018 ◽  
Author(s):  
Seyed Hossein Haeri ◽  
Sibylle Schupp

We solve the Expression Compatibility Problem (ECP) – a variation of the famous Expression Problem (EP) which, in addition to the classical EP concerns, takes into consideration the replacement, refinement, and borrowing of algebraic datatype (ADT) cases. ECP describes ADT cases as components and promotes ideas from Lightweight Family Polymorphism, Class Sharing, and Expression Families Problem. Our solution is based on a formal model for Component-Based Software Engineering that pertains to the Expression Problem. We provide the syntax, static semantics, and dynamic semantics ofour model. We also show that our model can be used to solve the Expression FamiliesProblem as well. Moreover, we show how to embed the model in Scala.

2013 ◽  
Vol 765-767 ◽  
pp. 1507-1511
Author(s):  
Saeeda Sharmeen Rahman ◽  
Jing Nong Weng

This paper presents the Component-Based Software Engineering (CBSE) approach for usability testing of a web-site based on ISO 9241-11 usability guidance to achieve specified goals with effectiveness, efficiency and satisfaction. Usability testing is a technique used to evaluate a product by testing it on users. A particular type of website i.e. university web site was chosen and segmented in different components in modular forms according to the purpose of that component. Then component wise tasks as per ISO 9241-11 usability guidance were prepared to carry out the usability testing for evaluating the test web-site. After analyzing the results of component based usability testing, a proto-type version of the test web-site was designed in a limited form including all the feedback of test results. Finally, the proto-type web-site was re-evaluated for establishing the effectiveness of component based web usability method with the same tasks. The proposed component based usability testing method is expected to improve the design/content issues of web-site resulting the web-site much more user friendly, effective and less time and cost consuming.


2018 ◽  
pp. 393-414
Author(s):  
Eduardo García Ramírez

According to dynamic semantics, what is said by an utterance of a sentence is determined by how the common ground is affected by the acceptance of such utterance. It has been claimed that dynamic semantics offers an account of what is said by an utterance in a context that excels that of traditional static semantics. Assertions of negative existential constructions, of the form ‘X does not exist’, are a case in point. These assertions traditionally pose a problem for philosophers of language. A recent proposal, owed to Clapp (2008), argues that static semantics is unable to solve the problem and offers a dynamic semantics account that promises to succeed. In this paper I want to challenge this account and, more generally, the scope of the dynamic semantics framework. I will offer a counterexample, inspired by “answering machine” uses of indexical and demonstrative expressions, to show how dynamic semantics fails.  I conclude by considering the merits of both static and dynamic accounts.


Sign in / Sign up

Export Citation Format

Share Document