Programming Languages and Theory of Computing

Read more
261 - 270 out of 272Page size: 10
  1. 1998
  2. Published

    Normalization for a Subset of Scheme using Type Predicates (Summary)

    Mogensen, Torben Ægidius, 1998, Preliminary Proceedings of the 1998 APPSEM Workshop on Normalization by Evaluation. Aarhus: BRICS Notes Series NS-98-1, p. 35-36

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

  3. Published

    Partial evaluation Concepts and Applications

    Mogensen, Torben Ægidius, 1998, Lecture Notes for the 1998 DIKU International Summer School on Partial Evaluation: Practice and Theory Volume 1: Practice and Experience using Partial Evaluators. Datalogisk Institut, Københavns Universitet, p. 1-19

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

  4. Published

    Types for 0, 1 or many uses, Lecture Notes in Computer Science, Vol.1467

    Mogensen, Torben Ægidius, 1998, publisher. Springer, p. 112-122

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

  5. 1997
  6. 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

  7. 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

  8. 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

  9. 1996
  10. Published

    Syntactic Properties of Polymorphic Subtyping

    Henglein, Fritz, 1996.

    Research output: Working paper › Research

  11. 1995
  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...23 24 25 26 27 28 Next