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...
详细信息
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.
Composition-nominative logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming. They can be considered as generaliz...
详细信息
The Lübeck Transformation System supports the refinement of higher order algebraic specifications following sound transformation rules. We discuss the system requirements, describe the specification language and ...
详细信息
In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic pr...
详细信息
In the paper new logics oriented on hierarchical data are developed. Algebras of partial predicates over such data with special compositions as operations form a semantic base for constructed logics. Characteristic property of such logics is the usage of composite names in their languages. Semantic properties of these logics are studied;corresponding sequent calculi are defined, their soundness and completeness are proved for logics of renominative level.
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.
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-s...
详细信息
We investigate algorithms for solving the satisfiability problem in composition-nominative logics of quantifier-equational level. These logics are algebra-based logics of partial predicates constructed in a semantic-syntactic style on the methodological basis, which is common with programming;they can be considered as generalizations of traditional logics on classes of partial predicates that do not have fixed arity. We show the reduction of the problem in hand to the satisfiability problem for classical first-order predicate logic with equality. The proposed reduction requires extension of logic language and logic models with an infinite number of unessential variables. The method developed in the paper enables us to use existent satisfiability checking procedures also for quantifier composition-nominative logic with equality.
暂无评论