@inproceedings{HengleinM94:0, title = {Polymorphic Binding-Time Analysis}, author = {Fritz Henglein and Christian Mossin}, year = {1994}, url = {http://www.springerlink.com/content/p8g505w5304226t7/}, tags = {type inference, rule-based, data-flow language, analysis, type system, binding-time, data-flow, partial evaluation, data-flow analysis}, researchr = {https://researchr.org/publication/HengleinM94%3A0}, cites = {0}, citedby = {0}, pages = {287-301}, booktitle = {Programming Languages and Systems - ESOP 94, 5th European Symposium on Programming, Edinburgh, U.K., April 11-13, 1994, Proceedings}, editor = {Donald Sannella}, volume = {788}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-57880-3}, } @article{AndersenEHSS06, title = {Compositional specification of commercial contracts}, author = {Jesper Andersen and Ebbe Elsborg and Fritz Henglein and Jakob Grue Simonsen and Christian Stefansen}, year = {2006}, doi = {10.1007/s10009-006-0010-1}, url = {http://dx.doi.org/10.1007/s10009-006-0010-1}, tags = {contracts, composition}, researchr = {https://researchr.org/publication/AndersenEHSS06}, cites = {0}, citedby = {0}, journal = {STTT}, volume = {8}, number = {6}, pages = {485-516}, } @article{Henglein98, title = {SIGPLAN and the World Series}, author = {Fritz Henglein}, year = {1998}, researchr = {https://researchr.org/publication/Henglein98}, cites = {0}, citedby = {0}, journal = {SIGPLAN Notices}, volume = {33}, number = {1}, pages = {1-2}, } @article{PaigeH87, title = {Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study}, author = {Robert Paige and Fritz Henglein}, year = {1987}, tags = {translation, case study}, researchr = {https://researchr.org/publication/PaigeH87}, cites = {0}, citedby = {0}, journal = {Journal of Symbolic Computation}, volume = {4}, number = {2}, pages = {207-232}, } @inproceedings{Henglein:PEPM:2010, title = {Optimizing Relational Algebra Operations Using Generic Equivalence Discriminators and Lazy Products}, author = {Fritz Henglein}, tags = {laziness, optimization, relational algebra, algebra}, researchr = {https://researchr.org/publication/Henglein%3APEPM%3A2010}, cites = {0}, citedby = {0}, booktitle = {Proceedings of the {ACM SIGPLAN} 2010 Workshop on Partial Evaluation and Program Manipulation}, editor = {John P. Gallagher and Janis Voigtländer}, publisher = {ACM}, } @inproceedings{Henglein88, title = {Type Inference and Semi-Unification}, author = {Fritz Henglein}, year = {1988}, doi = {10.1145/62678.62701}, url = {http://doi.acm.org/10.1145/62678.62701}, tags = {type inference}, researchr = {https://researchr.org/publication/Henglein88}, cites = {0}, citedby = {0}, pages = {184-197}, booktitle = {LISP and Functional Programming}, } @article{Henglein93, title = {Type Inference with Polymorphic Recursion}, author = {Fritz Henglein}, year = {1993}, doi = {10.1145/169701.169692}, url = {http://doi.acm.org/10.1145/169701.169692}, tags = {type inference}, researchr = {https://researchr.org/publication/Henglein93}, cites = {0}, citedby = {0}, journal = {ACM Transactions on Programming Languages and Systems}, volume = {15}, number = {2}, pages = {253-289}, } @inproceedings{Henglein10, title = {Optimizing relational algebra operations using generic equivalence discriminators and lazy products}, author = {Fritz Henglein}, year = {2010}, doi = {10.1145/1706356.1706372}, url = {http://doi.acm.org/10.1145/1706356.1706372}, tags = {laziness, optimization, relational algebra, algebra}, researchr = {https://researchr.org/publication/Henglein10}, cites = {0}, citedby = {0}, pages = {73-82}, booktitle = {Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM 2010, Madrid, Spain, January 18-19, 2010}, editor = {John P. Gallagher and Janis Voigtländer}, publisher = {ACM}, isbn = {978-1-60558-727-1}, } @inproceedings{AndersenEHSS04, title = {Compositional Specification of Commercial Contracts}, author = {Jesper Andersen and Ebbe Elsborg and Fritz Henglein and Jakob Grue Simonsen and Christian Stefansen}, year = {2004}, tags = {contracts, composition}, researchr = {https://researchr.org/publication/AndersenEHSS04}, cites = {0}, citedby = {0}, pages = {103-110}, booktitle = {International Symposium on Leveraging Applications of Formal Methods, ISoLA 2004, October 30 - November 2, 2004, Paphos, Cyprus. Preliminary proceedings}, editor = {Tiziana Margaria and Bernhard Steffen and Anna Philippou and Manfred Reitenspieß}, volume = {TR-2004-6}, series = {Technical Report}, publisher = {Department of Computer Science, University of Cyprus}, } @inproceedings{BrandtH97, title = {Coinductive Axiomatization of Recursive Type Equality and Subtyping}, author = {Michael Brandt and Fritz Henglein}, year = {1997}, tags = {subtyping}, researchr = {https://researchr.org/publication/BrandtH97}, cites = {0}, citedby = {0}, pages = {63-81}, booktitle = {Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA 97, Nancy, France, April 2-4, 1997, Proceedings}, editor = {Philippe de Groote}, volume = {1210}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-62688-3}, } @article{BrandtH98, title = {Coinductive Axiomatization of Recursive Type Equality and Subtyping}, author = {Michael Brandt and Fritz Henglein}, year = {1998}, tags = {subtyping}, researchr = {https://researchr.org/publication/BrandtH98}, cites = {0}, citedby = {0}, journal = {Fundamenta Informaticae}, volume = {33}, number = {4}, pages = {309-338}, } @article{DanvyHMP05, title = {Editorial}, author = {Olivier Danvy and Fritz Henglein and Harry G. Mairson and Alberto Pettorossi}, year = {2005}, doi = {10.1007/s10990-005-7001-x}, url = {http://dx.doi.org/10.1007/s10990-005-7001-x}, researchr = {https://researchr.org/publication/DanvyHMP05}, cites = {0}, citedby = {0}, journal = {Higher-Order and Symbolic Computation}, volume = {18}, number = {1-2}, pages = {5-6}, } @inproceedings{DussartHM95, title = {Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time}, author = {Dirk Dussart and Fritz Henglein and Christian Mossin}, year = {1995}, tags = {analysis, subtyping}, researchr = {https://researchr.org/publication/DussartHM95}, cites = {0}, citedby = {0}, pages = {118-135}, booktitle = {Static Analysis, Second International Symposium, SAS 95, Glasgow, UK, September 25-27, 1995, Proceedings}, editor = {Alan Mycroft}, volume = {983}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-60360-3}, } @inproceedings{EidorffHMNST99, title = {AnnoDomini: From Type Theory to Year 2000 Conversion Tool}, author = {Peter Harry Eidorff and Fritz Henglein and Christian Mossin and Henning Niss and Morten Heine Sørensen and Mads Tofte}, year = {1999}, doi = {10.1145/292540.292543}, url = {http://doi.acm.org/10.1145/292540.292543}, tags = {type theory}, researchr = {https://researchr.org/publication/EidorffHMNST99}, cites = {0}, citedby = {0}, pages = {1-14}, booktitle = {POPL}, } @inproceedings{HengleinM91, title = {The Complexity of Type Inference for Higher-Order Typed Lambda Calculi}, author = {Fritz Henglein and Harry G. Mairson}, year = {1991}, tags = {type inference}, researchr = {https://researchr.org/publication/HengleinM91}, cites = {0}, citedby = {0}, pages = {119-130}, booktitle = {POPL}, } @article{Henglein09, title = {What is a Sorting Function?}, author = {Fritz Henglein}, year = {2009}, doi = {10.1016/j.jlap.2008.12.003}, url = {http://dx.doi.org/10.1016/j.jlap.2008.12.003}, researchr = {https://researchr.org/publication/Henglein09}, cites = {0}, citedby = {0}, journal = {Journal of Logic and Algebraic Programming}, volume = {78}, number = {7}, pages = {552-572}, } @inproceedings{HengleinR97, title = {The Complexity of Subtype Entailment for Simple Types}, author = {Fritz Henglein and Jakob Rehof}, year = {1997}, url = {http://www.computer.org/proceedings/lics/7925/79250352abs.htm}, tags = {subtyping}, researchr = {https://researchr.org/publication/HengleinR97}, cites = {0}, citedby = {0}, pages = {352-361}, booktitle = {LICS}, } @article{Henglein99, title = {Breaking Through the n:::3::: Barrier: Faster Object Type Inference}, author = {Fritz Henglein}, year = {1999}, tags = {type inference}, researchr = {https://researchr.org/publication/Henglein99}, cites = {0}, citedby = {0}, journal = {TAPOS}, volume = {5}, number = {1}, pages = {57-72}, } @article{Henglein94, title = {Dynamic Typing: Syntax and Proof Theory}, author = {Fritz Henglein}, year = {1994}, tags = {type theory}, researchr = {https://researchr.org/publication/Henglein94}, cites = {0}, citedby = {0}, journal = {Science of Computer Programming}, volume = {22}, number = {3}, pages = {197-230}, } @inproceedings{Henglein90, title = {Fast Left-Linear Semi-Unification}, author = {Fritz Henglein}, year = {1990}, researchr = {https://researchr.org/publication/Henglein90}, cites = {0}, citedby = {0}, pages = {82-91}, booktitle = {Advances in Computing and Information - ICCI 90, International Conference on Computing and Information, Niagara Falls, Canada, May 23-26, 1990, Proceedings}, editor = {Selim G. Akl and Frantisek Fiala and Waldemar W. Koczkodaj}, volume = {468}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-53504-7}, } @inproceedings{Henglein08, title = {Generic discrimination: sorting and paritioning unshared data in linear time}, author = {Fritz Henglein}, year = {2008}, doi = {10.1145/1411204.1411220}, url = {http://doi.acm.org/10.1145/1411204.1411220}, tags = {data-flow}, researchr = {https://researchr.org/publication/Henglein08}, cites = {0}, citedby = {0}, pages = {91-102}, booktitle = {Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, ICFP 2008, Victoria, BC, Canada, September 20-28, 2008}, editor = {James Hook and Peter Thiemann}, publisher = {ACM}, isbn = {978-1-59593-919-7}, } @article{HengleinLSS09, title = {POETS: Process-oriented event-driven transaction systems}, author = {Fritz Henglein and Ken Friis Larsen and Jakob Grue Simonsen and Christian Stefansen}, year = {2009}, doi = {10.1016/j.jlap.2008.08.007}, url = {http://dx.doi.org/10.1016/j.jlap.2008.08.007}, researchr = {https://researchr.org/publication/HengleinLSS09}, cites = {0}, citedby = {0}, journal = {Journal of Logic and Algebraic Programming}, volume = {78}, number = {5}, pages = {381-401}, } @inproceedings{LeissH91, title = {A Decidable Case of the Semi-Unification Problem}, author = {Hans Leiß and Fritz Henglein}, year = {1991}, researchr = {https://researchr.org/publication/LeissH91}, cites = {0}, citedby = {0}, pages = {318-327}, booktitle = {Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS 91, Kazimierz Dolny, Poland, September 9-13, 1991, Proceedings}, editor = {Andrzej Tarlecki}, volume = {520}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-54345-7}, } @inproceedings{EidorffHMNST99:0, title = {AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem}, author = {Peter Harry Eidorff and Fritz Henglein and Christian Mossin and Henning Niss and Morten Heine Sørensen and Mads Tofte}, year = {1999}, url = {http://link.springer.de/link/service/series/0558/bibs/1581/15810006.htm}, tags = {systematic-approach}, researchr = {https://researchr.org/publication/EidorffHMNST99%3A0}, cites = {0}, citedby = {0}, pages = {6-13}, booktitle = {Typed Lambda Calculi and Applications, 4th International Conference, TLCA 99, L Aquila, Italy, April 7-9, 1999, Proceedings}, editor = {Jean-Yves Girard}, volume = {1581}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-65763-0}, } @inproceedings{PaigeH85, title = {Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study}, author = {Robert Paige and Fritz Henglein}, year = {1985}, tags = {translation, case study}, researchr = {https://researchr.org/publication/PaigeH85}, cites = {0}, citedby = {0}, pages = {554-567}, booktitle = {EUROCAL 85, European Conference on Computer Algebra, Linz, Austria, April 1-3, 1985, Proceedings Volume 2: Research Contributions}, editor = {B. F. Caviness}, volume = {204}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-15984-3}, } @inproceedings{HengleinS95, title = {A Semantic Model of Binding Times for Safe Partial Evaluation}, author = {Fritz Henglein and David Sands}, year = {1995}, tags = {partial evaluation}, researchr = {https://researchr.org/publication/HengleinS95}, cites = {0}, citedby = {0}, pages = {299-320}, booktitle = {Programming Languages: Implementations, Logics and Programs, 7th International Symposium, PLILP 95, Utrecht, The Netherlands, September 20-22, 1995, Proceedings}, editor = {Manuel V. Hermenegildo and S. Doaitse Swierstra}, volume = {982}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-60359-X}, } @inproceedings{Henglein92, title = {Global Tagging Optimization by Type Inference}, author = {Fritz Henglein}, year = {1992}, doi = {10.1145/141471.141542}, url = {http://doi.acm.org/10.1145/141471.141542}, tags = {optimization, type inference, tagging}, researchr = {https://researchr.org/publication/Henglein92}, cites = {0}, citedby = {0}, pages = {205-215}, booktitle = {Proceedings of the 1992 ACM Conference on LISP and Functional Programming}, series = {LFP '92}, address = {New York, NY, USA}, publisher = {Association for Computing Machinery}, } @inproceedings{HengleinMN01, title = {A Direct Approach to Control-Flow Sensitive Region-Based Memory Management}, author = {Fritz Henglein and Henning Makholm and Henning Niss}, year = {2001}, tags = {rule-based, memory management, data-flow, systematic-approach}, researchr = {https://researchr.org/publication/HengleinMN01}, cites = {0}, citedby = {0}, pages = {175-186}, booktitle = {Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, September 5-7, 2001, Florence, Italy}, publisher = {ACM}, isbn = {1-58113-388-X}, } @inproceedings{Henglein94:0, title = {Iterative Fixed Point Computation for Type-Based Strictness Analysis}, author = {Fritz Henglein}, year = {1994}, tags = {rule-based, analysis}, researchr = {https://researchr.org/publication/Henglein94%3A0}, cites = {0}, citedby = {0}, pages = {395-407}, booktitle = {SAS}, } @inproceedings{HengleinR98, title = {Constraint Automata and the Complexity of Recursive Subtype Entailment}, author = {Fritz Henglein and Jakob Rehof}, year = {1998}, url = {http://link.springer.de/link/service/series/0558/bibs/1443/14430616.htm}, tags = {constraints, subtyping}, researchr = {https://researchr.org/publication/HengleinR98}, cites = {0}, citedby = {0}, pages = {616-627}, booktitle = {Automata, Languages and Programming, 25th International Colloquium, ICALP 98, Aalborg, Denmark, July 13-17, 1998, Proceedings}, editor = {Kim Guldstrand Larsen and Sven Skyum and Glynn Winskel}, volume = {1443}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-64781-3}, } @article{DanvyHMP03, title = {Editorial: Special Issue Dedicated to Bob Paige}, author = {Olivier Danvy and Fritz Henglein and Harry G. Mairson and Alberto Pettorossi}, year = {2003}, doi = {10.1023/A:1023059701827}, url = {http://dx.doi.org/10.1023/A:1023059701827}, researchr = {https://researchr.org/publication/DanvyHMP03}, cites = {0}, citedby = {0}, journal = {Higher-Order and Symbolic Computation}, volume = {16}, number = {1-2}, pages = {5-6}, } @inproceedings{Henglein91, title = {Efficient Type Inference for Higher-Order Binding-Time Analysis}, author = {Fritz Henglein}, year = {1991}, url = {http://www.springerlink.com/content/y255468h30456660/}, tags = {type inference, rule-based, program analysis, variable binding, refinement, analysis, constraints, type system, binding-time, rules, transformation system, e-science, compiler, context-aware, higher-order transformations, transformation, program transformation}, researchr = {https://researchr.org/publication/Henglein91}, cites = {0}, citedby = {0}, pages = {448-472}, booktitle = {Functional Programming Languages and Computer Architecture, 5th ACM Conference, Cambridge, MA, USA, August 26-30, 1991, Proceedings}, editor = {John Hughes}, volume = {523}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-54396-1}, } @inproceedings{HengleinJ94, title = {Formally Optimal Boxing}, author = {Fritz Henglein and Jesper Jørgensen}, year = {1994}, researchr = {https://researchr.org/publication/HengleinJ94}, cites = {0}, citedby = {0}, pages = {213-226}, booktitle = {Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages}, } @article{HengleinM94, title = {The Complexity of Type Inference for Higher-Order Typed lambda Calculi}, author = {Fritz Henglein and Harry G. Mairson}, year = {1994}, tags = {type inference}, researchr = {https://researchr.org/publication/HengleinM94}, cites = {0}, citedby = {0}, journal = {Journal of Functional Programming}, volume = {4}, number = {4}, pages = {435-477}, } @inproceedings{Henglein92:0, title = {Dynamic Typing}, author = {Fritz Henglein}, year = {1992}, researchr = {https://researchr.org/publication/Henglein92%3A0}, cites = {0}, citedby = {0}, pages = {233-253}, booktitle = {ESOP 92, 4th European Symposium on Programming, Rennes, France, February 26-28, 1992, Proceedings}, editor = {Bernd Krieg-Brückner}, volume = {582}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-55253-7}, } @inproceedings{HengleinR95, title = {Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML}, author = {Fritz Henglein and Jakob Rehof}, year = {1995}, tags = {type inference, translation}, researchr = {https://researchr.org/publication/HengleinR95}, cites = {0}, citedby = {0}, pages = {192-203}, booktitle = {FPCA}, }