E. G. Wagner

Publications
Influence

Initial Algebra Semantics and Continuous Algebras

J. Goguen, J. Thatcher, E. G. Wagner, J. Wright
Mathematics, Computer Science
JACM
1977

An overview of initial algebra semantics which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as basic operations. Expand

Advances in managing chronic disease

R. Davis, E. G. Wagner, T. Groves
Medicine
BMJ : British Medical Journal
26 February 2000

Chronic diseases have been around as long as humans. But now, in most industrialised nations and in many developing countries, they predominate among the leading causes of death.1 For many years… Expand

Data type specification: Parameterization and the power of specification techniques

J. Thatcher, E. G. Wagner, J. Wright
Mathematics, Computer Science
STOC '78
1 May 1978

This paper extends our earlier work on abstract data types by providing an algebraic treatment of parametrized data types (e.g., sets-of-(), stacks-of, etc. Expand

Data Type Specification: Parameterization and the Power of Specification Techniques

J. Thatcher, E. G. Wagner, J. Wright
Computer Science
TOPL
1 October 1982

We investigate the "hidden function" problem (the need to include operat ions in specifications which we want to be hidden from the user); we prove that condit ional specifications are inherently more powerful than equational specifications; we compare the power of the algebraic approach taken here with the categorical approach of Lehman and Smyth . Expand

More on Advice on Structuring Compilers and Proving Them Correct

J. Thatcher, E. G. Wagner, J. Wright
Computer Science
ICALP
16 July 1979

This paper can be seen as the fourth in the sequence: McCarthy and Painter (1967), Burstall and Landin (1970) and Morris (1973). Expand

A Uniform Approach to Inductive Posets and Inductive Closure

J. Wright, E. G. Wagner, J. Thatcher
Computer Science, Mathematics
Theor. Comput. Sci.
1978

Abstract The definition scheme, “A poset P is Z -inductive if it has a subposet B of Z -compact lements such that for every element of p of P there is a Z -set S in B such that p = ⨆S, becomes meaningful when we replace the symbol of Z by such adjectives as "sirected" and "chain" . Expand

Rational algebraic theories and fixed-point solutions

J. Wright, J. Thatcher, E. G. Wagner, J. Goguen
Computer Science
17th Annual Symposium on Foundations of Computer…
25 October 1976

In a wide variety of situations, computer science has found it convenient to define complex object as (fixed-point) solutions of certain equations. Expand

Parameter Passing in Algebraic Specification Languages

H. Ehrig, H. Kreowski, J. Thatcher, E. G. Wagner, J. Wright
Computer Science, Mathematics
Theor. Comput. Sci.
1984

We study the semantics of the parameter passing mechanism in algebraic specification languages. Expand

Parameter Passing in Algebraic Specification Languages

H. Ehrig, H. Kreowski, J. Thatcher, E. G. Wagner, J. Wright
Computer Science
Program Specification
1 August 1981

We study the semantics of the parameter passing mechanism in algebraic specification languages. Expand

Some Fundamentals of Order-Algebraic Semantics

E. G. Wagner, J. Wright, J. Goguen, J. Thatcher
Computer Science
MFCS
6 September 1976

The order-theoretic enrichment of the algebraic approach to theoretical computer science, and to programming in particular, can be accomplished rather directly and elegantly, and appears to have a wide range of applications. Expand

Recommended Authors