We argue that the problem of developing denotational models for languages based on first-order equations is distinct from both the syntactic theory of rewriting and the problem of modeling equational specifications of...
详细信息
This conferenceproceedings contains 37 papers. These papers represent an up-to-date view of lisp and functionalprogramming languages. The main subjects discussed are logic programming, the lisp Machine architecture,...
详细信息
ISBN:
(纸本)0897911423
This conferenceproceedings contains 37 papers. These papers represent an up-to-date view of lisp and functionalprogramming languages. The main subjects discussed are logic programming, the lisp Machine architecture, compiler design for functionalprogramming languages, and object oriented programming.
We describe a proof-oriented semantics for languages handling shared pointer structures. The main difficulty is to describe the store containing the pointer structure in an appropriate way. On the one hand, it should ...
详细信息
ISBN:
(纸本)0897910850
We describe a proof-oriented semantics for languages handling shared pointer structures. The main difficulty is to describe the store containing the pointer structure in an appropriate way. On the one hand, it should be easy to express the effect of the instructions handling pointers and on the other, it should be possible to state high-level properties of the structure (involving the concepts of lists, graphs,...).We review the previous works and propose an original solution which considers the store as a graph described by means of a collection of trees. This allows us to use a calculus of recursive functions in the domain of trees to specify properties of the pointer *** have chosen to illustrate those concepts in the case of a functionalprogramming language, as no proof-oriented semantics of pointer handling has been proposed for such languages. To perform symbolic execution, we need to record both the value and the effect of a program at different stages of evaluation. To do so, we use the states (p;e)where p is a partially evaluated program and e is a store (described as stated above). To obtain a suitable proof method, we define (p;e) in a way which hides all details that are not observable by the user of the language. We axiomatize the needed relations between these pairs and use the resulting axioms as a basis of a formal proof technique, where the proofs proceed by symbolic execution and induction over *** language lisp has been chosen because it is well-known. Nevertheless, no prior knowledge in lisp is required.
Barrel is a language-development facility, whose conceptual and theoretical bases are outlined in a companion paper. The present paper attempts to describe applications of Barrel and usages of it, on the Data General ...
详细信息
The proceedings contain 31 papers. The topics discussed include: symbolic computing with and without lisp;prose and CONS: (Multics Emacs: a commercial text-processing system in lisp);explicit parallelism in lisp-like ...
The proceedings contain 31 papers. The topics discussed include: symbolic computing with and without lisp;prose and CONS: (Multics Emacs: a commercial text-processing system in lisp);explicit parallelism in lisp-like languages;explicit parallelism in lisp-like languages;MULTI - a lisp based multiprocessing system;a semantic comparison of lisp and SCHEME;a system of communicating residential environments;address/memory management for a gigantic lisp environment or, GC considered harmful;HOPE: an experimental applicative language;and an efficient environment allocation scheme in an interpreter for a lexically-scoped lisp.
暂无评论