A method is proposed to search for an identifier in a functional program library by using its Hindley-Milner type as a key. This can be seen as an approximation of using the specification as a key. Functions that only...
Lambda lifting is a technique for transforming a functional program with local function definitions, possibly with free variables in the function definitions, into a program consisting only of global function (combina...
详细信息
Current interface descriptions are poor in describing components, because they only provide an external view on a component and they do not lay down how components interact with each other. Suggestions to improve comp...
详细信息
In this paper, we investigate the effects on prey of two predators which are also related in terms of prey-predator relationship. Different types of functional responses are con- sidered to formulate the mathematical ...
详细信息
In this paper, we investigate the effects on prey of two predators which are also related in terms of prey-predator relationship. Different types of functional responses are con- sidered to formulate the mathematical model for predator and generalist predator of our proposed model. Harvesting effort for the generalist predator is considered and the density-dependent mortality rate for predator and generalist predator is incorporated in our proposed model. Local stability as well as global stability for the system is dis- cussed. We analyze the different bifurcation parameters to evaluate Hopf bifurcation in the neighborhood of interior equilibrium point. Finally, some numerical simulations and graphical figures are provided to verify our analytical results with the help of different sets of parameters.
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is baaed on combinator-like graph reduction: the user defined func...
详细信息
Domain algebras are proposed as a tool for structuring compiler correctness proofs which are based on denotational semantics of the source and target language. The correctness of a compiler for a small imperative lang...
详细信息
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined func...
详细信息
This paper describes the principles underlying an efficient implementation of a lazy functional language, compiling to code for ordinary computers. It is based on combinator-like graph reduction: the user defined functions are used as rewrite rules in the graph. Each function is compiled into an instruction sequence for an abstract graph reduction machine, called the G-machine, the code reduces a function application graph to its value. The G-machine instructions are then translated into target code. Speed improvements by almost two orders of magnitude over previous lazy evaluators have been measured;we provide some performance figures.
L(0, 1)-labelling of a graph G= (V, E) is a function f from the vertex set V(G) to the set of non-negative integers such that adjacent vertices get number zero apart, and vertices at distance two get distinct num...
详细信息
暂无评论