Fritz Henglein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 71 from 71

2024

In memoriam Neil Deaton JonesFritz Henglein. PEPM 2024: 14-15 [doi]

2023

Trading Green bonds using Distributed Ledger TechnologyHenrik Axelsen, Ulrik Terp Rasmussen, Johannes Rude Jensen, Omri Ross, Fritz Henglein. ecis 2023: [doi]

2022

2020

A Formally Verified Static Analysis Framework for Compositional ContractsFritz Henglein, Christian Kjær Larsen, Agata Murawska. fc 2020: 599-619 [doi]

2018

Relational algebra by way of adjunctionsJeremy Gibbons, Fritz Henglein, Ralf Hinze, Nicolas Wu. PACMPL, 2(ICFP), 2018. [doi]

Editorial for the Special Issue on Parallel and Concurrent Functional ProgrammingGabriele Keller, Fritz Henglein. JFP, 28, 2018. [doi]

2017

Automated Execution of Financial Contracts on BlockchainsBenjamin Egelund-Müller, Martin Elsman, Fritz Henglein, Omri Ross. bise, 59(6):457-467, 2017. [doi]

Infinitary Axiomatization of the Equational Theory of Context-Free LanguagesNiels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen. FUIN, 150(3-4):241-257, 2017. [doi]

Infinitary Axiomatization of the Equational Theory of Context-Free LanguagesNiels Bjørn Bugge Grathwohl, Fritz Henglein, Dexter Kozen. FUIN, 150(3-4):241-257, 2017. [doi]

PEG parsing in less space using progressive tabling and dynamic analysisFritz Henglein, Ulrik Terp Rasmussen. PEPM 2017: 35-46 [doi]

Futhark: purely functional GPU-programming with nested parallelism and in-place array updatesTroels Henriksen, Niels G. W. Serup, Martin Elsman, Fritz Henglein, Cosmin E. Oancea. PLDI 2017: 556-571 [doi]

2016

2014

2013

Two-Pass Greedy Regular Expression ParsingNiels Bjørn Bugge Grathwohl, Fritz Henglein, Lasse Nielsen, Ulrik Terp Rasmussen. wia 2013: 60-71 [doi]

Sorting and Searching by Distribution: From Generic Discrimination to Generic TriesFritz Henglein, Ralf Hinze. aplas 2013: 315-332 [doi]

2012

2011

2010

2009

What is a Sorting Function?Fritz Henglein. jlp, 78(7):552-572, 2009. [doi]

POETS: Process-oriented event-driven transaction systemsFritz Henglein, Ken Friis Larsen, Jakob Grue Simonsen, Christian Stefansen. jlp, 78(5):381-401, 2009. [doi]

2008

Generic discrimination: sorting and paritioning unshared data in linear timeFritz Henglein. ICFP 2008: 91-102 [doi]

2006

Compositional specification of commercial contractsJesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen. STTT, 8(6):485-516, 2006. [doi]

2005

EditorialOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi. lisp, 18(1-2):5-6, 2005. [doi]

2004

Compositional Specification of Commercial ContractsJesper Andersen, Ebbe Elsborg, Fritz Henglein, Jakob Grue Simonsen, Christian Stefansen. ISoLA 2004: 103-110

2003

Editorial: Special Issue Dedicated to Bob PaigeOlivier Danvy, Fritz Henglein, Harry G. Mairson, Alberto Pettorossi. lisp, 16(1-2):5-6, 2003. [doi]

2001

A Direct Approach to Control-Flow Sensitive Region-Based Memory ManagementFritz Henglein, Henning Makholm, Henning Niss. ppdp 2001: 175-186

1999

1998

Coinductive Axiomatization of Recursive Type Equality and SubtypingMichael Brandt, Fritz Henglein. FUIN, 33(4):309-338, 1998.

Constraint Automata and the Complexity of Recursive Subtype EntailmentFritz Henglein, Jakob Rehof. icalp 1998: 616-627 [doi]

SIGPLAN and the World SeriesFritz Henglein. SIGPLAN, 33(1):1-2, 1998.

1997

Coinductive Axiomatization of Recursive Type Equality and SubtypingMichael Brandt, Fritz Henglein. tlca 1997: 63-81

The Complexity of Subtype Entailment for Simple TypesFritz Henglein, Jakob Rehof. lics 1997: 352-361 [doi]

1995

Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial TimeDirk Dussart, Fritz Henglein, Christian Mossin. SAS 1995: 118-135

Safe Polymorphic Type Inference for Scheme: Translating Scheme to MLFritz Henglein, Jakob Rehof. fpca 1995: 192-203

A Semantic Model of Binding Times for Safe Partial EvaluationFritz Henglein, David Sands. plilp 1995: 299-320

1994

Iterative Fixed Point Computation for Type-Based Strictness AnalysisFritz Henglein. SAS 1994: 395-407

Polymorphic Binding-Time AnalysisFritz Henglein, Christian Mossin. ESOP 1994: 287-301 [doi]

Formally Optimal BoxingFritz Henglein, Jesper Jørgensen. POPL 1994: 213-226

Dynamic Typing: Syntax and Proof TheoryFritz Henglein. SCP, 22(3):197-230, 1994.

The Complexity of Type Inference for Higher-Order Typed lambda CalculiFritz Henglein, Harry G. Mairson. JFP, 4(4):435-477, 1994.

1993

Type Inference with Polymorphic RecursionFritz Henglein. TOPLAS, 15(2):253-289, 1993. [doi]

1992

Dynamic TypingFritz Henglein. ESOP 1992: 233-253

Global Tagging Optimization by Type InferenceFritz Henglein. lfp 1992: 205-215 [doi]

1991

Efficient Type Inference for Higher-Order Binding-Time AnalysisFritz Henglein. fpca 1991: 448-472 [doi]

The Complexity of Type Inference for Higher-Order Typed Lambda CalculiFritz Henglein, Harry G. Mairson. POPL 1991: 119-130

A Decidable Case of the Semi-Unification ProblemHans Leiß, Fritz Henglein. mfcs 1991: 318-327

1990

Fast Left-Linear Semi-UnificationFritz Henglein. icci 1990: 82-91

1988

Type Inference and Semi-UnificationFritz Henglein. lfp 1988: 184-197 [doi]

1987

Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case StudyRobert Paige, Fritz Henglein. JSC, 4(2):207-232, 1987.

1985

Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code - A Case StudyRobert Paige, Fritz Henglein. eurocal 1985: 554-567

Optimizing Relational Algebra Operations Using Generic Equivalence Discriminators and Lazy ProductsFritz Henglein. PEPM 2010:

Sign in or sign up to see more results.

runs on WebDSL