Meyer, Albert R.
Overview
Works:  58 works in 189 publications in 3 languages and 1,482 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Thesis advisor 
Classifications:  QA76.27, 004 
Publication Timeline
.
Most widely held works about
Albert R Meyer
Most widely held works by
Albert R Meyer
Research directions in computer science : an MIT perspective by Symposium on Research Direction in Computer Science(
Book
)
10 editions published in 1991 in English and German and held by 360 WorldCat member libraries worldwide
10 editions published in 1991 in English and German and held by 360 WorldCat member libraries worldwide
Logic at Botik '89 : symposium on logical foundations of computer science, PereslavlZalessky, USSR, July 38, 1989 : proceedings by
Albert R Meyer(
Book
)
23 editions published in 1989 in English and Italian and held by 332 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 PereslavlZalessky, USSR, July 38, 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
23 editions published in 1989 in English and Italian and held by 332 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 PereslavlZalessky, USSR, July 38, 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
Theoretical aspects of computer software : International Conference, TACS'91, Sendai, Japan, September 2427, 1991 : proceedings by
T Itō(
Book
)
14 editions published in 1991 in English and Italian and held by 265 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; theorybased systems for specifying, synthesizing, transforming, testing, and verifying software."PUBLISHER'S WEBSITE
14 editions published in 1991 in English and Italian and held by 265 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; theorybased 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
)
6 editions published between 1980 and 1981 in English and held by 18 WorldCat member libraries worldwide
6 editions published between 1980 and 1981 in English and held by 18 WorldCat member libraries worldwide
Bisimulation can't be traced by
Bard Bloom(
Book
)
7 editions published between 1987 and 1990 in English and Undetermined and held by 11 WorldCat member libraries worldwide
We show that bisimulation is not fully abstract with respect to any extension of CCS by CCSlike operations. We give a formal description of 'CCSlike, ' as GSOS and argue by proofs and counterexamples that this is indeed the right class. In the proof of nonfullabstraction a coarser version of bisimulation arises, a notion called ready simulation. We investigate the theory of ready simulation, showing that it possesses the basic properties which make bisimulation attractive. Like bisimulation, it possesses equivalent relational and logical characterizations; it has two additional equivalent characterizations as congruence with respect to all GSOS languages, and with respect to CCS extended by process copying and controlled communication operations
7 editions published between 1987 and 1990 in English and Undetermined and held by 11 WorldCat member libraries worldwide
We show that bisimulation is not fully abstract with respect to any extension of CCS by CCSlike operations. We give a formal description of 'CCSlike, ' as GSOS and argue by proofs and counterexamples that this is indeed the right class. In the proof of nonfullabstraction a coarser version of bisimulation arises, a notion called ready simulation. We investigate the theory of ready simulation, showing that it possesses the basic properties which make bisimulation attractive. Like bisimulation, it possesses equivalent relational and logical characterizations; it has two additional equivalent characterizations as congruence with respect to all GSOS languages, and with respect to CCS extended by process copying and controlled communication operations
Axiomatic definitions of programming languages, II by
Joseph Y Halpern(
Book
)
5 editions published in 1980 in English and held by 9 WorldCat member libraries worldwide
5 editions published in 1980 in English and held by 9 WorldCat member libraries worldwide
A note on equivalences among logics of programs by
Albert R Meyer(
Book
)
3 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
3 editions published in 1981 in English and held by 9 WorldCat member libraries worldwide
Computability and completeness in logics of programs by
Dudu Harel(
Book
)
3 editions published in 1978 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1978 in English and held by 8 WorldCat member libraries worldwide
Ten thousand and one logics of programming by
Albert R Meyer(
Book
)
3 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
Axiomatic definitions of programming languages : a theoretical assessment by
Albert R Meyer(
Book
)
3 editions published in 1980 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1980 in 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
)
3 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
3 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
Full abstraction and the Context Lemma by Trevor Jim(
Book
)
5 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 parallelor 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 lambdaterms in Scott's PCF. Any simply typed lambdacalculus with such a PCFlike 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 PCFlike rules. Stable functions, full abstraction, context lemma, PCF, standardization
5 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 parallelor 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 lambdaterms in Scott's PCF. Any simply typed lambdacalculus with such a PCFlike 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 PCFlike rules. Stable functions, full abstraction, context lemma, PCF, standardization
On time versus space III by
Albert R Meyer(
Book
)
3 editions published in 1980 in English and Undetermined and held by 7 WorldCat member libraries worldwide
3 editions published in 1980 in English and Undetermined and held by 7 WorldCat member libraries worldwide
From denotatonal [sic] to operational and axiomatic semantics for ALGOLlike languages : an overview by
B. A Trakhtenbrot(
Book
)
2 editions published between 1983 and 1984 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 1983 and 1984 in English and held by 7 WorldCat member libraries worldwide
Definability in dynamic logic by
Albert R Meyer(
Book
)
3 editions published in 1980 in English and Undetermined and held by 7 WorldCat member libraries worldwide
3 editions published in 1980 in English and Undetermined and held by 7 WorldCat member libraries worldwide
The deducibility problem in propositional dynamic logic by
Albert R Meyer(
Book
)
3 editions published in 1981 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1981 in English and held by 7 WorldCat member libraries worldwide
A note on the length of Craig's interpolants by
Albert R Meyer(
Book
)
4 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
4 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
Termination assertions for recursive programs : completeness and axiomatic definability by
Albert R Meyer(
Book
)
3 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
The semantics of local storage or what makes the freelist free? by
Joseph Y Halpern(
Book
)
3 editions published in 1984 in English and held by 7 WorldCat member libraries worldwide
3 editions published in 1984 in English and held by 7 WorldCat member libraries worldwide
[Omega](n log n) lower bounds on length of Boolean formulas by
Michael J Fischer(
Book
)
7 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
7 editions published in 1980 in English and held by 7 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Taitslin, M. A. (Mikhail A.) 1936 Editor
 Itō, T. (Takayasu) 1940 Author Editor
 Massachusetts Institute of Technology
 Itō, Takayasu
 Halpern, Joseph Y. Author
 Symposium on Logical Foundations of Computer Science (1, 1989, Pereslavl'Zalesskij)
 Massachusetts Institute of Technology Laboratory for Computer Science
 Trakhtenbrot, B. A. (Boris Avraamovich) Author
 Fischer, Michael J. Author
 Bloom, Bard Author
Associated Subjects
Algebra, Boolean ALGOL (Computer program language) Artificial intelligence Calculus CaliforniaPetaluma Combinatorial analysis Combinatory logic Computer programming Computer programsVerification Computers Computer science Computer scienceResearch Computer software Computer storage devices Denotational semantics Electronic data processing Fourth of July Functional programming (Computer science) Interpolation Lambda calculus Logic, Symbolic and mathematical Logic design Massachusetts Massachusetts Institute of Technology Parallel processing (Electronic computers) Predicate calculus Programming languages (Electronic computers) Programming languages (Electronic computers)Semantics Programming languages (Electronic computers)Syntax Recursive programming Rewriting systems (Computer science) Set theory Software engineering Turing machines