Fritz Henglein

Fritz Henglein

Professor

ORCID: 0000-0001-5190-2125

Introductory remarks on publicationslist

The publications registered in CURIS (this system) and PUF (previous publication registration system at U. Copenhagen) are unfortunately incomplete and partially incorrect (particularly for PUF-registered publications). Since the registered information is practically very difficult to change at this point, for full information, including access to PDF-version of the papers, please see my home page: https://www.diku.dk/~henglein.

 


Publication year:
All
71 - 80 out of 95Page size: 10
  1. 1998
  2. Published

    Constraint Automata and the Complexity of Recursive Subtype Entailment, Lecture Notes in Computer Science, Vol.1443

    Henglein, Fritz & Rehof, J., 1998, Proceedings of the 25th International Coll. on Automata, Languages and Programming (ICALP). Springer, p. 616-627

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  3. Published

    SIGPLAN and the World Series

    Henglein, Fritz, 1998, In: A C M / S I G P L A N Notices. 33, 1

    Research output: Contribution to journal › Editorial › Research

  4. 1997
  5. Published

    Coinductive axiomatization of recursive type equality and subtyping

    Brandt, M. & Henglein, Fritz, 1997, Proceedings of The 3rd International Conference on Typed Lambda Calculi and Applications. Springer, p. 63-81

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  6. Published

    Breaking through the n^3 barrier: Faster object type inference

    Henglein, Fritz, 1997, Proceedings of the 4th International Workshop on Foundations of Object-Oriented Languages (FOOL). Internetpublikation

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  7. Published

    The Complexity of Subtype Entailment for Simple Types

    Henglein, Fritz & Rehof, N. J., 1997, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS). Warszawa, Polen: IEEE Computer Society Press, p. 352-361

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  8. 1996
  9. Published

    Syntactic Properties of Polymorphic Subtyping

    Henglein, Fritz, 1996.

    Research output: Working paper › Research

  10. 1995
  11. Published

    Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

    Dussart, D., Henglein, Fritz & Mossin, C., 1995, Proc. 2nd Int'l Static Analysis Symposium (SAS). Springer, Vol. LNCS.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

  12. Published

    Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time

    Dussart, D., Henglein, Fritz & Mossin, C., 1995, Proc.\2nd Int. Static Analysis Symposium (SAS), Glasgow, Scotland. Springer

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  13. Published

    A Semantic Model of Binding Times for Safe Partial Evaluation

    Henglein, Fritz & Sands, D., 1995, Proc.\Programming Languages: Implementations, Logics and Programs (PLILP, Utrecht, The Netherlands, Lecture Notes in Computer Science. Springer

    Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research

  14. Published

    Safe Polymorphic Type Inference for a Dynamically Typed Language: Translating Scheme to ML

    Henglein, Fritz & Rehof, J., 1995, FPCA '95: Proceedings of the seventh international conference on Functional programming languages and computer architecture. Association for Computing Machinery, p. 192--203 12 p.

    Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Previous 1...4 5 6 7 8 9 10 Next

ID: 7193