Search the dblp DataBase
Fritz Henglein :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Robert Paige , Fritz Henglein Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study. [Citation Graph (1, 0)][DBLP ] J. Symb. Comput., 1987, v:4, n:2, pp:207-232 [Journal ] Fritz Henglein Dynamic Typing. [Citation Graph (0, 0)][DBLP ] ESOP, 1992, pp:233-253 [Conf ] Fritz Henglein , Christian Mossin Polymorphic Binding-Time Analysis. [Citation Graph (0, 0)][DBLP ] ESOP, 1994, pp:287-301 [Conf ] Robert Paige , Fritz Henglein Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case Study. [Citation Graph (0, 0)][DBLP ] European Conference on Computer Algebra (2), 1985, pp:554-567 [Conf ] Fritz Henglein , Jakob Rehof Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML. [Citation Graph (0, 0)][DBLP ] FPCA, 1995, pp:192-203 [Conf ] Fritz Henglein Efficient Type Inference for Higher-Order Binding-Time Analysis. [Citation Graph (0, 0)][DBLP ] FPCA, 1991, pp:448-472 [Conf ] Fritz Henglein , Jakob Rehof Constraint Automata and the Complexity of Recursive Subtype Entailment. [Citation Graph (0, 0)][DBLP ] ICALP, 1998, pp:616-627 [Conf ] Fritz Henglein Fast Left-Linear Semi-Unification. [Citation Graph (0, 0)][DBLP ] ICCI, 1990, pp:82-91 [Conf ] Fritz Henglein Type Inference and Semi-Unification. [Citation Graph (0, 0)][DBLP ] LISP and Functional Programming, 1988, pp:184-197 [Conf ] Fritz Henglein Global Tagging Optimization by Type Inference. [Citation Graph (0, 0)][DBLP ] LISP and Functional Programming, 1992, pp:205-215 [Conf ] Fritz Henglein , Jakob Rehof The Complexity of Subtype Entailment for Simple Types. [Citation Graph (0, 0)][DBLP ] LICS, 1997, pp:352-361 [Conf ] Hans Leiß , Fritz Henglein A Decidable Case of the Semi-Unification Problem. [Citation Graph (0, 0)][DBLP ] MFCS, 1991, pp:318-327 [Conf ] Fritz Henglein , David Sands A Semantic Model of Binding Times for Safe Partial Evaluation [Citation Graph (0, 0)][DBLP ] PLILP, 1995, pp:299-320 [Conf ] Peter Harry Eidorff , Fritz Henglein , Christian Mossin , Henning Niss , Morten Heine Sørensen , Mads Tofte AnnoDomini: From Type Theory to Year 2000 Conversion Tool. [Citation Graph (0, 0)][DBLP ] POPL, 1999, pp:1-14 [Conf ] Fritz Henglein , Jesper Jørgensen Formally Optimal Boxing. [Citation Graph (0, 0)][DBLP ] POPL, 1994, pp:213-226 [Conf ] Fritz Henglein , Harry G. Mairson The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. [Citation Graph (0, 0)][DBLP ] POPL, 1991, pp:119-130 [Conf ] Fritz Henglein , Henning Makholm , Henning Niss A Direct Approach to Control-Flow Sensitive Region-Based Memory Management. [Citation Graph (0, 0)][DBLP ] PPDP, 2001, pp:175-186 [Conf ] Dirk Dussart , Fritz Henglein , Christian Mossin Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time [Citation Graph (0, 0)][DBLP ] SAS, 1995, pp:118-135 [Conf ] Fritz Henglein Iterative Fixed Point Computation for Type-Based Strictness Analysis. [Citation Graph (0, 0)][DBLP ] SAS, 1994, pp:395-407 [Conf ] Michael Brandt , Fritz Henglein Coinductive Axiomatization of Recursive Type Equality and Subtyping. [Citation Graph (0, 0)][DBLP ] TLCA, 1997, pp:63-81 [Conf ] Peter 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. [Citation Graph (0, 0)][DBLP ] TLCA, 1999, pp:6-13 [Conf ] Michael Brandt , Fritz Henglein Coinductive Axiomatization of Recursive Type Equality and Subtyping. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1998, v:33, n:4, pp:309-338 [Journal ] Fritz Henglein , Harry G. Mairson The Complexity of Type Inference for Higher-Order Typed lambda Calculi. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 1994, v:4, n:4, pp:435-477 [Journal ] Olivier Danvy , Fritz Henglein , Harry G. Mairson , Alberto Pettorossi Editorial: Special Issue Dedicated to Bob Paige. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2003, v:16, n:1-2, pp:5-6 [Journal ] Olivier Danvy , Fritz Henglein , Harry G. Mairson , Alberto Pettorossi Editorial. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2005, v:18, n:1-2, pp:5-6 [Journal ] Fritz Henglein Dynamic Typing: Syntax and Proof Theory. [Citation Graph (0, 0)][DBLP ] Sci. Comput. Program., 1994, v:22, n:3, pp:197-230 [Journal ] Fritz Henglein SIGPLAN and the World Series. [Citation Graph (0, 0)][DBLP ] SIGPLAN Notices, 1998, v:33, n:1, pp:1-2 [Journal ] Jesper Andersen , Ebbe Elsborg , Fritz Henglein , Jakob Grue Simonsen , Christian Stefansen Compositional specification of commercial contracts. [Citation Graph (0, 0)][DBLP ] STTT, 2006, v:8, n:6, pp:485-516 [Journal ] Fritz Henglein Breaking Through the n3 Barrier: Faster Object Type Inference. [Citation Graph (0, 0)][DBLP ] TAPOS, 1999, v:5, n:1, pp:57-72 [Journal ] Fritz Henglein Type Inference with Polymorphic Recursion. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1993, v:15, n:2, pp:253-289 [Journal ] Generic discrimination: sorting and paritioning unshared data in linear time. [Citation Graph (, )][DBLP ] Compositional Specification of Commercial Contracts. [Citation Graph (, )][DBLP ] Optimizing relational algebra operations using generic equivalence discriminators and lazy products. [Citation Graph (, )][DBLP ] A standard-driven implementaion of WS-BPEL 2.0. [Citation Graph (, )][DBLP ] Large-scale sound and precise program analysis: technical persepctive. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.306secs