BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
1 × Israel
1 × Sweden
2 × United Kingdom
21 × USA
Collaborated with:
J.Y.Halpern V.Tannen M.J.Fischer J.G.Riecke J.C.Mitchell R.Parikh K.Winklmann L.Jategaonkar K.Sieber M.B.Reinhold I.Greif A.R.Bruss L.J.Stockmeyer A.Bagchi E.M.McCreight S.S.Cosmadakis B.Bloom S.Istrail B.A.Trakhtenbrot R.S.Streett G.Mirkowska D.Harel V.R.Pratt P.A.Bloniarz E.Cardoza R.J.Lipton M.Paterson N.A.Lynch E.Moggi R.Statman A.K.Chandra R.L.Rivest D.J.Kleitman J.Spencer
Talks about:
preliminari (6) program (6) logic (6) semant (5) report (5) comput (5) type (5) complet (4) defin (4) problem (3)

Person: Albert R. Meyer

DBLP DBLP: Meyer:Albert_R=

Contributed to:

ICALP 19931993
LICS 19901990
LFP 19881988
LICS 19881988
POPL 19881988
LICS 19871987
POPL 19871987
LICS 19861986
POPL 19861986
POPL 19841984
POPL 19821982
ICALP 19811981
POPL 19811981
STOC 19811981
POPL 19801980
STOC 19801980
POPL 19791979
STOC 19791979
STOC 19781978
STOC 19771977
ICALP 19761976
STOC 19761976
STOC 19751975
STOC 19731973
STOC 19721972
STOC 19691969

Wrote 30 papers:

ICALP-1993-JategaonkarM #concurrent #finite
Deciding True Concurrency Equivalences on Finite Sate Nets (LJ, ARM), pp. 519–531.
LICS-1990-CosmadakisMR #lazy evaluation
Completeness for typed lazy inequalities (SSC, ARM, JGR), pp. 312–320.
LFP-1988-MeyerR #continuation
Continuations May be Unreasonable (ARM, JGR), pp. 63–71.
LICS-1988-Meyer #paradigm #semantics
Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis (ARM), pp. 236–253.
POPL-1988-BloomIM #bisimulation
Bisimulation Can’t Be Traced (BB, SI, ARM), pp. 229–239.
POPL-1988-MeyerS #semantics #towards
Towards Fully Abstract Semantics for Local Variables (ARM, KS), pp. 191–203.
LICS-1987-Breazu-TannenM #morphism #polymorphism
Polymorphism is conservative over simple types (VT, ARM), pp. 7–17.
POPL-1987-MeyerMMS #polymorphism #λ-calculus
Empty Types in Polymorphic λ Calculus (ARM, JCM, EM, RS), pp. 253–262.
Computable Values Can Be Classical (VT, ARM), pp. 238–245.
LICS-1986-Meyer #hoare #logic #semantics
Floyd-Hoare Logic Defines Semantics: Preliminary Version (ARM), pp. 44–48.
“Type” Is Not A Type (ARM, MBR), pp. 287–295.
POPL-1984-HalpernMT #question #semantics #what
The Semantics of Local Storage, or What Makes the Free-List Free? (JYH, ARM, BAT), pp. 245–257.
POPL-1982-MeyerM #axiom #recursion #source code
Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
ICALP-1981-MeyerSM #deduction #logic #problem
The Deducibility Problem in Propositional Dynamic Logic (ARM, RSS, GM), pp. 238–248.
POPL-1981-HalpernM #axiom #programming language
Axiomatic Definitions of Programming Languages, II (JYH, ARM), pp. 139–148.
STOC-1981-ChandraHMP #equation #logic #process
Equations between Regular Terms and an Application to Process Logic (AKC, JYH, ARM, RP), pp. 384–390.
POPL-1980-MeyerH #assessment #axiom #programming language
Axiomatic Definitions of Programming Languages: A Theoretical Assessment (ARM, JYH), pp. 203–212.
STOC-1980-MeyerP #logic
Definability in Dynamic Logic (ARM, RP), pp. 1–7.
POPL-1979-GreifM #programming language #semantics #specification
Specifying Programming Language Semantics (IG, ARM), pp. 180–189.
STOC-1979-MeyerW #logic #on the #power of
On the Expressive Power of Dynamic Logic (ARM, KW), pp. 167–175.
STOC-1978-BrussM #formal method #on the
On Time-Space Classes and Their Relation to the Theory of Real Addition (ARB, ARM), pp. 233–239.
STOC-1978-RivestMKWS #fault
Coping with Errors in Binary Search Procedures (RLR, ARM, DJK, KW, JS), pp. 227–232.
STOC-1977-HarelMP #logic #source code
Computability and Completeness in Logics of Programs (DH, ARM, VRP), pp. 261–268.
ICALP-1976-BloniarzFM #transitive
A Note on the Average Time to Compute Transitive Closures (PAB, MJF, ARM), pp. 425–434.
STOC-1976-CardozaLM #commutative #exponential #petri net #problem
Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report (EC, RJL, ARM), pp. 50–54.
STOC-1975-FischerMP #bound
Lower Bounds on the Size of Boolean Formulas: Preliminary Report (MJF, ARM, MP), pp. 37–44.
STOC-1973-LynchMF #set
Sets that Don’t Help (NAL, ARM, MJF), pp. 130–134.
STOC-1973-StockmeyerM #exponential #problem #word
Word Problems Requiring Exponential Time: Preliminary Report (LJS, ARM), pp. 1–9.
Program Size and Economy of Descriptions: Preliminary Report (ARM, AB), pp. 183–186.
STOC-1969-McCreightM #bound
Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report (EMM, ARM), pp. 79–88.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.