Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Home Topics Titles Quotes Blog Featured Help
Search
 
Hans J. Schneider
University of Erlangen
Erlangen, Germany
 

Hans Juergen Schneider is a professor emeritus of computer science at the University of Erlangen-Nuernberg (Germany). He obtained his Diploma in Mathematics from the University of Saarbruecken in 1961 and his Ph.D. from the Technical University of Hannover in 1965. Before moving to Erlangen, he was a professor at the Technical University of Berlin from 1970 to 1972.

His research interests lie mainly in the areas of graph transformations, programming language concepts, and programming methodology. In 1973, he was a co-author of the seminal paper on graph grammars, generalizing the concept of a formal language. In the 1980s and 1990s, he has published several papers applying this technique to describing asynchronous processes. In the programming language area, he has conducted research projects on set-theoretic concepts, on integrating physical units into the type system, and on a type system for asynchronous processes.

He has given lectures on using, designing, and implementing programming languages, as well as on the theoretical topics related to programming languages and programming methodology, such as syntax analysis, rewriting techniques, and efficient data structures, with special emphasis on integrating theoretical concepts into practical programming.

He joined ACM in 1964, and was involved in establishing the German chapter in 1968. He served as its vice chairman for several years. He chaired the program committee of the International Computing Symposium '83, organized by the European chapters of ACM, as well as the program committees of several national conferences, and was a member of many other program committees.

He has published a large number of journal and conference papers and handbooks, as well as textbooks on compiler construction and programming languages. Now, after retiring, he started to write a textbook on the categorical approach to graph transformations. He has written more than 70 reviews for Computing Reviews since 1977.


     

GXL: a graph-based standard exchange format for reengineering
Holt R., Schürr A., Sim S., Winter A. Science of Computer Programming 60(2): 149-170, 2006.  Type: Article

GXL provides a standardized notation for exchanging graphs, together with their structure definition, using Extensible Markup Language (XML) documents. Section 2 describes a variety of reengineering tools using graphs as an internal da...

 

Union types for object-oriented programming
Igarashi A., Nagira H.  Applied computing (Proceedings of the 2006 ACM Symposium on Applied Computing, Dijon, France, Apr 23-27, 2006) 1435-1441, 2006.  Type: Proceedings

Inheritance and subtyping differ, in that inheritance enables one class to reuse an implementation of another class, and subtyping supports the substitution of an object of a subtype for an object of the supertype. In Java, two classes...

 

Open data types and open functions
Löh A., Hinze R.  Principles and practice of declarative programming (Proceedings of the 8th ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, Venice, Italy, Jul 10-12, 2006) 133-144, 2006.  Type: Proceedings

Functional languages such as Haskell make it easy to add new functions, but extending data requires modifying existing code since all constructors must be defined at the same place. On the other hand, object-oriented languages support ...

 

Producing the left parse during bottom-up parsing
Slivnik B., Vilfan B. Information Processing Letters 96(6): 220-224, 2005.  Type: Article

Bottom-up parsing can be applied to all deterministic context-free languages. On the other hand, left parsing also has some advantages, for example, in error reporting. The left parse of a substring can be pushed on the stack together ...

 

Efficient subtyping tests with PQ-encoding
Gil J., Zibin Y. ACM Transactions on Programming Languages and Systems 27(5): 819-856, 2005.  Type: Article

In this paper, PQ-trees, used in graph theory to find the orderings that satisfy a collection of constraints, are applied to encode the type hierarchy of object-oriented programs. This leads to efficient subtyping tests....

 
  more...

 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy