F
Fritz Henglein
Researcher at University of Copenhagen
Publications - 80
Citations - 2170
Fritz Henglein is an academic researcher from University of Copenhagen. The author has contributed to research in topics: Type inference & Compiler. The author has an hindex of 23, co-authored 75 publications receiving 2036 citations. Previous affiliations of Fritz Henglein include Courant Institute of Mathematical Sciences & Utrecht University.
Papers
More filters
Journal ArticleDOI
Type inference with polymorphic recursion
TL;DR: The Damas-Milner Calculus is the typed λ-calculus underlying the type system for ML and several other strongly typed polymorphic functional languages such as Miranda and Haskell, and Mycroft has extended its problematic monomorphic typing rule for recursive definitions with a polymorphic typing rule.
Journal ArticleDOI
Dynamic typing: syntax and proof theory
TL;DR: This work describes when two different completions of the same run-time typed program are coherent with an equational theory that is independent of an underlying I-theory, and shows that every untyped A-term has a safe completion at any type and that it is unique modulo a suitable congruence relation in the dynamically typed A-calculus.
Journal ArticleDOI
Coinductive axiomatization of recursive type equality and subtyping
Michael Brandt,Fritz Henglein +1 more
TL;DR: It is shown how adding the fixpoint rule makes it possible to characterize inductively a set that is coinductively defined as the kernel (greatest fixed point) of an inference system.
Book ChapterDOI
Efficient type inference for higher-order binding-time analysis
TL;DR: Binding-time analysis determines when variables and expressions in a program can be bound to their values, distinguishing between early (compile- time) and late (run-time) binding.
Proceedings ArticleDOI
Futhark: purely functional GPU-programming with nested parallelism and in-place array updates
TL;DR: This paper presents the design and implementation of three key features of Futhark that seek a suitable middle ground with imperative approaches and presents a flattening transformation aimed at enhancing the degree of parallelism.