Person: Martin Sulzmann

DBLP: Sulzmann:Martin

Contributed to:

2015

2014

2014

2014

2013

2012

2012

2010

2009

2008

2008

2008

2007

2007

2006

2006

2004

2002

2001

2001

1996

2003

2004

2018

2019

Wrote 27 papers:

LATA-2015-SulzmannT

Derivatives for Regular Shuffle Expressions (MS, PT), pp. 275–286.

LATA-2015-ThiemannS #automaton #regular expression

From ω-Regular Expressions to Büchi Automata via Partial Derivatives (PT, MS), pp. 287–298.

CC-2014-SulzmannS #flexibility #ml #performance #regular expression

A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching (MS, PvS), pp. 174–191.

FLOPS-2014-SulzmannL #parsing #regular expression

POSIX Regular Expression Parsing with Derivatives (MS, KZML), pp. 203–220.

ICLP-J-2014-DuckHS #confluence #consistency #on the #termination #type inference

On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.

PEPM-2013-SulzmannNZ #abstraction #correctness #traceability

Traceability and evidence of correctness of EDSL abstractions (MS, JNF, AZ), pp. 71–74.

PPDP-2012-SulzmannL #regular expression #using

Regular expression sub-matching using partial derivatives (MS, KZML), pp. 79–90.

TAP-2012-SulzmannZ #analysis #finite #linear #logic

Constructive Finite Trace Analysis with Linear Temporal Logic (MS, AZ), pp. 132–148.

FLOPS-2010-ThiemannS #combinator #generative #polymorphism

Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.

ICFP-2009-SchrijversJSV #data type #decidability #type inference

Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.

ICFP-2008-SchrijversJCS #type checking

Type checking with open type functions (TS, SLPJ, MMTC, MS), pp. 51–62.

ICLP-2008-SchrijversS #constraints #transaction

Transactions in Constraint Handling Rules (TS, MS), pp. 516–530.

PPDP-2008-SulzmannL #constraints #execution #parallel

Parallel execution of multi-set constraint rewrite rules (MS, ESLL), pp. 20–31.

ICLP-2007-DuckSS #confluence #constraints

Observable Confluence for Constraint Handling Rules (GJD, PJS, MS), pp. 224–239.

IFL-2007-SulzmannL #haskell #named #regular expression

XHaskell — Adding Regular Expression Types to Haskell (MS, KZML), pp. 75–92.

FLOPS-2006-SulzmannWS #algebra #data type #framework

A Framework for Extended Algebraic Data Types (MS, JW, PJS), pp. 47–64.

PPDP-2006-Sulzmann #proving #source code

Extracting programs from type class proofs (MS), pp. 97–108.

ESOP-2004-DuckPSS #decidability #dependence #functional #type inference

Sound and Decidable Type Inference for Functional Dependencies (GJD, SLPJ, PJS, MS), pp. 49–63.

ICFP-2002-GlynnSSS #analysis #exception #strict

Exception analysis for non-strict languages (KG, PJS, MS, HS), pp. 98–109.

ICFP-2002-StuckeyS #formal method

A theory of overloading (PJS, MS), pp. 167–178.

FLOPS-2001-Sulzmann #framework #type inference

A General Type Inference Framework for Hindley/Milner Style Systems (MS), pp. 248–263.

SAS-2001-GlynnSS #analysis #constraints #effectiveness #strict

Effective Strictness Analysis with HORN Constraints (KG, PJS, MS), pp. 73–92.

CADE-1996-BeckertHOS #proving #theorem proving

The Tableau-based Theorem Prover 3TAP Version 4.0 (BB, RH, PO, MS), pp. 303–307.

Haskell-2003-StuckeySW #debugging #haskell #interactive

Interactive type debugging in Haskell (PJS, MS, JW), pp. 72–83.

Haskell-2004-StuckeySW #fault

Improving type error diagnosis (PJS, MS, JW), pp. 80–91.

PPDP-2018-SulzmannS #dynamic analysis #message passing #source code

Two-Phase Dynamic Analysis of Message-Passing Go Programs Based on Vector Clocks (MS, KS), p. 13.

PEPM-2019-DauthS #haskell #scala

Futures and promises in Haskell and Scala (TD, MS), pp. 68–74.