1993 ◽  
Vol 6 (1) ◽  
pp. 53-56 ◽  
Author(s):  
Bogdan D. Czejdo ◽  
Ralph P. Tucci ◽  
David W. Embley
Keyword(s):  

1989 ◽  
Vol 18 (4) ◽  
pp. 12-16 ◽  
Author(s):  
C. J. Date
Keyword(s):  

2013 ◽  
Vol 2013 ◽  
pp. 1-15
Author(s):  
Wei Xu ◽  
Ke Zhao ◽  
Yatao Li ◽  
Peitao Cheng

This paper addresses the functional representation based on the event model. In the event model, the ontology is defined based on the theory of propositional logic to describe the connotation of the event, and the variant is defined based on the theories of domain relational calculus and set theory to express the variation range of the event, which is alterable part of the event under the constraints of the ontology. Function is an important concept in conceptual design and has its connotation and extension. The functional representation is proposed based on the event model. The ontology of event is used to describe the connotation of function and to reflect the stability of function. The variant of the event is used to represent the extension and to incarnate the variety of function. The extension of function is the change range of function under the constraints of the connotation. The proposed functional representation divides the function into the immutable part and the alterable part, facilitating the expansion of design space. A functional reasoning model is also put forward based on the event model to support the function reasoning on the computers. Finally, a simple case validates the feasibility of the model.


2014 ◽  
pp. 149-162
Author(s):  
Elvis C. Foster ◽  
Shripad V. Godbole
Keyword(s):  

2016 ◽  
pp. 181-194
Author(s):  
Elvis C. Foster ◽  
Shripad Godbole
Keyword(s):  

1996 ◽  
Vol 6 (1) ◽  
pp. 181-188 ◽  
Author(s):  
Graham Hutton ◽  
Erik Meijer

AbstractA representation changer is a function that converts a concrete representation of an abstract value into a different concrete representation of that value. Many useful functions can be recognised as representation changers; examples include compilers and arithmetic functions such as addition and multiplication. Functions that can be specified as the right inverse of other functions are special cases of representation changers. In recent years, a number of authors have used a relational calculus to derive representation changers from their specifications. In this paper, we show that the generality of relations is not essential, and representation changers can be derived within the more basic setting of functional programming. We illustrate our point by deriving a carry-save adder and a base-converter, two functions which have previously been derived relationally.


10.1142/5683 ◽  
2005 ◽  
Author(s):  
Ketty Peeva ◽  
Yordan Kyosev
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document