Titlebook: Algebraic Methodology and Software Technology; 4th International Co V. S. Alagar,Maurice Nivat Conference proceedings 1995 Springer-Verlag

alabaster

SpringerBriefs in Computer Sciencea generalisation to the order-sorted case of an approach given by Möller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal is to only consider reachable extensional algebras. This leads to a very simple theory, where it is possible to relate the higher-order specification

circumvent

Himanshu Singh,Yunis Ahmad Loneal equality). The central objective of this work is the investigation of proof rules that first allow us to establish the correctness of behavioural implementations in a modular way and moreover are practicable enough to induce proof obligations that can be discharged with existing theorem provers.

HEDGE

Himanshu Singh,Yunis Ahmad Loneability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Secondly a Boundedness Lemma shows that no potential computations are missed when name spaces are chosen large enough, but finite. We show how these resu

气候

心神不宁

https://doi.org/10.1007/978-3-030-11605-7tional and logic programming. We present several refinements of higher-order lazy narrowing for convergent (terminating and confluent) term rewrite systems and their application to program transformation. The improvements of narrowing include a restriction of narrowing at variables, generalizing the

resistant

RALES

消息灵通

洞穴

https://doi.org/10.1007/978-88-470-1866-2ions. An existing system of derivation of the relation among non-parametric specifications is enlarged so as to comprise parametric specifications. The new system is correct and complete under certain assumptions. By means of this system the calculus of parametric specifications can be enhanced with

涂掉

Hao Dong,Zihan Ding,Shanghang Zhangtrix calculi can handle only the case of programs whose dimensions are rigidly fixed. In this paper, the notion of dynamic matrix is presented. Dynamic matrices are special matrices having extensible dimensions (rows and columns) which allow matrix product to be always defined. We put forward the th