 | 2012 |
|---|
| 43 |       | Fritz Henglein:
Rock'n'Roll Computer Science.
Logic and Program Semantics 2012: 354-355 |
| 2011 |
|---|
| 42 | | Lasse Nielsen,
Fritz Henglein:
Bit-coded Regular Expression Parsing.
LATA 2011: 402-413 |
| 41 | | Fritz Henglein,
Lasse Nielsen:
Regular expression containment: coinductive axiomatization and computational interpretation.
POPL 2011: 385-398 |
| 2010 |
|---|
| 40 | | Fritz Henglein,
Ken Friis Larsen:
Generic multiset programming for language-integrated querying.
ICFP-WGP 2010: 49-60 |
| 39 | | Fritz Henglein:
Optimizing relational algebra operations using generic equivalence discriminators and lazy products.
PEPM 2010: 73-82 |
| 38 | | Tim Hallwyl,
Fritz Henglein,
Thomas T. Hildebrandt:
A standard-driven implementaion of WS-BPEL 2.0.
SAC 2010: 2472-2476 |
| 37 | | Fritz Henglein:
Large-scale sound and precise program analysis: technical persepctive.
Commun. ACM 53(8): 114 (2010) |
| 36 | | Fritz Henglein,
Ken Friis Larsen:
Generic multiset programming with discrimination-based joins and symbolic Cartesian products.
Higher-Order and Symbolic Computation 23(3): 337-370 (2010) |
| 2009 |
|---|
| 35 | | Fritz Henglein,
Ken Friis Larsen,
Jakob Grue Simonsen,
Christian Stefansen:
POETS: Process-oriented event-driven transaction systems.
J. Log. Algebr. Program. 78(5): 381-401 (2009) |
| 34 | | Fritz Henglein:
What is a Sorting Function?
J. Log. Algebr. Program. 78(7): 552-572 (2009) |
| 2008 |
|---|
| 33 | | Fritz Henglein:
Generic discrimination: sorting and paritioning unshared data in linear time.
ICFP 2008: 91-102 |
| 2006 |
|---|
| 32 | | Jesper Andersen,
Ebbe Elsborg,
Fritz Henglein,
Jakob Grue Simonsen,
Christian Stefansen:
Compositional specification of commercial contracts.
STTT 8(6): 485-516 (2006) |
| 2005 |
|---|
| 31 | | Olivier Danvy,
Fritz Henglein,
Harry G. Mairson,
Alberto Pettorossi:
Editorial.
Higher-Order and Symbolic Computation 18(1-2): 5-6 (2005) |
| 2004 |
|---|
| 30 |  | Jesper Andersen,
Ebbe Elsborg,
Fritz Henglein,
Jakob Grue Simonsen,
Christian Stefansen:
Compositional Specification of Commercial Contracts.
ISoLA (Preliminary proceedings) 2004: 103-110 |
| 2003 |
|---|
| 29 | | Olivier 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 |
|---|
| 28 | | Fritz Henglein,
Henning Makholm,
Henning Niss:
A Direct Approach to Control-Flow Sensitive Region-Based Memory Management.
PPDP 2001: 175-186 |
| 1999 |
|---|
| 27 | | Peter 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 |
| 26 | | 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.
TLCA 1999: 6-13 |
| 25 | | Fritz Henglein:
Breaking Through the n3 Barrier: Faster Object Type Inference.
TAPOS 5(1): 57-72 (1999) |
| 1998 |
|---|
| 24 | | Fritz Henglein,
Jakob Rehof:
Constraint Automata and the Complexity of Recursive Subtype Entailment.
ICALP 1998: 616-627 |
| 23 | | Michael Brandt,
Fritz Henglein:
Coinductive Axiomatization of Recursive Type Equality and Subtyping.
Fundam. Inform. 33(4): 309-338 (1998) |
| 22 | | Fritz Henglein:
SIGPLAN and the World Series.
SIGPLAN Notices 33(1): 1-2 (1998) |
| 1997 |
|---|
| 21 | | Peter Lee,
Fritz Henglein,
Neil D. Jones:
Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997
ACM Press 1997 |
| 20 | | Fritz 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 |
| 17 | | Fritz 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 |
|---|
| 15 | | Fritz 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 |
|---|
| 10 | | Fritz Henglein:
Type Inference with Polymorphic Recursion.
ACM Trans. Program. Lang. Syst. 15(2): 253-289 (1993) |
| 1992 |
|---|
| 9 | | Fritz Henglein:
Dynamic Typing.
ESOP 1992: 233-253 |
| 8 | | Fritz 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 |
| 6 | | Hans 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 |
|---|
| 4 | | Fritz Henglein:
Fast Left-Linear Semi-Unification.
ICCI 1990: 82-91 |
| 1988 |
|---|
| 3 | | Fritz 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page