Publications of Fritz Henglein

Load the BibTeX file

Academic Journals

1. Fritz Henglein, Ken Larsen. Generic multiset programming with discrimination-based joins and symbolic Cartesian products. Higher-Order and Symbolic Computation, 10.1007/s10990-011-9078-8, pages 1-34, 2011.
2. Fritz Henglein. Large-scale sound and precise program analysis: technical perspective. Communications of the ACM (CACM), 53(8):114-114, 2010. download
3. Fritz Henglein. What is a Sorting Function?. J. Logic and Algebraic Programming (JLAP), Invited submission to special issue on 19th Nordic Workshop on Programming Theory (NWPT), 78(5):381-401, 2009.
4. Fritz Henglein, Ken Friis Larsen, Jakob Grue Simonsen, Christian Stefansen. POETS: Process-Oriented Event-driven Transaction System. Journal of Logic and Algebraic Programming (JLAP), Invited submission to special Issue on Contract-Oriented Software, 78(5):381-401, 2009.
5. Jesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen. Compositional specification of commercial contracts. International Journal on Software Tools for Technology Transfer (STTT), 8(6):485-516, November 2006.
6. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi. Editorial. Higher-Order and Symbolic Computation, 18(1):5-6, 2005.
7. Olivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi. Editorial: Special Issue Dedicated to Bob Paige. Higher-Order and Symbolic Computation, 16(1):5-6, 2003.
8. Fritz Henglein. Breaking Through the $n^3$ Barrier: Faster Object Type Inference. Theory and Practice of Object Systems (TAPOS), Invited paper selected from 4th Int'l Workshop on Foundations of Object-Oriented Languages (FOOL), January 1997, Paris, France, 5(1):57-72, 1999.
9. Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine S\orensen, Mads Tofte. AnnoDomini: From Type Theory to a Year 2000 Conversion Tool. ERCIM News, European Research Consortium for Informatics and Mathematics (ERCIM), http://www.ercim.org, 36:12-13, January 1999.
10. Fritz Henglein. SIGPLAN and the World Series. SIGPLAN Notices, 33(1):1-2, 1998.
11. Michael Brandt, Fritz Henglein. Coinductive axiomatization of recursive type equality and subtyping. Fundamenta Informaticae, Invited submission to special issue featuring a selection of contributions to the 3d Int'l Conf. on Typed Lambda Calculi and Applications (TLCA), 1997, 33(4):309-338, 1998.
12. Fritz Henglein. Dynamic Typing: Syntax and Proof Theory. Science of Computer Progamming (SCP), 22(3):197-230, 1994.
13. Fritz Henglein, Harry Mairson. The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. Journal of Functional Programming (JFP), 4(4):435-477, October 1994.
14. Fritz Henglein. Type Inference with Polymorphic Recursion. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(2):253-289, April 1993. download
15. Fritz Henglein. Book review: Helmut Partsch, ``Specification and Transformation of Programs'', Springer, Heidelberg, 1990. Science of Computer Programming, 17(1):247-249, December 1991.
16. Robert Paige, Fritz Henglein. Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. Journal of Symbolic Computation, Previous versions appeared at Proc. European Conference on Computer Algebra (EUROCAL), Linz, Austria, April 1985, Springer LNCS Vol. 204, pp. 554-567, and as IBM Technical Report RC 12169, September 1986, 4(2):207-232, August 1987.

Book Chapters

1. Sian Jha, Jens Palsberg, Tian Zhao, Fritz Henglein. Efficient Type Matching. In Automatic Program Development-A Tribute to Robert Paige, Springer Netherlands, 2008.
2. Fritz Henglein, Henning Makholm, Henning Niss. Effect type systems and region-based memory management. In Advanced Topics in Types and Programming Languages, Benjamin Pierce (ed.), MIT Press, 2005.
3. Fritz Henglein, Susanne Staun. Dr\ommen om den tabte tid. In Dr\ommer jeg\ldots? Danskernes tanker om informationssamfundet ar 2005, ISBN 87-21-00540-0, Henrik Palle (ed.), ISBN 87-21-00540-0, pp. 54-57, Forksningsministeriet i kommission hos Borgens Forlag, Valbygaardsvej 33, DK-2500 Copenhagen/Valby, 1996.
4. Jiazhen Cai, Philippe Facon, Fritz Henglein, Robert Paige, Edmond Schonberg. Type Analysis and Data Structure Selection. In Constructing Programs from Specifications, Published in the US by Elsevier Science Publishing Company Inc, 655 Ave. of the Americas, New York, NY 10010; ISBN: 0 444 89184 6, Möller (ed.), Published in the US by Elsevier Science Publishing Company Inc, 655 Ave. of the Americas, New York, NY 10010; ISBN: 0 444 89184 6, pp. 125-164, North-Holland, May 1991.

International Conferences

1. Lasse Nielsen, Fritz Henglein. Bit-coded Regular Expression Parsing. In Proc. 5th Int'l Conf. on Language and Automata Theory and Applications (LATA), Lecture Notes in Computer Science (LNCS), May 2011.
2. Fritz Henglein, Lasse Nielsen. Regular Expression Containment: Coinductive Axiomatization and Computational Interpretation. In Proc. 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL), January 2011.
3. Fritz Henglein, Ken Friis Larsen. Generic Multiset Programming for Language-integrated Querying. In Proc. 6th Workshop on Generic Programming (WGP), September 2010.
4. Tim Hallwyl, Fritz Henglein, Thomas Hildebrandt. A standard-driven implementation of WS-BPEL 2.0. In Proc. ACM Symposium on Applied Computing (SAC), Volume Service-Oriented Architecture and Programming (SOAP) track, Sierre, Switzerland, March 2010.
5. Fritz Henglein. Optimizing relational algebra operations using discrimination-based joins and lazy products. In Proc. ACM SIGPLAN 2010 Workshop on Partial Evaluation and Program Manipulation, Also DIKU TOPPS D-report no. 611, Pages 73-82, New York, NY, USA, 2010. download
6. Fritz Henglein. Generic discrimination: Sorting and partitioning unshared data in linear time. In ICFP '08: Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, James Hook, Peter Thiemann (eds.), Nominated by ACM SIGPLAN for CACM Research Highlights (see http://sigplan.org/CACMPapers.htm), Pages 91-102, New York, NY, USA, September 2008. download
7. Fritz Henglein, Ken Friis Larsen, Jakob Grue Simonsen, Christian Stefansen. Compositional contract specification for REA. In First Workshop on Formal Languages and Analysis of Contract-Oriented Software, Invited contribution, October 2007.
8. Fritz Henglein. What is a Sort Function?. In Proc. 19th Nordic Workshop on Programming Theory (NWPT), Oslo, Norway, 2007.
9. Jesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen. Compositional Specification of Commercial Contracts. In ISoLA (Preliminary proceedings), Pages 103-110, 2004.
10. Fritz Henglein, Henning Makholm, Henning Niss. A direct approach to control-flow sensitive region-based memory management. In PPDP '01: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, Pages 175-186, New York, NY, USA, 2001. download
11. Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine S\orensen, Mads Tofte. AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. In TLCA, Pages 6-13, 1999.
12. Peter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine S\orensen, Mads Tofte. AnnoDomini: From type theory to Year 2000 conversion tool. In POPL '99: Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Pages 1-14, New York, NY, USA, January 1999. download
13. Fritz Henglein, Jakob Rehof. Constraint Automata and the Complexity of Recursive Subtype Entailment. In ICALP, Pages 616-627, July 1998.
14. Michael Brandt, Fritz Henglein. Coinductive Axiomatization of Recursive Type Equality and Subtyping. In TLCA, Pages 63-81, 1997.
15. Fritz Henglein, Jakob Rehof. The Complexity of Subtype Entailment for Simple Types. In Proc.\ 12th Annual IEEE Symposium on Logic in Computer Science (LICS), Warsaw, Poland, Pages 352-361, July 1997.
16. Fritz Henglein. Breaking through the $n^3$ barrier: Faster object type inference. In Proc.\ 4th Int'l Workshop on Foundations of Object-Oriented Languages (FOOL), Paris, France, Benjamin Pierce (ed.), Also DIKU TOPPS Report D-317, January 1997.
17. Dirk Dussart, Fritz Henglein, Christian Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In Proc.\ 2nd Int'l Static Analysis Symposium (SAS), Glasgow, Scotland, Lecture Notes in Computer Science, Pages 118-135, September 1995.
18. Fritz Henglein, Jakob Rehof. Safe polymorphic type inference for a dynamically typed language: Translating Scheme to ML. In FPCA '95: Proceedings of the seventh international conference on Functional programming languages and computer architecture, Pages 192-203, New York, NY, USA, June 1995. download
19. Fritz Henglein, David Sands. A Semantic Model of Binding Times for Safe Partial Evaluation. In PLILP, Pages 299-320, March 1995.
20. Fritz Henglein. Iterative Fixed Point Computation for Type-Based Strictness Analysis. In 1st Int'l Static Analysis Symposium (SAS), Namur, Belgium, Baudouin Le Charlier (ed.), Lecture Notes in Computer Science, Also DIKU Semantics Report D-192, Volume 864, Pages 395-407, September 1994.
21. Fritz Henglein, Christian Mossin. Polymorphic Binding-Time Analysis. In Proc. European Symposium on Programming (ESOP), Edinburgh, Scotland, Pages 287-301, April 1994.
22. Fritz Henglein, Jesper J\orgensen. Formally optimal boxing. In POPL '94: Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Also DIKU Semantics Report D-179, Pages 213-226, New York, NY, USA, January 1994. download
23. Fritz Henglein. Global tagging optimization by type inference. In LFP '92: Proceedings of the 1992 ACM conference on LISP and functional programming, Also DIKU Semantics Report D-102, Pages 205-215, New York, NY, USA, June 1992. download
24. Fritz Henglein. Dynamic Typing. In Proc. European Symp. on Programming (ESOP), Rennes, France, Pages 233-253, February 1992.
25. Fritz Henglein, Konstantin Läufer. Programming with Structures, Functions, and Objects. In Proc. XVII Latin American Informatics Conference (PANEL '91), Pages 333-352, 1991.
26. Hans Lei\ss, Fritz Henglein. A Decidable Case of the Semi-Unification Problem. In Proc. 16th Int'l Symp. on Mathematical Foundations of Computer Science (MFCS), Poland, Lecture Notes in Computer Science, Volume 520, Pages 318-327, September 1991.
27. Fritz Henglein. Efficient Type Inference for Higher-Order Binding-Time Analysis. In Proc. Conf. on Functional Programming Languages and Computer Architecture (FPCA), Cambridge, Massachusetts, Pages 448-472, August 1991.
28. Fritz Henglein, Harry G. Mairson. The complexity of type inference for higher-order lambda calculi. In POPL '91: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, Pages 119-130, New York, NY, USA, January 1991. download
29. Fritz Henglein, Hans Lei\ss. Quasi-Monadic Semi-Unification Is Decidable. In Proc. Workshop on Unification (UNIF), Leeds, England, July 1990.
30. Fritz Henglein. Fast Left-Linear Semi-Unification. In Proc. Int'l. Conf. on Computing and Information, Lecture Notes of Computer Science, Vol. 468, Pages 82-91, May 1990.
31. Fritz Henglein. Type inference and semi-unification. In LFP '88: Proceedings of the 1988 ACM conference on LISP and functional programming, Pages 184-197, New York, NY, USA, July 1988. download
32. Robert Paige, Fritz Henglein. Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. In Proc. European Conference on Computer Algebra (EUROCAL), Linz, Austria, Lecture Notes in Computer Science, Volume 204, Pages 554-567, April 1985.

Technical Reports

1. Fritz Henglein. Generic Top-down Discrimination for Sorting and Partitioning in Linear Time. Research Report Department of Computer Science, University of Copenhagen (DIKU), December 2010.
2. Fritz Henglein, Lasse Nielsen. Declarative Coinductive Axiomatization of Regular Expression Containment and its Computational Interpretation (Preliminary Version). TOPPS D-Report Department of Computer Science, University of Copenhagen (DIKU), No 612, February 2010.
3. Fritz Henglein, Ken Friis Larsen. Generic Multiset Programming for Language-Integrated Querying. TOPPS D-Report Department of Computer Science, University of Copenhagen (DIKU), No 609, October 2009.
4. Fritz Henglein. Generic Top-down Discrimination. TOPPS Report Department of Computer Science, University of Copenhagen (DIKU), No 608, October 2009.
5. Tim Hallwyl, Fritz Henglein, Thomas Hildebrandt. Analysis of the WS-BPEL 2.0 standard using standard-driven implementation. TOPPS D-Report Department of Computer Science, University of Copenhagen (DIKU), No 607, June 2009.
6. Fritz Henglein. Optimizing relational algebra operations using generic partitioning discriminators and lazy products. TOPPS D-Report Department of Computer Science, University of Copenhagen (DIKU), No 610, May 2009.
7. Fritz Henglein. Generic Discrimination: Sorting and Partitioning Unshared Data in Linear Time. TOPPS Report D-582 Department of Computer Science, University of Copenhagen (DIKU), December 2007.
8. Fritz Henglein. Intrinsically defined sorting functions. TOPPS Report D-565 Department of Computer Science, University of Copenhagen (DIKU), September 2007.
9. Fritz Henglein. Generic discrimination: Partitioning and Sorting Complex Data in Linear Time. TOPPS Report D-559 Department of Computer Science, University of Copenhagen (DIKU), December 2006.
10. Fritz Henglein, Henning Makholm, Henning Niss. Effect type systems and region-based memory management. TOPPS Report D-519 Department of Computer Science, University of Copenhagen (DIKU), 2004.
11. Fritz Henglein. Multiset discrimination. Manuscript (incomplete) Department of Computer Science, University of Copenhagen (DIKU), September 2003. download
12. Sian Jha, Jens Palsberg, Tian Zhao, Fritz Henglein. Efficient Type Matching. TOPPS Report D-474 Department of Computer Science, University of Copenhagen (DIKU), 2002.
13. Morten V. Christiansen, Fritz Henglein, Henning Niss, Per Velschow. Safe Region-Based Memory Management for Objects. TOPPS Report D-397 Department of Computer Science, University of Copenhagen (DIKU), October 1998.
14. Fritz Henglein, Jakob Rehof. The Complexity of Subtype Entailment for Simple Type. TOPPS Report D-319 Department of Computer Science, University of Copenhagen (DIKU), January 1997.
15. Fritz Henglein. Syntactic Properties of Polymorphic Subtyping. TOPPS Report D-293 DIKU, University of Copenhagen, May 1996.
16. Fritz Henglein. Iterative fixed point computation for type-based strictness analysis. TOPPS Report D-192 DIKU, University of Copenhagen, March 1994.
17. Fritz Henglein. Dynamic Typing: Syntax and Proof Theory. TOPPS Report D-163 Department of Computer Science, University of Copenhagen (DIKU), March 1993.
18. Fritz Henglein. Simple Closure Analysis. TOPPS Report D-193 Department of Computer Science, University of Copenhagen (DIKU), March 1992.
19. Fritz Henglein. Global Tagging Optimization by Type Inference. TOPPS Report D-102 Department of Computer Science, University of Copenhagen (DIKU), November 1991.
20. Fritz Henglein. Dynamic Typing. TOPPS Report D-90 Department of Computer Science, University of Copenhagen (DIKU), March 1991. download
21. Fritz Henglein. A Lower Bound for Full Polymorphic Type Inference: Girard-Reynolds Typability is DEXPTIME-hard. RUU-CS-90-14 Utrecht University, April 1990.
22. Fritz Henglein. Fast Left-Linear Semi-Unification. RUU-CS-89-33 Utrecht University, December 1989.
23. Jiazhen Cai, Philippe Facon, Fritz Henglein, Robert Paige, Edmond Schonberg. Type Transformation and Data Structure Choice. SETL Newsletter NYU, No 228, November 1988.
24. Fritz Henglein. Algebraic Properties of Semi-Unification. SETL Newsletter Courant Institute of Mathematical Sciences, New York University, No 233, November 1988.
25. Fritz Henglein. Polymorphic Type Inference is Semi-Unification. SETL Newsletter New York University, No 229, October 1988.
26. Fritz Henglein. A Fast Algorithm for Computing Uniform Semi-Unifiers. SETL Newsletter New York University, No 231, October 1988.
27. Fritz Henglein. Simple Type Inference and Unification. SETL Newsletter Courant Institute of Mathematical Sciences, New York University, No 232, October 1988.
28. Catherine Dubois, Fritz Henglein. A First-Order Axiomatization of Parametric Polymorphism and Dynamic Overloading and its Typol Specification. SETL Newsletter New York University, No 224, May 1988.
29. Fritz Henglein. Semi-Unification. SETL Newsletter New York University, No 222, April 1988.
30. Fritz Henglein. The Milner-Mycroft Calculus. SETL Newsletter New York University, No 223, April 1988.
31. Fritz Henglein. A Polymorphic Type Model for SETL. SETL Newsletter New York University, No 221, July 1987.
32. Fritz Henglein. Overloading in SETL is not (Syntactic) Overloading after all. SETL Newsletter New York University, No 220, April 1987.
33. Robert Paige, Fritz Henglein. Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. RC IBM, No 12169, September 1986.

Miscellaneous

1. Fritz Henglein. Personal communcation with Joshua Auerbach. Email, 1998.

Dissertations

1. Fritz Henglein. Polymorphic Type Inference and Semi-Unification. PhD Thesis Rutgers University, April 1989.

Master's thesis

1. Fritz Henglein. Algebraic Foundations of Constraint Backpropagation. Master's theses Department of Computer Science, Rutgers University, New Brunswick, New Jersey, April 1986.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.