Titlebook: Automata, Languages and Programming; 14th International C Thomas Ottmann Conference proceedings 1987 Springer-Verlag Berlin Heidelberg 1987

制定法律

容易生皱纹

GLARE

Logic programming with ions,ic programming framework. To this end, we generalize the notion of an ion introduced in [7], and develop our alternative to the language and metalanguage amalgamation approach suggested by Bowen and Kowalski [1].

远地点

Inverse image analysis,erse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages.

Priapism

A unification algorithm for confluent theories, an extension of the standard unification algorithm invented by Martelli and Montanari [16]. It is demand driven and can handle infinite and partial instantiated objects and thus can be used as a means to integrate functional and logic programming.

体贴

Coronary-Spasm

On word problems in equational theories,l if it generates equations which cannot be oriented into rules (i.e., the system is not .), or if it generates infinitely many rules (i.e., the system is not .). In 1981 Huet showed that even if the system is not confluent, the Knuth-Bendix procedure still yields a semi-decision procedure for word

范例

Another look at abstraction in process algebra, In this paper, we look at abstraction in the framework of the Algebra of Communicating Processes (see BERGSTRA & KLOP [4, 6]). We introduce a hidden step η, and construct a model for the resulting theory ACP.. We briefly look at recursive specifications in this theory, and discuss the relations wit

恶意

无能力

Non-uniform automata over groups, theory of finite automata and low-level parallel complexity. Achievements of this model include the proof that width 5 branching programs recognize exactly the languages in non-uniform .. [Ba86], NUDFA characterizations of several important subclasses of .. [BT87], and a new proof [BT87] of the old