Fritz Henglein

Affiliations:
  • University of Copenhagen, Denmark


According to our database1, Fritz Henglein authored at least 68 papers between 1987 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
In memoriam Neil Deaton Jones.
Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation, 2024

2023
Trading Green bonds using Distributed Ledger Technology.
Proceedings of the 31st European Conference on Information Systems, 2023

2022
Event-Based Supply Chain Network Modeling: Blockchain for Good Coffee.
Frontiers Blockchain, 2022

Building blocks of sharding blockchain systems: Concepts, approaches, and open problems.
Comput. Sci. Rev., 2022

Contract-Backed Digital Cash.
CoRR, 2022

The Programming of Algebra.
Proceedings of the Proceedings Ninth Workshop on Mathematically Structured Functional Programming, 2022

Combinatory Adjoints and Differentiation.
Proceedings of the Proceedings Ninth Workshop on Mathematically Structured Functional Programming, 2022

Algeo: An Algebraic Approach to Reversibility.
Proceedings of the Reversible Computation - 14th International Conference, 2022

2020
A Formally Verified Static Analysis Framework for Compositional Contracts.
Proceedings of the Financial Cryptography and Data Security, 2020

2018
Relational algebra by way of adjunctions.
Proc. ACM Program. Lang., 2018

Editorial for the Special Issue on Parallel and Concurrent Functional Programming.
J. Funct. Program., 2018

2017
Infinitary Axiomatization of the Equational Theory of Context-Free Languages.
Fundam. Informaticae, 2017

Automated Execution of Financial Contracts on Blockchains.
Bus. Inf. Syst. Eng., 2017

Futhark: purely functional GPU-programming with nested parallelism and in-place array updates.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

PEG parsing in less space using progressive tabling and dynamic analysis.
Proceedings of the 2017 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2017

2016
FinPar: A Parallel Financial Benchmark.
ACM Trans. Archit. Code Optim., 2016

2016 POPL impressions.
ACM SIGLOG News, 2016

Kleenex: compiling nondeterministic transducers to deterministic streaming transducers.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Modal Intersection Types, Two-Level Languages, and Staged Synthesis.
Proceedings of the Semantics, Logics, and Calculi, 2016

2014
Scripting Languages and Frameworks: Analysis and Verification (Dagstuhl Seminar 14271).
Dagstuhl Reports, 2014

Domain-Specific Languages for Enterprise Systems.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change, 2014

Optimally Streaming Greedy Regular Expression Parsing.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2014, 2014

2013
Two-Pass Greedy Regular Expression Parsing.
Proceedings of the Implementation and Application of Automata, 2013

Sorting and Searching by Distribution: From Generic Discrimination to Generic Tries.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
Generic top-down discrimination for sorting and partitioning in linear time.
J. Funct. Program., 2012

Clone detection using rolling hashing, suffix trees and dagification: A case study.
Proceedings of the Proceeding of the 6th International Workshop on Software Clones, 2012

Financial software on GPUs: between Haskell and Fortran.
Proceedings of the 1st ACM SIGPLAN workshop on Functional high-performance computing, 2012

Trustworthy Pervasive Healthcare Services via Multiparty Session Types.
Proceedings of the Foundations of Health Information Engineering and Systems, 2012

Rock'n'Roll Computer Science.
Proceedings of the Logic and Program Semantics, 2012

2011
Functional High Performance Financial IT.
Proceedings of the Trends in Functional Programming, 12th International Symposium, 2011

Regular expression containment: coinductive axiomatization and computational interpretation.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Dynamic Symbolic Computation for Domain-Specific Language Implementation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Bit-coded Regular Expression Parsing.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
Generic multiset programming with discrimination-based joins and symbolic Cartesian products.
High. Order Symb. Comput., 2010

Large-scale sound and precise program analysis: technical persepctive.
Commun. ACM, 2010

A standard-driven implementaion of WS-BPEL 2.0.
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), 2010

Optimizing relational algebra operations using generic equivalence discriminators and lazy products.
Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2010

Generic multiset programming for language-integrated querying.
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, 2010

2009
POETS: Process-oriented event-driven transaction systems.
J. Log. Algebraic Methods Program., 2009

What is a Sorting Function?
J. Log. Algebraic Methods Program., 2009

2008
Generic discrimination: sorting and paritioning unshared data in linear time.
Proceedings of the Proceeding of the 13th ACM SIGPLAN international conference on Functional programming, 2008

2006
Compositional specification of commercial contracts.
Int. J. Softw. Tools Technol. Transf., 2006

2005
Editorial.
High. Order Symb. Comput., 2005

2003
Editorial: Special Issue Dedicated to Bob Paige.
High. Order Symb. Comput., 2003

2001
A Direct Approach to Control-Flow Sensitive Region-Based Memory Management.
Proceedings of the 3rd international ACM SIGPLAN conference on Principles and practice of declarative programming, 2001

1999
Breaking Through the n<sup>3</sup> Barrier: Faster Object Type Inference.
Theory Pract. Object Syst., 1999

AnnoDomini in Practice: A Type-Theoretic Approach to the Year 2000 Problem.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999

AnnoDomini: From Type Theory to Year 2000 Conversion Tool.
Proceedings of the POPL '99, 1999

1998
SIGPLAN and the World Series.
ACM SIGPLAN Notices, 1998

Coinductive Axiomatization of Recursive Type Equality and Subtyping.
Fundam. Informaticae, 1998

Constraint Automata and the Complexity of Recursive Subtype Entailment.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
The Complexity of Subtype Entailment for Simple Types.
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1995
Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time
Proceedings of the Static Analysis, 1995

A Semantic Model of Binding Times for Safe Partial Evaluation
Proceedings of the Programming Languages: Implementations, 1995

Safe Polymorphic Type Inference for Scheme: Translating Scheme to ML.
Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994
Dynamic Typing: Syntax and Proof Theory.
Sci. Comput. Program., 1994

The Complexity of Type Inference for Higher-Order Typed lambda Calculi.
J. Funct. Program., 1994

Iterative Fixed Point Computation for Type-Based Strictness Analysis.
Proceedings of the Static Analysis, First International Static Analysis Symposium, 1994

Formally Optimal Boxing.
Proceedings of the Conference Record of POPL'94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1994

Polymorphic Binding-Time Analysis.
Proceedings of the Programming Languages and Systems, 1994

1993
Type Inference with Polymorphic Recursion.
ACM Trans. Program. Lang. Syst., 1993

1992
Global Tagging Optimization by Type Inference.
Proceedings of the Conference on Lisp and Functional Programming, 1992

Dynamic Typing.
Proceedings of the ESOP '92, 1992

1991
A Decidable Case of the Semi-Unification Problem.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

Efficient Type Inference for Higher-Order Binding-Time Analysis.
Proceedings of the Functional Programming Languages and Computer Architecture, 1991

1990
Fast Left-Linear Semi-Unification.
Proceedings of the Advances in Computing and Information, 1990

1988
Type Inference and Semi-Unification.
Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987
Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study.
J. Symb. Comput., 1987


  Loading...