BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Belgium
1 × Poland
1 × Switzerland
1 × The Netherlands
2 × Canada
2 × Denmark
2 × France
2 × Italy
2 × Spain
2 × United Kingdom
8 × USA
Collaborated with:
J.Rehof L.Nielsen C.Mossin U.T.Rasmussen H.Niss M.Brandt D.Sands J.Jørgensen H.G.Mairson N.B.B.Grathwohl T.Hallwyl T.T.Hildebrandt H.Makholm P.H.Eidorff M.H.Sørensen M.Tofte D.Dussart Kristoffer Aalund Søholm Sebastian Paaske Tørholm T.Henriksen Niels G. W. Serup M.Elsman C.E.Oancea
Talks about:
type (13) time (6) analysi (5) infer (5) polymorph (4) subtyp (4) dynam (4) bind (4) regular (3) express (3)

Person: Fritz Henglein

DBLP DBLP: Henglein:Fritz

Facilitated 2 volumes:

POPL 1997Ed
PEPM 2018Ed

Contributed to:

CIAA 20132013
LATA 20112011
LOPSTR 20112011
POPL 20112011
PEPM 20102010
SAC 20102010
ICFP 20082008
PPDP 20012001
POPL 19991999
TLCA 19991999
ICALP 19981998
LICS 19971997
TLCA 19971997
FPCA 19951995
PPDP 19951995
SAS 19951995
ESOP 19941994
POPL 19941994
SAS 19941994
ESOP 19921992
ESOP 19921994
LFP 19921992
FPCA 19911991
POPL 19911991
LFP 19881988
POPL 20162016
PEPM 20172017
PLDI 20172017

Wrote 28 papers:

CIAA-2013-GrathwohlHNR #parsing #regular expression
Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.
LATA-2011-NielsenH #parsing #regular expression
Bit-coded Regular Expression Parsing (LN, FH), pp. 402–413.
LOPSTR-2011-Henglein #domain-specific language #implementation #symbolic computation
Dynamic Symbolic Computation for Domain-Specific Language Implementation (FH), pp. 4–24.
POPL-2011-HengleinN #axiom #induction #regular expression
Regular expression containment: coinductive axiomatization and computational interpretation (FH, LN), pp. 385–398.
PEPM-2010-Henglein #algebra #equivalence #lazy evaluation #optimisation #relational #using
Optimizing relational algebra operations using generic equivalence discriminators and lazy products (FH), pp. 73–82.
SAC-2010-HallwylHH #standard
A standard-driven implementaion of WS-BPEL 2.0 (TH, FH, TTH), pp. 2472–2476.
ICFP-2008-Henglein #linear #sorting
Generic discrimination: sorting and paritioning unshared data in linear time (FH), pp. 91–102.
PPDP-2001-HengleinMN #approach #control flow #memory management
A Direct Approach to Control-Flow Sensitive Region-Based Memory Management (FH, HM, HN), pp. 175–186.
POPL-1999-EidorffHMNST #named #type system
AnnoDomini: From Type Theory to Year 2000 Conversion Tool (PHE, FH, CM, HN, MHS, MT), pp. 1–14.
TLCA-1999-EidorffHMNST #approach #problem
AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem (PHE, FH, CM, HN, MHS, MT), pp. 6–13.
ICALP-1998-HengleinR #automaton #complexity #constraints #recursion #type system
Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.
LICS-1997-HengleinR #complexity #type system
The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.
TLCA-1997-BrandtH #axiom #induction #recursion #similarity #type system
Coinductive Axiomatization of Recursive Type Equality and Subtyping (MB, FH), pp. 63–81.
FPCA-1995-HengleinR #ml #polymorphism #type inference
Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML (FH, JR), pp. 192–203.
PLILP-1995-HengleinS #partial evaluation #semantics
A Semantic Model of Binding Times for Safe Partial Evaluation (FH, DS), pp. 299–320.
SAS-1995-DussartHM #analysis #polymorphism #polynomial #recursion #type system
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time (DD, FH, CM), pp. 118–135.
ESOP-1994-HengleinM #analysis #polymorphism
Polymorphic Binding-Time Analysis (FH, CM), pp. 287–301.
POPL-1994-HengleinJ
Formally Optimal Boxing (FH, JJ), pp. 213–226.
SAS-1994-Henglein #analysis #fixpoint #strict #type system
Iterative Fixed Point Computation for Type-Based Strictness Analysis (FH), pp. 395–407.
ESOP-1992-Henglein #dynamic typing #type system
Dynamic Typing (FH), pp. 233–253.
ESOP-J-1992-Henglein94 #dynamic typing #proving #syntax #type system
Dynamic Typing: Syntax and Proof Theory (FH), pp. 197–230.
LFP-1992-Henglein #optimisation #type inference
Global Tagging Optimization by Type Inference (FH), pp. 205–215.
FPCA-1991-Henglein #analysis #higher-order #performance #type inference
Efficient Type Inference for Higher-Order Binding-Time Analysis (FH), pp. 448–472.
POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus
The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.
LFP-1988-Henglein #type inference
Type Inference and Semi-Unification (FH), pp. 184–197.
POPL-2016-GrathwohlHRST #compilation #named #nondeterminism #streaming #transducer
Kleenex: compiling nondeterministic transducers to deterministic streaming transducers (NBBG, FH, UTR, KAS, SPT), pp. 284–297.
PEPM-2017-HengleinR #dynamic analysis #parsing expression grammar #using
PEG parsing in less space using progressive tabling and dynamic analysis (FH, UTR), pp. 35–46.
PLDI-2017-HenriksenSEHO #array #functional #named #parallel
Futhark: purely functional GPU-programming with nested parallelism and in-place array updates (TH, NGWS, ME, FH, CEO), pp. 556–571.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.