Eric G. Wagner

Affiliations:
  • Wagner Mathematics, Garrison, NY, USA
  • IBM T. J. Watson Research Center, Yorktown Heights, NY, USA (former)


According to our database1, Eric G. Wagner authored at least 43 papers between 1959 and 2005.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
Relationships Between Equational and Inductive Data Types.
Proceedings of the Formal Methods in Software and Systems Modeling, 2005

2002
Algebraic Specifications: some old history and new thoughts.
Nord. J. Comput., 2002

1999
Guarded Algebras: Disguising Partiality so You Won't Know Whether It's There.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1999

1995
On the Role of Memory in Object-Based and Object-Oriented Languages.
Theor. Comput. Sci., 1995

Fix-point Semantics for Programs in Distributive Categories.
Fundam. Informaticae, 1995

1992
Overloading and Inheritance.
Proceedings of the Recent Trends in Data Type Specification, 1992

1991
Generic Classes in an Object-Based Language.
Proceedings of the Recent Trends in Data Type Specification, 1991

1990
An Algebraically Specified Language for Data Directed Design.
Theor. Comput. Sci., 1990

Algebras, Polynomials and Programs.
Theor. Comput. Sci., 1990

Generic Types in a Language for Data Directed Design.
Proceedings of the Recent Trends in Data Type Specification, 1990

1988
On Declarations.
Proceedings of the Categorial Methods in Computer Science: With Aspects from Topology [Workshop, 1988

All recursive types defined using products and sums can be implemented using pointers.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

Algebraic Data Types and Object-Oriented Programming.
Proceedings of the 6st Workshop on Abstract Data Type, 1988. University of Berlin, Germany, 1988

1987
Canonical Constraints for Parameterized Data Types.
Theor. Comput. Sci., 1987

A Categorical Treatment of Pre- and Post-Conditions.
Theor. Comput. Sci., 1987

Semantics of Block Structured Languages with Pointers.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

1985
A Categorical View of Weakest Liberal Preconditions.
Proceedings of the Category Theory and Computer Programming, 1985

Categories, Data Types and Imperative Languages.
Proceedings of the Category Theory and Computer Programming, 1985

1984
Parameter Passing in Algebraic Specification Languages.
Theor. Comput. Sci., 1984

Categorical Semantics, Or Extending Data Types to Include Memory.
Proceedings of the Recent Trends in Data Type Specification, 1984

1983
Recursion and Iteration in Continuous Theories: The "M-Construction".
J. Comput. Syst. Sci., 1983

Algebraic Specifications with Generating Constraints.
Proceedings of the Automata, 1983

1982
Data Type Specification: Parameterization and the Power of Specification Techniques.
ACM Trans. Program. Lang. Syst., 1982

Functorial Hierarchies of Functional Languages.
Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981
More on Advice on Structuring Compilers and Proving them Correct.
Theor. Comput. Sci., 1981

1980
Parameterized Data Types in Algebraic Specification Languages (Short Version).
Proceedings of the Automata, 1980

1978
A Uniform Approach to Inductive Posets and Inductive Closure.
Theor. Comput. Sci., 1978

Programming Languages as Mathematical Objects.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978

1977
Initial Algebra Semantics and Continuous Algebras.
J. ACM, 1977

1976
Some Fundamentals of Order-Algebraic Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

Rational Algebraic Theories and Fixed-Point Solutions
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1974
Factorizations, Congruences, and the Decomposition of Automata and Systems.
Proceedings of the Mathematical Foundations of Computer Science, 1974

1973
From Algebras to Programming Languages
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972
Bounded action machines II: The basic structure of Tapeless computers.
Computing, 1972

1971
An Algebraic Theory of Recursive Definitions and Recursive Languages
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

Languages for Defining Sets in Arbitrary Algebras
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970
R70-32 Tessellation Automata.
IEEE Trans. Computers, 1970

1969
Uniformly reflexive structures: An axiomatic approach to computability.
Inf. Sci., 1969

1968
Bounded Action Machines: Toward an Abstract Theory of Computer Structure.
J. Comput. Syst. Sci., 1968

"Tapeless" Bounded Action Machines
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
On the Structure of Programming Languages, or, Six Languages for Turing Machines
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966
On Connecting Modules Together Uniformly to Form a Modular Computer.
IEEE Trans. Electron. Comput., 1966

1959
Algebraic Topological Methods for the Synthesis of Switching Systems - Part III: Minimization of Nonsingular Boolean Trees.
IBM J. Res. Dev., 1959


  Loading...