Department of Informatics

TU München - Fakultät für Informatik
Software & Systems Engineering Research Group

TUM
 
 

1997


PDF-Datei Christian Prehofer
An Object-Oriented Approach to Feature Interaction
IOS-Press, 1997
Publication   Details | Bibtex Entry

PDF-Datei Cornel Klein, Christian Prehofer, Bernhard Rumpe
Feature Specification and Refinement with State Transition Digrams
In Fourth IEEE Workshop on Feature Interactions in Telecommunications Networks and Distributed Systems, P. Dini (Eds.), IOS-Press, 1997
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
Feature-Oriented Programming: A Fresh Look at Objects
Springer, 1997
Publication   Details | Bibtex Entry

PDF-Datei Christian Prehofer
From Inheritance to Feature Interaction or Composing Monads
Technical Report, number TUM-I9715, , 1997
Technical Report   Details | Bibtex Entry

PDF-Datei Christian Prehofer
From Inheritance to Feature Interaction
In Special Issues in Object-Oriented Programming. (ECOOP 1996 Workshop on Composability Issues in Object-Orientation), Max Mühlhäuser (Eds.), dpunkt-Verlag, 1997
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
Higher-Order Functional-Logic Programming: A Systematic Development
In Second Fuji International Workshop on Functional and Logic Programming, T. Ida et al. (Eds.), World Scientific, 1997
Conference paper   Details | Bibtex Entry

1996


PDF-Datei Henrik Linnestad, Christian Prehofer und Olav Lysne
High-Order Proof by Consistency
Springer-Verlag, 1996
Publication   Details | Bibtex Entry

PDF-Datei Michael Hanus, Christian Prehofer
Higher-Order Narrowing with Definitional Trees
In Proc. Seventh International Conference on Rewriting Techniques and Applications (RTA'96), H. Ganzinger (Eds.), Springer, 1996
Conference paper   Details | Bibtex Entry

PDF-Datei Henrik Linnestad, Christian Prehofer, Olav Lysne
Higher-Order Proof by Consistency
In Proc. 16th Conf. Foundations of Software Technology and Theoretical Computer Science, Springer, 1996
Conference paper   Details | Bibtex Entry

1995


PDF-Datei Christian Prehofer
A Call-by-Need Strategy for Higher-Order Functional-Logic Programming.
In Logic Programming. Proc. of the 1995 International Symposium, J. Lloyd (Eds.), MIT Press, 1995
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
Higher-Order Narrowing with Convergent Systems
In Algebraic Methodology and Software Technology : 4th International Conference, AMAST '95, V.S. Alagar, M. Nivat (Eds.), Springer, 1995
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
Solving Higher-Order Equations: From Logic to Programming
number TUM-I9508, , 1995
Ph.D. Dissertation   Details | Bibtex Entry

PDF-Datei Tobias Nipkow, Christian Prehofer
Type Reconstruction for Type Classes
In Functional Programming, 1995
Journal article   Details | Bibtex Entry

1994


PDF-Datei Christian Prehofer
Decidable Higher-order Unification Problems
In Automated Deduction CADE-12, 12th International Conference on Automated Deduction, Springer, 1994
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
Higher-order Narrowing
In Proc. Ninth Annual IEEE Symposium on Logic in Computer Science LICS '94, IEEE Computer Society Press, 1994
Conference paper   Details | Bibtex Entry

PDF-Datei Manfred Broy, Ursula Hinkel, Tobias Nipkow, Christian Prehofer, Birgit Schieder
Interpreter Verification for a Functional Language
In Proc. 14th Conf. Foundations of Software Technology and Theoretical Computer Science, P.S. Thiagarajan (Eds.), pp. 77 - 88, 1994
Conference paper   Details | Bibtex Entry

PDF-Datei Christian Prehofer
On Modularity in Term Rewriting and Narrowing
In 1st International Conference on Constraints in Computational Logics, Jean-Pierre Jouannaud (Eds.), Springer, 1994
Conference paper   Details | Bibtex Entry

1993


PDF-Datei Tobias Nipkow, Christian Prehofer
Type Checking Type Classes
In Proc. 20th ACM Symp. Principles of Programming Languages, ACM Press, 1993
Conference paper   Details | Bibtex Entry

1992


PDF-Datei Christian Prehofer
An Efficient Constraint Language for Polymorphic Order-sorted Resolution
In Proc. Logics in AI, JELIA 92, LNCS 633 (Eds.), Springer, 1992
Conference paper   Details | Bibtex Entry