Andrew B. Mickel

Bio: Andrew B. Mickel is an academic researcher from Minneapolis College of Art and Design. The author has contributed to research in topics: Pascal (programming language). The author has an hindex of 2, co-authored 2 publications receiving 33 citations.

Pascal User Manual and Report: ISO Pascal Standard

Abstract: This new edition of the definitive Pascal reference updates the text with the most recent revisions of the ISO Pascal standard, performed by working Group 2 of the ISO community, since the standard was formally approved in 1983. This reversion of the ISO standard resolved differences between it and the American (ANSI) standard, and these as well as other changes are subsequently reflected in this new edition. It should be noted that in 1984 the third edition of this book was modified with respect to the standard while retaining the readability and elegance which originally set it apart from the standard. This book consists of two parts: The User Manual, and the Revised Report. The User Manual is directed to those who have some familiarity with computer programming, and who wish to get acquainted with the language Pascal. The style of the User Manual is that of a tutorial, and many examples are included to demonstrate the various features of Pascal. Summarizing tables and syntax specifications are among the Appendices. the Report serves as the ultimate, concise reference for both programmers and implementors. It describes Standard Pascal which constitutes a common base between various implementations of the language.

Verification of Sequential Imperative Programs in Isabelle/HOL

Abstract: The purpose of this thesis is to create a verification environment for sequential imperative programs. First a general language model is proposed, which is independent of a concrete programming language but expressive enough to cover all common language features: mutually recursive procedures, abrupt termination and exceptions, runtime faults, local and global variables, pointers and heap, expressions with side effects, pointers to procedures, partial application and closures, dynamic method invocation and also unbounded nondeterminism. For this language a Hoare logic for both partial and total correctness is developed and on top of it a verification condition generator is implemented. The Hoare logic is designed to allow the integration of program analysis or software model checking into the verification. To demonstrate the continuity to a real programming language a subset of C is embedded into the verification environment. The whole work is developed in the theorem prover Isabelle. Therefore the correctness is machine-checked and in addition the rich infrastructure of the general purpose theorem prover Isabelle can be employed for the verification of imperative programs.

Isomorphisms of Types: From Lambda-Calculus to Information Retrieval and Language Design

Abstract: Isomorphisms of types is a research topic in type theory that has valuable practical applications both for programming language design and for more human-centred information retrieval in software libraries. By means of a study into the syntax of the now widely known typed lambda-calculus, it is possible to identify some simple equations between types that on one hand can improve the design of the ML language, and on the other hand provide the basis for building radically new information retrieval systems for functional software libraries. In this book the author presents the theoretical aspects of this research.

Source memory in the absence of successful cued recall.

Abstract: Five experiments were conducted to address the question of whether source information could be accessed in the absence of being able to recall an item. The authors used a paired-associate learning paradigm in which cue-target word pairs were studied, and target recall was requested in the presence of the cue. When target recall failed, participants were asked to make a source judgment of whether a man or woman spoke the unrecalled item. In 3 of the 5 experiments, source accuracy was at or very close to chance. By contrast, if cue-target pairs were studied multiple times or participants knew in advance of learning that a predictive judgment would be required, then predictive source accuracy was well above chance. These data are suggestive that context information may not play a very large role in metacognitive judgments such as feeling-of-knowing ratings or putting one into a tip-of-the-tongue state without strong and specific encoding procedures. These same results also highlight the important role that item memory plays in retrieving information about the context in which an item was experienced.

Problems in the ontology of computer programs

Abstract: As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into a meaningful taxonomy? (2) To what ontology are computer programs committed? (3) What explains the proliferation of programming languages and how do they come about? Taking the complementary perspectives software engineering and mathematical logic, we take inventory of programs and related objects and conclude that the notions of abstraction and concretization take a central role in this investigation.

Departamento de Informatica

Abstract: This paper presents our experiences for integrating OMG MIOP (Multicast Inter-ORB Protocol) specifications into an ORB. We proposed a model of integration which allows the coexistence of two different protocol stacks (IIOP/TCP/IP and MIOP/UDP/IP multicast), making possible a wider spectrum of middleware support for distributed objects communication. That integration model is discussed in this paper, giving evidence of the accordance of our approach with the CORBA specifications. In order to evaluate that integration, differents tests were made considering the interoperability, performance and scalability aspects. The obtained results show that there is not a significant loss of performance with that integration model, which brings the advantages of the objects distributed programming for applications that before were limited to the UDP sockets and other lower-level interfaces.