dblp.uni-trier.dewww.uni-trier.de

Fritz Henglein Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
32EEFritz Henglein: Generic discrimination: sorting and paritioning unshared data in linear time. ICFP 2008: 91-102
2006
31EEJesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen: Compositional specification of commercial contracts. STTT 8(6): 485-516 (2006)
2005
30EEOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial. Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005)
2004
29 Jesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen: Compositional Specification of Commercial Contracts. ISoLA (Preliminary proceedings) 2004: 103-110
2003
28EEOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi: Editorial: Special Issue Dedicated to Bob Paige. Higher-Order and Symbolic Computation 16(1-2): 5-6 (2003)
2001
27 Fritz Henglein, Henning Makholm, Henning Niss: A Direct Approach to Control-Flow Sensitive Region-Based Memory Management. PPDP 2001: 175-186
1999
26EEPeter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte: AnnoDomini: From Type Theory to Year 2000 Conversion Tool. POPL 1999: 1-14
25EEPeter Harry Eidorff, Fritz Henglein, Christian Mossin, Henning Niss, Morten Heine Sørensen, Mads Tofte: AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem. TLCA 1999: 6-13
24 Fritz Henglein: Breaking Through the n3 Barrier: Faster Object Type Inference. TAPOS 5(1): 57-72 (1999)
1998
23EEFritz Henglein, Jakob Rehof: Constraint Automata and the Complexity of Recursive Subtype Entailment. ICALP 1998: 616-627
22 Michael Brandt, Fritz Henglein: Coinductive Axiomatization of Recursive Type Equality and Subtyping. Fundam. Inform. 33(4): 309-338 (1998)
21 Fritz Henglein: SIGPLAN and the World Series. SIGPLAN Notices 33(1): 1-2 (1998)
1997
20EEFritz Henglein, Jakob Rehof: The Complexity of Subtype Entailment for Simple Types. LICS 1997: 352-361
19 Michael Brandt, Fritz Henglein: Coinductive Axiomatization of Recursive Type Equality and Subtyping. TLCA 1997: 63-81
1995
18 Fritz Henglein, Jakob Rehof: Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML. FPCA 1995: 192-203
17EEFritz Henglein, David Sands: A Semantic Model of Binding Times for Safe Partial Evaluation PLILP 1995: 299-320
16 Dirk Dussart, Fritz Henglein, Christian Mossin: Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time SAS 1995: 118-135
1994
15EEFritz Henglein, Christian Mossin: Polymorphic Binding-Time Analysis. ESOP 1994: 287-301
14 Fritz Henglein, Jesper Jørgensen: Formally Optimal Boxing. POPL 1994: 213-226
13 Fritz Henglein: Iterative Fixed Point Computation for Type-Based Strictness Analysis. SAS 1994: 395-407
12 Fritz Henglein, Harry G. Mairson: The Complexity of Type Inference for Higher-Order Typed lambda Calculi. J. Funct. Program. 4(4): 435-477 (1994)
11 Fritz Henglein: Dynamic Typing: Syntax and Proof Theory. Sci. Comput. Program. 22(3): 197-230 (1994)
1993
10EEFritz Henglein: Type Inference with Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15(2): 253-289 (1993)
1992
9EEFritz Henglein: Dynamic Typing. ESOP 1992: 233-253
8EEFritz Henglein: Global Tagging Optimization by Type Inference. LISP and Functional Programming 1992: 205-215
1991
7 Fritz Henglein: Efficient Type Inference for Higher-Order Binding-Time Analysis. FPCA 1991: 448-472
6EEHans Leiß, Fritz Henglein: A Decidable Case of the Semi-Unification Problem. MFCS 1991: 318-327
5 Fritz Henglein, Harry G. Mairson: The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. POPL 1991: 119-130
1990
4EEFritz Henglein: Fast Left-Linear Semi-Unification. ICCI 1990: 82-91
1988
3EEFritz Henglein: Type Inference and Semi-Unification. LISP and Functional Programming 1988: 184-197
1987
2 Robert Paige, Fritz Henglein: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study. J. Symb. Comput. 4(2): 207-232 (1987)
1985
1 Robert Paige, Fritz Henglein: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. European Conference on Computer Algebra (2) 1985: 554-567

Coauthor Index

1Jesper Andersen [29] [31]
2Michael Brandt [19] [22]
3Olivier Danvy [28] [30]
4Dirk Dussart [16]
5Peter Harry Eidorff [25] [26]
6Ebbe Elsborg [29] [31]
7Jesper Jørgensen [14]
8Hans Leiß [6]
9Harry G. Mairson [5] [12] [28] [30]
10Henning Makholm [27]
11Christian Mossin [15] [16] [25] [26]
12Henning Niss [25] [26] [27]
13Robert Paige [1] [2]
14Alberto Pettorossi [28] [30]
15Jakob Rehof [18] [20] [23]
16David Sands [17]
17Jakob Grue Simonsen [29] [31]
18Morten Heine Sørensen [25] [26]
19Christian Stefansen [29] [31]
20Mads Tofte [25] [26]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)