WorldCat Identities

Meyer, Albert R.

Overview
Works: 76 works in 149 publications in 3 languages and 1,354 library holdings
Genres: Conference proceedings 
Roles: Editor, Thesis advisor
Classifications: QA76.27, 004
Publication Timeline
Key
Publications about  Albert R Meyer Publications about Albert R Meyer
Publications by  Albert R Meyer Publications by Albert R Meyer
Most widely held works about Albert R Meyer
 
Most widely held works by Albert R Meyer
Logic at Botik '89 : symposium on logical foundations of computer science, Pereslavl-Zalessky, USSR, July 3-8, 1989 : proceedings by Albert R Meyer ( Book )
20 editions published in 1989 in English and Italian and held by 373 WorldCat member libraries worldwide
"The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory."--Publisher's website
Research directions in computer science : an MIT perspective by Symposium on Research Direction in Computer Science ( Book )
9 editions published in 1991 in English and German and held by 361 WorldCat member libraries worldwide
Theoretical aspects of computer software : International Conference, TACS'91, Sendai, Japan, September 24-27, 1991 : proceedings by Takayasu Ito ( Book )
13 editions published in 1991 in English and held by 350 WorldCat member libraries worldwide
"TACS'91 is the first International Conference on Theoretical Aspects of Computer Science held at Tohoku University, Japan, in September 1991. This volume contains 37 papers and an abstract for the talks presented at the conference. TACS'91 focused on theoretical foundations of programming, and theoretical aspects of the design, analysis and implementation of programming languages and systems. The following range of topics is covered: logic, proof, specification and semantics of programs and languages; theories and models of concurrent, parallel and distributed computation; constructive logic, category theory, and type theory in computer science; theory-based systems for specifying, synthesizing, transforming, testing, and verifying software."--PUBLISHER'S WEBSITE
What is a model of the lambda calculus? by Albert R Meyer ( Book )
4 editions published between 1980 and 1981 in English and Undetermined and held by 18 WorldCat member libraries worldwide
Logic at botik '89 proceedings ( )
1 edition published in 1989 in English and held by 13 WorldCat member libraries worldwide
Bisimulation can't be traced by Bard Bloom ( Book )
5 editions published between 1987 and 1990 in English and Undetermined and held by 10 WorldCat member libraries worldwide
Abstract: "In the concurrent language CCS, two programs are considered the same if they are bisimilar. Several years and many researchers have demonstrated that the theory of bisimulation is mathematically appealing and useful in practice. However, bisimulation makes too many distinctions between programs. There are two programs P and Q which are not bisimilar, but nonetheless are interchangeable: one may be substituted for the other anywhere in a CCS program and no difference can be seen. Bisimulation is thus not fully abstract. We consider the problem of adding operations to CCS to make bisimulation fully abstract. It is trivial to add an operation achieving full abstraction, but this operation is rather peculiar
A note on equivalences among logics of programs by Albert R Meyer ( Book )
2 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
Axiomatic definitions of programming languages, II by Joseph Y Halpern ( Book )
3 editions published in 1980 in English and Undetermined and held by 9 WorldCat member libraries worldwide
Ten thousand and one logics of programming by Albert R Meyer ( Book )
2 editions published in 1980 in Undetermined and English and held by 8 WorldCat member libraries worldwide
The inherent computational complexity of theories of ordered sets : a brief survey by Albert R Meyer ( Book )
2 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
Logic at Botik'89 : proceedings : Symposium on logical foundations of computer science, Pereslavl-Zalessky, USSR, July 3-8, 1989 ; ed. A.R. Meyer, M.A. Taitslin by Albert R Meyer ( Book )
1 edition published in 1989 in English and held by 8 WorldCat member libraries worldwide
On time versus space III by Albert R Meyer ( Book )
2 editions published in 1980 in Undetermined and English and held by 7 WorldCat member libraries worldwide
Full abstraction and the Context Lemma by Trevor Jim ( Book )
4 editions published in 1991 in English and held by 7 WorldCat member libraries worldwide
It is impossible to add a combinator to PCF to achieve full abstraction for models such as Berry's stable domains in a way analogous to the addition of the parallel-or combinator that achieves full abstraction for the familiar cpo model. In particular, we define a general notion of rewriting system of the kind used for evaluating simply typed lambda-terms in Scott's PCF. Any simply typed lambda-calculus with such a PCF-like rewriting semantics is shown necessarily to satisfy Milner's Context Lemma. A simple argument demonstrates that any denotational semantics that is adequate for PCF, and in which certain simple Boolean functionals exist, cannot be fully abstract for any extension of PCF satisfying the Context Lemma. An immediate corollary is that stable domains cannot be fully abstract for any extension of PCF definable by PCF-like rules. Stable functions, full abstraction, context lemma, PCF, standardization
Computability and completeness in logics of programs by Dudu Harel ( Book )
2 editions published in 1978 in Undetermined and English and held by 7 WorldCat member libraries worldwide
Axiomatic definitions of programming languages : a theoretical assessment by Albert R Meyer ( Book )
1 edition published in 1980 in English and held by 7 WorldCat member libraries worldwide
The deducibility problem in propositional dynamic logic by Albert R Meyer ( Book )
2 editions published in 1981 in English and held by 7 WorldCat member libraries worldwide
Termination assertions for recursive programs : completeness and axiomatic definability by Albert R Meyer ( Book )
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
Definability in dynamic logic by Albert R Meyer ( Book )
2 editions published in 1980 in Undetermined and English and held by 7 WorldCat member libraries worldwide
From denotatonal [sic] to operational and axiomatic semantics for ALGOL-like languages : an overview by B. A Trakhtenbrot ( Book )
1 edition published in 1983 in English and held by 7 WorldCat member libraries worldwide
A note on the length of Craig's interpolants by Albert R Meyer ( Book )
2 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.79 (from 0.10 for A.R. "Tony ... to 0.96 for Axiomatic ...)
Alternative Names
Meyer, A. R.
Meyer, A. R. (Albert R.)
Meyer, Albert
Meyer, Albert R.
Languages
English (72)
German (1)
Italian (1)
Covers