| Type inference with polymorphic recursion F Henglein ACM Transactions on Programming Languages and Systems (TOPLAS) 15 (2), 253-289, 1993 | 363 | 1993 |
| Dynamic typing: Syntax and proof theory F Henglein Science of Computer Programming 22 (3), 197-230, 1994 | 251* | 1994 |
| Futhark: purely functional GPU-programming with nested parallelism and in-place array updates T Henriksen, NGW Serup, M Elsman, F Henglein, CE Oancea Proceedings of the 38th ACM SIGPLAN Conference on Programming Language …, 2017 | 233 | 2017 |
| Efficient type inference for higher-order binding-time analysis F Henglein Functional Programming Languages and Computer Architecture: 5th ACM …, 1991 | 189 | 1991 |
| Automated execution of financial contracts on blockchains B Egelund-Müller, M Elsman, F Henglein, O Ross Business & Information Systems Engineering 59, 457-467, 2017 | 157 | 2017 |
| Coinductive axiomatization of recursive type equality and subtyping M Brandt, F Henglein Fundamenta Informaticae 33 (4), 309-338, 1998 | 151 | 1998 |
| Global tagging optimization by type inference F Henglein ACM SIGPLAN Lisp Pointers, 205-215, 1992 | 115 | 1992 |
| Building blocks of sharding blockchain systems: Concepts, approaches, and open problems Y Liu, J Liu, MAV Salles, Z Zhang, T Li, B Hu, F Henglein, R Lu Computer Science Review 46, 100513, 2022 | 95 | 2022 |
| Coinductive axiomatization of recursive type equality and subtyping M Brandt, F Henglein Typed Lambda Calculi and Applications: Third International Conference on …, 1997 | 93 | 1997 |
| Polymorphic binding-time analysis F Henglein, C Mossin European Symposium on Programming, 287-301, 1994 | 92 | 1994 |
| A direct approach to control-flow sensitive region-based memory management F Henglein, H Makholm, H Niss Proceedings of the 3rd ACM SIGPLAN international conference on Principles …, 2001 | 83 | 2001 |
| Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time D Dussart, F Henglein, C Mossin International Static Analysis Symposium, 118-135, 1995 | 83 | 1995 |
| Formally optimal boxing F Henglein, J Jørgensen Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of …, 1994 | 81 | 1994 |
| The complexity of type inference for higher-order lambda calculi F Henglein, HG Mairson Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of …, 1991 | 79 | 1991 |
| Annodomini: From type theory to year 2000 conversion tool PH Eidorff, F Henglein, C Mossin, H Niss, MH Sørensen, M Tofte Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of …, 1999 | 70 | 1999 |
| Safe polymorphic type inference for a dynamically typed language: translating Scheme to ML F Henglein, J Rehof Proceedings of the seventh international conference on Functional …, 1995 | 68 | 1995 |
| Type inference and semi-unification F Henglein Proceedings of the 1988 ACM conference on LISP and functional programming …, 1988 | 68 | 1988 |
| Compositional specification of commercial contracts J Andersen, E Elsborg, F Henglein, JG Simonsen, C Stefansen International Journal on Software Tools for Technology Transfer 8, 485-516, 2006 | 63 | 2006 |
| The complexity of subtype entailment for simple types F Henglein, J Rehof Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997 | 62 | 1997 |
| Mechanical translation of set theoretic problem specifications into efficient ram code-a case study R Paige, F Henglein Journal of Symbolic Computation 4 (2), 207-232, 1987 | 60 | 1987 |
