Titlebook: International Symposium on Programming; Proceedings of the F Bernard Robinet Conference proceedings 1980 Springer-Verlag Berlin Heidelberg

討人喜歡

0302-9743 Overview: 978-3-540-09981-9978-3-540-39233-0Series ISSN 0302-9743 Series E-ISSN 1611-3349

Autobiography

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/472054.jpg

大方不好

An algorithm for translating LISP programs into reduction language programs,An algorithm for translating LISP programs into reduction language programs is presented. It allows us to compare some features of the two languages: presence/absence of environment, free variables, evaluation rules, and parallelism. It may lead to efficient execution of LISP programs on a reduction machine.

豐富

neuron

HEED

,Structures de controle et puissances d’expression,e (affectations, entrées-sorties ...). A cette structure de contr?le peut être associée la puissance du langage, c‘est-à-dire la capacité du langage à décrire des suites d‘opérations de telle ou telle complexité..En utilisant le formalisme des arbres à feuilles indicées comme modèle des programmes, on établit les résultats suivants :

野蠻

愛國者

悲痛

Towards a theory of abstract data types: A discussion on problems and tools, requirement. We also show that none of the above quoted categorial notions captures recursiveness..Finally, we consider our own definition of abstract data type, based on model-theoretic notions; we analyze this definition in the frame of the proposed formalization of recursiveness, and illustrate

pineal-gland

A case study of abstract implementations and their correctness,a type for performing some text analysis is specified and implemented by arrays which are accessed via an efficient hashing technique. Moreover, we give a correctness proof of this implementation that partly refers to correctness criteria introduced in an earlier paper where the whole concept is dis