In this paper we discuss the problems associated with the description and manipulation of large systems when their sources are not maintained as single fields. We show why and how tools that address these issues, such as Unix MAKE and Lisp Machine DEFSYSTEM, have evolved. Existing formalisms suffer from the problem that their syntax is not easily separable from their functionality. In programming languages, standard "calling conventions" exist to insulate the caller of a function from the syntactic details of how that function was defined, but until now no such conventions have existed to hide consumers of program systems from the details of how those systems were specified. We propose a low-level data abstraction which can support notations such as those used by MAKE and DEFSYSTEM without requiring that the introduction of a new notation be accompanied by a completely different set of tools for instantiating or otherwise manipulating the resulting system. Lisp is used for presentation, bit the issues are not idiosyncratic to LISP.

Scheme86 is a computer system designed to interpret programs written in the Scheme dialect of Lisp. A specialized architecture, coupled with new techniques for optimizing register management in the interpreter, allows Scheme86 to execute interpreted Scheme at a speed comparable to that of compiled Lisp on conventional workstations.

We illustrate how the liberal use of high-order procedural abstractions and infinite streams helps us to express some of the vocabulary and methods of numerical analysis. We develop a software toolbox encapsulating the technique of Richardson extrapolation, and we apply these tools to the problems of numerical integration and differentiation. By separating the idea of Richardson extrapolation from its use in particular circumstances, we indicate how numerical programs can be written that exhibit the structure of the ideas from which they are formed.

I have added support for predicate dispatching, a powerful generalization of other dispatching mechanisms, to the Common Lisp Object System (CLOS). To demonstrate its utility, I used predicate dispatching to enhance Weyl, a computer algebra system which doubles as a CLOS library. My result is Dispatching-Enhanced Weyl (DEW), a computer algebra system that I have demonstrated to be well suited for both users and programmers.

A Scott/Strachey style denotational semantics intended to describe pure LISP is examined. I present evidence that it is an accurate rendering of the language described in chapter 1 of the LISP 1.5 Programmer's, Manual, in particular I show that call-by-value and fluid variables are correctly handled. To do this I have: (1) written an operational 'semantics' of pure LISP and shown it equivalent to the denotational one (2) Proved that, relative to the denotational semantics, the LISP functions apply,eval,...,etc. correctly compute meanings. The proof techniques used are derived from the work of Wadsworth; roughly one first proves the results for a class of 'finite' programs and then extends them to all programs by a limiting argument. Conceptually these arguments are inductions on length of computation and to bring this out I've formulated a rule of inference which enables such operational reasoning to be applied to the denotational semantics.

Th. 3e cycle--Trait. inf.--Lille 1, 1977. N°: 664.

Orientador: Waldemar W. Setzer / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Ciencia da Computação / Made available in DSpace on 2018-07-14T11:42:46Z (GMT). No. of bitstreams: 1 Badelucci_AntonioCarlos_M.pdf: 7319789 bytes, checksum: cffff5414360e0cb106bba181db8d264 (MD5) Previous issue date: 1974 / Resumo: Este trabalho visa ser um subsídio aqueles que se interessam, na ciência da computação, pela resolução de problemas referentes à manipulação simbólica estruturada. O sistema apresentado não pretente ser completo ou final, sua concepção prevê e espera complementos. Espero com ele abrir perspectivas de desenvolvimento na área das linguagens e na resolução de alguns problemas de lingüística computacional. O sistema apresentado vem precedido de uma crítica de outros sistemas em aspecto em que estes nos pareceram ineficientes ou mal concebidos, preocupamo-nos em fornecer ao usuário a máxima flexibilidade na utilização dos recursos do sistema, com um mínimo desgaste na introdução de novos conceitos e tendo sempre em conta uma facilitação do processo de aprendizagem. Essa preocupação vem acompanhada de outra: no desenvolvimento do sistema tivemos sempre presente uma ótima utilização de memória e a minimização dos tempos de execução. A concepção geral e acompanhada de listagens e explicações sobre cada peça particular do sistema. / Abstract: Not informed. / Mestrado / Mestre em Ciência da Computação

This dissertation thesis describes an advanced method of knowledge discovery in databases (KDD), implemented in system LISp-Miner. The goal is to show the possibilities of coordinated use of analytical tools and complex procedures GUHA in this system. The thesis uses methodology CRISP-DM, which is firstly described and work is proceeded using this methodology in the following sections. The author firstly introduces readers domain area and then the data itself, which are processed to the analysis needs. Analytical questions that are answered at, are drawn from the literature, which is focused on domain area. The work should be used as a guide to LISp-Miner users, using analytical tools and procedures GUHA is therefore described the easiest way to understand.

Recent developments in interactive Computer-Aided -Instruction and in Artificial Intelligence have enabled teaching machines and programs to deal reasonably effectively with the subject matter to be taught. Presented herein is a proposal and design for an intelligent LISP teaching machine. It is expected that such a system would be used in conjunction with other conventional methods to teach students, with some prior programming knowledge, the LISP programming language and "correct" programming style. With the belief that procedural knowledge is best learned by 'doing', this CAI system will integrate instruction in concepts, LISP syntax and semantics; instruction in the design of LISP functions and code; and analysis of students' solutions and consequent error correction. The goal of this LISP tutor is simply to act like a human tutor - cognizant of what the student is doing all the time, and able to provide advice and give direction where necessary. / Science, Faculty of / Computer Science, Department of / Graduate

.